DocumentCode :
3028770
Title :
Compacting randomly generated test sets
Author :
Aylor, J.H. ; Cohoon, J.P. ; Feldhousen, E.L. ; Johnson, B.W.
Author_Institution :
Center for Semicustom Integrated Syst., Virginia Univ., Charlottesville, VA, USA
fYear :
1990
fDate :
17-19 Sep 1990
Firstpage :
153
Lastpage :
156
Abstract :
A technique using genetic algorithms is presented for the generation of compact test sets for combinational VLSI circuits. The technique combines a previously proven method for random test pattern generation with adaptive searching capabilities to produce high-quality test sets. A series of experiments demonstrated that the technique performed consistently better than the traditional method. On average, the method is able to produce test sets that are approximately 20% smaller than the starting configuration. To place this in perspective, its solutions are on average 13% more compact than those produced by a traditional method with no loss in fault coverage
Keywords :
VLSI; built-in self test; combinatorial circuits; genetic algorithms; integrated circuit testing; logic testing; adaptive searching; combinational VLSI circuits; compact test sets; fault coverage; genetic algorithms; random test pattern generation; Automatic testing; Circuit faults; Circuit testing; Costs; Fault detection; Genetic algorithms; Genetic mutations; Optimization methods; System testing; Test pattern generators;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Design: VLSI in Computers and Processors, 1990. ICCD '90. Proceedings, 1990 IEEE International Conference on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-8186-2079-X
Type :
conf
DOI :
10.1109/ICCD.1990.130188
Filename :
130188
Link To Document :
بازگشت