A new SAT-based ATPG for generating highly compacted test sets

The test set size is a highly important factor in the post-production test of circuits. A high pattern count in the test set leads to long test application time and exorbitant test costs. We propose a new test generation approach which has the ability to reduce the test set size significantly. In contrast to previous SAT-based ATPG techniques which were focused on dealing with hard single faults, the proposed approach employs the robustness of SAT-solvers to primarily push test compaction. Furthermore, a concept is introduced how the novel technique can be flexibly integrated into an existing industrial flow to reduce the pattern count. Experimental results on large industrial circuits show that the approach is able to reduce the pattern count of up to 63% compared to state-of-the-art dynamic compaction techniques.

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

[2]  Hideo Fujiwara,et al.  On the Acceleration of Test Generation Algorithms , 1983, IEEE Transactions on Computers.

[3]  Robert K. Brayton,et al.  Combinational test generation using satisfiability , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Sudhakar M. Reddy,et al.  TIGUAN: Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability ANalysis , 2009, 2009 22nd International Conference on VLSI Design.

[5]  Rolf Drechsler,et al.  Efficient Data Structures and Methodologies for SAT-Based ATPG Providing High Fault Coverage in Industrial Application , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[7]  Armando Tacchella,et al.  Theory and Applications of Satisfiability Testing: 6th International Conference, Sat 2003, Santa Margherita Ligure, Italy, May 5-8 2003: Selected Revised Papers (Lecture Notes in Computer Science, 2919) , 2004 .

[8]  Janusz Rajski,et al.  Test Data Decompression for Multiple Scan Designs with Boundary Scan , 1998, IEEE Trans. Computers.

[9]  Irith Pomeranz,et al.  A scalable method for the generation of small test sets , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

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

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

[12]  Sudhakar M. Reddy,et al.  Dynamic Compaction in SAT-Based ATPG , 2009, 2009 Asian Test Symposium.

[13]  Janak H. Patel,et al.  New Techniques for Deterministic Test Pattern Generation , 1999, J. Electron. Test..

[14]  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..

[15]  Rolf Drechsler,et al.  On Acceleration of SAT-Based ATPG for Industrial Designs , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[17]  Jau-Shien Chang,et al.  Test set compaction for combinational circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..