Comparative Study by Solving the Test Compaction Problem

Beside issues like the low power dissipation and the increase of defect coverage, test compaction is an important requirement regarding large scale integration (LSI) testing. The overall cost of a VLSI circuit's testing depends on the length of its test sequence; therefore the reduction of this sequence, keeping the coverage, will lead to a reduction of used resources in the testing process. In this paper we study test vectors over a five-valued logic. The problem of finding minimal test sets is NP-complete. Consequently, an optimal algorithm has limited practical use and is only applicable to small problem instances. We describe three approaches for reducing the length of test sequences: an optimal algorithm using a recursive backtracking method (OPT) and two greedy algorithms (GRNV and GRBT). The behavior of these algorithms is discussed and analyzed by experiments. Finally, directions for future work are given.

[1]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Noga Alon,et al.  Algorithmic construction of sets for k-restrictions , 2006, TALG.

[4]  Rolf Drechsler,et al.  Exploiting don't cares during data sequencing using genetic algorithms , 1999, Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198).

[5]  Rolf Drechsler,et al.  Efficient Evolutionary Approaches for the Data Ordering Problem with Inversion , 2006, EvoWorkshops.

[6]  D. Hochbaum,et al.  Analysis of the greedy approach in problems of maximum k‐coverage , 1998 .

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[8]  Raghu Machiraju,et al.  Coverage optimization to support security monitoring , 2007, Comput. Environ. Urban Syst..

[9]  Doina Logofătu.  Algorithmen und Problemlösungen mit C , 2010 .

[10]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[11]  Aiman H. El-Maleh,et al.  Test vector decomposition-based static compaction algorithms for combinational circuits , 2003, TODE.

[12]  Irith Pomeranz,et al.  On improving static test compaction for sequential circuits , 2001, VLSI Design 2001. Fourteenth International Conference on VLSI Design.

[13]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[14]  Irith Pomeranz,et al.  On Finding Don't Cares in Test Sequences for Sequential Circuits , 2006, IEICE Trans. Inf. Syst..

[15]  Rolf Drechsler.  Evolutionary algorithms for VLSI CAD , 1998 .

[16]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.