1. Dec. 19, 2005ATS05: Agrawal and Doshi1 Concurrent Test Generation Auburn University, Department of Electrical and Computer Engineering Auburn, AL 36849, USA Vishwani D. Agrawal Alok S. Doshi

2. Dec. 19, 2005ATS05: Agrawal and Doshi2 Problem Statement To find the smallest test set to detect all single stuck-at faults in a combinational circuit. An existing solution: –Group faults into fault sets using fault independence –Generate concurrent tests for each group Contribution of this paper: Devise a simulation- based implementation for this solution.

3. Dec. 19, 2005ATS05: Agrawal and Doshi3 Outline Introduction Simulation-based Independence Fault Collapsing Simulation-based Concurrent Test Generation Results Conclusions

4. Dec. 19, 2005ATS05: Agrawal and Doshi4 Introduction v1v1 v2v2 v3v3... T(F1) T(F2) Problem of finding a minimal test: Static compaction cannot guarantee optimality. Dynamic compaction is complex. Solution: Target both faults F1 and F2 at the same time to find a single test. We define this as concurrent test generation. Test set for fault F1 Test set for fault F2

5. Dec. 19, 2005ATS05: Agrawal and Doshi5 Fault Classification F1 and F2 are equivalent. F1 dominates F2. F1 and F2 are independent. F1 and F2 are concurrently testable. T(F1) = T(F2) T(F1) T(F2) T(F1) T(F2) T(F1)

6. Dec. 19, 2005ATS05: Agrawal and Doshi6 Example Circuit 2 4 1 6 8 7 3 9 5 10 11 a b c d e x y C17 - ISCAS85 Benchmark Circuit 1 R. K. K. R. Sandireddy and V. D. Agrawal, “Diagnostic and Detection Fault Collapsing for Multiple Output Circuits,” Proc. Design, Automation and Test in Europe (DATE) Conf., Mar. 2005, pp. 1014 - 1019. All faults are Stuck-at-1 type

7. Dec. 19, 2005ATS05: Agrawal and Doshi7 Independence Matrix and Graph C17 - ISCAS85 Benchmark Circuit F1234567891011 101111100101 210011010001 310001111011 411001010001 511110001110 610100011100 701110101100 800101110111 910001111011 1000101001101 1111110001110

8. Dec. 19, 2005ATS05: Agrawal and Doshi8 Independence Fault Collapsing 1,8 5,11,7 3,9,2 4,6,10 2 A. S. Doshi and V. D. Agrawal, “Independence Fault Collapsing,” Proc. 9 th VLSI Design and Test Symp., Aug. 2005, pp. 357 - 364. C17 - ISCAS85 Benchmark Circuit A “similarity” based algorithm [2] collapses the independence graph:

9. Dec. 19, 2005ATS05: Agrawal and Doshi9 Simulation-based Independence Fault Collapsing 2 A. S. Doshi and V. D. Agrawal, “Independence Fault Collapsing,” Proc. 9 th VLSI Design and Test Symp., Aug. 2005, pp. 357 - 364. The independence graph generation procedure [2] requires ATPG. Here we present a new method for graph generation using simulation: –Start with a fully-connected independence graph for an equivalence collapsed fault set. –Simulation of random vectors without fault dropping removes edges between faults detected by the same vector.

10. Dec. 19, 2005ATS05: Agrawal and Doshi10 Simulation-based Independence Fault Collapsing 74181 4-bit ALU 301

11. Dec. 19, 2005ATS05: Agrawal and Doshi11 Simulation-based Concurrent Test Generation For each group, generate all test vectors for the first fault in the group. –If the number of test vectors for a fault is large, use a subset (e.g., 250 maximum) of vectors. Simulate all faults in the group to select one vector that detects most faults in that group. –If more vectors than one detect the same number of faults within the group, then select the vector that detects most faults outside the group as well.

12. Dec. 19, 2005ATS05: Agrawal and Doshi12 74181 4-bit ALU Result Group numberNumber of faults in groupConcurrent test vector 1 2 3 4 5 6 7 8 9 10 11 12 13 9 15 11 6 11 17 11 16 22 56 81 01100011111100 01101100000110 10100101111010 11011010100000 10110101011010 10100111101010 10010101001110 01000111101011 11100010010011 11011100110100 01010001100001 All 56 faults detected by eleven previously generated vectors 10101001110110

13. Dec. 19, 2005ATS05: Agrawal and Doshi13 * Sun Ultra 5 *** Pentium Pro PC ** Hamzaoglu and Patel, IEEE-TCAD, 2000 Results Circuit No. of concurrent groups Concurrent ATPG Single-fault ATPG VectorsCPU s* AtalantaBest known VectorsCPU s*VectorsCPU s*** 1-b adder 2-b adder 4-b adder 8-b adder 16-b adder 32-b adder 4-b ALU c17 c432 c499 c880 c1355 c1908 c2670 c3540 c5315 c6288 c7552 5 7 13 4 30 52 24 84 106 81 107 92 23 190 5 7 9 11 12 4 34 52 29 84 111 92 130 104 25 198 0.085 0.092 0.103 0.182 3.3 9.7 11.4 0.082 10.4 14.6 23.3 34 49.6 57.6 119.6 216.3 158.1 360.7 5-7 7-9 8-11 10-15 13-22 17-25 22-40 6-9 49-77 54-68 52-106 85-109 118-173 106-192 147-263 114-224 32-48 209-358 0 0.017 0.050 0.033 0 0.083 0.033 0.133 0.1 0.5 1.2 1.9 0.733 4.7 5.283 5 12 4 27** 52** 16** 84** 106** 44** 84** 37** 12** 73** - 15 0.1 21.9 0.9 88.1 47.1 174.5 748.6 347.7 663.8

14. Dec. 19, 2005ATS05: Agrawal and Doshi14 Number of Vectors for Increasing Circuit Sizes (100% Stuck-at Coverage) Single-fault ATPG (no compaction) Concurrent ATPG Minimum achieved! (dynamic compaction)

15. Dec. 19, 2005ATS05: Agrawal and Doshi15 CPU Seconds for Increasing Circuit Sizes (100% Stuck-at Fault Coverage) Concurrent ATPG Minimum achieved! (dynamic compaction)

16. Dec. 19, 2005ATS05: Agrawal and Doshi16 Conclusion Concurrent test generation produces compact tests when combined with independence fault collapsing. ATPG and set covering problems have exponential time complexities. Hence, we cannot expect absolute optimality for large circuits. The concurrent ATPG procedure of this paper gives significantly smaller, and sometimes the optimum, test sets. There is scope for improving the simulation-based algorithms for independence fault collapsing and concurrent test generation.

17. Dec. 19, 2005ATS05: Agrawal and Doshi17 Thank You!