TAO: regular expression based high-level testability analysis and optimization

  • Authors:
  • Srivaths Ravi;Ganesh Lakshminarayana;Niraj K. Jha

  • Affiliations:
  • -;-;-

  • Venue:
  • ITC '98 Proceedings of the 1998 IEEE International Test Conference
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present TAO, a novel methodology for high-leveltestability analysis and optimization of register-transfer levelcontroller/data path circuits. Unlike existing high-level testingtechniques that cater restrictively to certain classes of circuitsor design styles, TAO exploits the algebra of regular expressionsto provide a unified framework for handling a widevariety of circuits including application-specific integrated circuits,application-specific programmable processors, application-specificinstruction processors, digital signal processors and microprocessors.We also augment TAO with a design-for-test frameworkthat can provide a low-cost testability solution by examiningthe trade-offs in choosing from a diverse array of testability modificationslike partial scan or test multiplexer insertion in differentparts of the circuit. Test generation is symbolic and, hence,independent of bit-width. Experimental results on benchmark circuitsshow that TAO is very efficient, in addition to being comprehensive.The fault coverage obtained is above 99% in all cases.The average area and delay overheads for incorporating testabilityinto the benchmarks are only 3.3% and 1.1%, respectively. Thetest application time is comparable to that associated with gate-levelsequential test generators.