Transcript slides

Concurrent Test Generation
Vishwani D. Agrawal
Alok S. Doshi
Auburn University, Department of Electrical and Computer Engineering
Auburn, AL 36849, USA
Dec. 19, 2005
ATS05: Agrawal and Doshi
1
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 simulationbased implementation for this solution.
Dec. 19, 2005
ATS05: Agrawal and Doshi
2
Outline
• Introduction
• Simulation-based Independence Fault
Collapsing
• Simulation-based Concurrent Test Generation
• Results
• Conclusions
Dec. 19, 2005
ATS05: Agrawal and Doshi
3
Introduction
Problem of finding a minimal test:
• Static compaction cannot guarantee optimality.
• Dynamic compaction is complex.
Test set for fault F1
.
.
.
T(F1)
v1
v3
T(F2)
v2
Test set for fault F2
• Solution: Target both faults F1 and F2 at the same time to find
a single test. We define this as concurrent test generation.
Dec. 19, 2005
ATS05: Agrawal and Doshi
4
Fault Classification
T(F1)
T(F1) = T(F2)
T(F2)
F1 and F2 are equivalent.
T(F1)
T(F1)
T(F2)
F1 and F2 are independent.
Dec. 19, 2005
F1 dominates F2.
T(F2)
F1 and F2 are concurrently testable.
ATS05: Agrawal and Doshi
5
Example Circuit
2
a
e
x
1
b
c
d
4
5
7
6
8
3
9
11
10
y
All faults are
Stuck-at-1 type
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.
Dec. 19, 2005
ATS05: Agrawal and Doshi
6
Independence Matrix and Graph
F 1
2
3
4
5
6
7
8
9 10 11
1 0
1
1
1
1
1
0
0
1
0
1
2 1
0
0
1
1
0
1
0
0
0
1
3 1
0
0
0
1
1
1
1
0
1
1
4 1
1
0
0
1
0
1
0
0
0
1
5 1
1
1
1
0
0
0
1
1
1
0
6 1
0
1
0
0
0
1
1
1
0
0
7 0
1
1
1
0
1
0
1
1
0
0
8 0
0
1
0
1
1
1
0
1
1
1
9 1
0
0
0
1
1
1
1
0
1
1
10 0
0
1
0
1
0
0
1
1
0
1
11 1
1
1
1
0
0
0
1
1
1
0
1
2
3
4
5
11
Dec. 19, 2005
6
7
8
9
10
C17 - ISCAS85 Benchmark Circuit
ATS05: Agrawal and Doshi
7
Independence Fault Collapsing
A “similarity” based algorithm [2] collapses the independence graph:
1,8
5,11,7
3,9,2
4,6,10
C17 - ISCAS85 Benchmark Circuit
2 A.
S. Doshi and V. D. Agrawal, “Independence Fault Collapsing,” Proc. 9th VLSI Design and
Test Symp., Aug. 2005, pp. 357 - 364.
Dec. 19, 2005
ATS05: Agrawal and Doshi
8
Simulation-based Independence Fault
Collapsing
• 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.
2 A.
S. Doshi and V. D. Agrawal, “Independence Fault Collapsing,” Proc. 9th VLSI Design and
Test Symp., Aug. 2005, pp. 357 - 364.
Dec. 19, 2005
ATS05: Agrawal and Doshi
9
Simulation-based Independence Fault
Collapsing
100000
320
301
Fault Coverage (293)
75000
240
50000
160
25000
80
Faults Detected
Number of edges
90601
Number of edges in graph (20004)
0
0
0
500
1000
1500
Random Vectors
Dec. 19, 2005
ATS05: Agrawal and Doshi
2000
2500
74181 4-bit ALU
10
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.
Dec. 19, 2005
ATS05: Agrawal and Doshi
11
74181 4-bit ALU Result
Group number
Number of faults in group
Concurrent test vector
1
2
3
4
5
6
7
8
9
10
11
12
9
15
11
6
11
17
11
16
16
22
22
56
13
81
01100011111100
01101100000110
10100101111010
11011010100000
10110101011010
10100111101010
10010101001110
01000111101011
11100010010011
11011100110100
01010001100001
All 56 faults detected by eleven
previously generated vectors
10101001110110
Dec. 19, 2005
ATS05: Agrawal and Doshi
12
Results
Circuit
Concurrent ATPG
No. of
concurrent
groups
Vectors
CPU s*
5
5
5
7
7
7
13
4
30
52
24
84
106
81
107
92
23
190
5
5
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
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
Single-fault ATPG
Atalanta
Best known
Vectors
CPU s*
Vectors
CPU s***
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
0
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
5
5
5
5
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
* Sun Ultra 5 *** Pentium Pro PC ** Hamzaoglu and Patel, IEEE-TCAD, 2000
Dec. 19, 2005
ATS05: Agrawal and Doshi
13
Number of Vectors for Increasing
Circuit Sizes (100% Stuck-at Coverage)
400
350
Single-fault ATPG
(no compaction)
300
Concurrent ATPG
250
200
150
Minimum achieved!
(dynamic compaction)
min
conc-ATPG
sf-ATPG
100
50
0
Dec. 19, 2005
ATS05: Agrawal and Doshi
14
CPU Seconds for Increasing Circuit
Sizes (100% Stuck-at Fault Coverage)
800
700
600
Concurrent ATPG
500
400
300
Minimum achieved!
(dynamic compaction)
min
conc-ATPG
200
100
0
Dec. 19, 2005
ATS05: Agrawal and Doshi
15
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.
Dec. 19, 2005
ATS05: Agrawal and Doshi
16
Thank You!
Dec. 19, 2005
ATS05: Agrawal and Doshi
17