Dynamic Compaction for High Quality Delay Test

Dynamic compaction is an effective way to reduce the number of test patterns while maintaining high fault coverage. This paper proposes a new dynamic compaction algorithm for generating compacted test sets for K longest paths per gate (KLPG) in combinational circuits or scan-based sequential circuits. This algorithm uses a greedy approach to compact paths with non-conflicting assignments together during test generation. Experimental results for ISCAS89 benchmark circuits and two industry circuits show that the pattern count of KLPG can be significantly reduced (up to 3x compared to static compaction) using the proposed method. The pattern count after dynamic compaction is comparable to the number of transition fault tests, while achieving higher test quality.

[1]  Gordon L. Smith,et al.  Model for Delay Faults Based upon Paths , 1985, ITC.

[2]  Irith Pomeranz,et al.  On static compaction of test sequences for synchronous sequential circuits , 1996, DAC '96.

[3]  Jing Wang,et al.  A vector-based approach for power supply noise analysis in test compaction , 2005, IEEE International Conference on Test, 2005..

[4]  Weiping Shi,et al.  A statistical fault coverage metric for realistic path delay faults , 2004, 22nd IEEE VLSI Test Symposium, 2004. Proceedings..

[5]  Jau-Shien Chang,et al.  Test set compaction for combinational circuits , 1992, Proceedings First Asian Test Symposium (ATS `92).

[6]  Lalit M. Patnaik,et al.  Line coverage of path delay faults , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Michael H. Schulz,et al.  SOCRATES: a highly efficient automatic test pattern generation system , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Irith Pomeranz,et al.  On Selecting Testable Paths in Scan Designs , 2003, J. Electron. Test..

[9]  P. Goel.  Test Generation and Dynamic Compaction of Tests , 1979 .

[10]  Irith Pomeranz,et al.  Selection of potentially testable path delay faults for test generation , 2000, Proceedings International Test Conference 2000 (IEEE Cat. No.00CH37159).

[11]  Kwang-Ting Cheng,et al.  Delay fault testing for VLSI circuits , 1998 .

[12]  Irith Pomeranz,et al.  Cost-effective generation of minimal test sets for stuck-at faults in combinational logic circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Janak H. Patel,et al.  Test set compaction algorithms for combinational circuits , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[14]  D. M. H. Walker,et al.  An efficient algorithm for finding the k longest testable paths through each gate in a combinational circuit , 2003, International Test Conference, 2003. Proceedings. ITC 2003..

[15]  Irith Pomeranz,et al.  COMPACTEST: a method to generate compact test sets for combinational circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  Hugo De Man,et al.  Timing verification using statically sensitizable paths , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Xiaoqing Wen,et al.  Path delay test compaction with process variation tolerance , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[18]  Xiaoqing Wen,et al.  A dynamic test compaction procedure for high-quality path delay testing , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[19]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

[20]  Anthony Moore,et al.  Comparison of Delay Tests on Silicon , 2006, 2006 IEEE International Test Conference.

[21]  Sudhakar M. Reddy,et al.  On path selection in combinational logic circuits , 1988, DAC '88.

[22]  Janak H. Patel,et al.  Finding a small set of longest testable paths that cover every gate , 2002, Proceedings. International Test Conference.

[23]  Dhiraj K. Pradhan,et al.  A method to derive compact test sets for path delay faults in combinational circuits , 1993, Proceedings of IEEE International Test Conference - (ITC).

[24]  Weiping Shi,et al.  K longest paths per gate (KLPG) test generation for scan-based sequential circuits , 2004, 2004 International Conferce on Test.

[25]  Irith Pomeranz,et al.  ROTCO: a reverse order test compaction technique , 1992, Proceedings Euro ASIC '92.

[26]  Irith Pomeranz,et al.  COMPACTEST: A METHOD TO GENERATE COMPACT TEST SETS FOR COMBINATIONAL CIRCUITS , 1991, 1991, Proceedings. International Test Conference.