Professional Documents
Culture Documents
Tim Cheng
06_seq_tg, v1.0
06_seq_tg, v1.0
RTL/
gate
level
asynchronous
simulation
based
approach
gate
level
known
initial
state
unknown
initial
state
simulation
based
approach
time-frame
expansion
based approach
06_seq_tg, v1.0
06_seq_tg, v1.0
An Example
IN
OUT
s.a.1
y1
y2
Y2
Y1
FF1
FF2
06_seq_tg, v1.0
Example: Step 1
IN 0
1
OUT0
X
D
s.a.1
Time Frame 0
06_seq_tg, v1.0
Example: Step 2
IN 0
IN1
OUT0
D s.a.1
Time Frame 0
OUT1
s.a.1
Time Frame 1
06_seq_tg, v1.0
Example: Step 3
IN-1
IN0
OUT-1
Time Frame -1
06_seq_tg, v1.0
IN
OUT0
D s.a.1
Time Frame 0
D D
OUT1
s.a.1
Time Frame 1
F F
fa u ltfre e
fa u lty
fa u ltfre e
fa u lty
06_seq_tg, v1.0
a
b
s.a.1
....
0
0
s.a.1
a
D 1
b
1
D
Conflict
1
0
D
D
0
0
No Test
06_seq_tg, v1.0
10
Nine-Valued D-Algorithm
(Muth, IEEE TC, June 1976)
Extended D-Algorithm is not complete
If nine-value, instead of five-value, is used, it will
be a complete algorithm
Ordered pairs of states of the fault-free and faulty
circuits (0/0, 0/1, 0/X, 1/0, 1/1, 1/X, X/0, X/1, X/X)
A superset of the five values (0=0/0, 1=1/1, X=X/X,
D=1/0, D=0/1) used in the D-Algorithm
Take into account the possible repeated effects of the
fault in the iterative array model
11
06_seq_tg, v1.0
s.a.1 No Conflict
....
a
0/1
b
1/X
0/X
1/0
0/1
0/X
0/0
1/X
0/X
06_seq_tg, v1.0
V1
V2
1
12
Consider the SA-0 fault at the most significant bit of a 20bit counter....
13
06_seq_tg, v1.0
s.a.1
Z
Faulty function
06_seq_tg, v1.0
14
C
1
A
X s.a.1
B
C
0/1
1
Z
X s.a.1
B
Z
1/0
06_seq_tg, v1.0
15
Consider the SA-0 fault at the most significant bit of a 20bit counter....
06_seq_tg, v1.0
16
0/0
1/0
00
x/0
x/0
s.a.0
0/1
01
10
11
1/1
Y1 = xy1y2+y1y2+y1y2+xy1y2
Y2 = y1y2+y1y2
x/0
00
Z = y1y2
x/0
01
Faulty STG
10
x/0
0/1 11
1/1
The fault is detectable if the power-up state of the faulty circuit is 00,
otherwise, it is undetectable => It is potentially detectable.
K.T. Tim Cheng
17
06_seq_tg, v1.0
A
C
s.a.1
V1
Initial
state =
X/0
1/0
V2
0/0
Sequence A
DFF
06_seq_tg, v1.0
Initial
state =
X/1
1/1
0/1
18
FF
Output
X
06_seq_tg, v1.0
19
Consider the SA-0 fault at the most significant bit of a 20bit counter....
06_seq_tg, v1.0
20
10
01
00
10
preset
DFF
w/ asyn.
preset/clear
clear
XX
00
(stable 0)
00
(stable 0)
Hazard-free
06_seq_tg, v1.0
21
Consider the SA-0 fault at the most significant bit of a 20bit counter....
06_seq_tg, v1.0
22
11
BUS FLOAT?
Weak pullup
or
Bus holder
enable_2
data_2
enable_3
data_3
enable_4
data_4
K.T. Tim Cheng
06_seq_tg, v1.0
23
Dynamic compaction
Process every partially-done ATPG vector immediately
Assign 0 or 1 to PIs to test additional faults
Ack: Bushnell and Agrawal, Essential of Electronic Testing, 2000
K.T. Tim Cheng
06_seq_tg, v1.0
24
12
t2 = 0 X 1
t3 = 0 X 0;
t4 = X 0 1
25
06_seq_tg, v1.0
RTL/
gate
level
asynchronous
asynchronous
simulation
based
gate
level
known
initial
state
unknown
initial
state
simulation
based
06_seq_tg, v1.0
time-frame
expansion
26
13
06_seq_tg, v1.0
27
06_seq_tg, v1.0
28
14
Summary - ATPG
Commercial ATPG tools can handle >10M gates for
combinational and full-scan circuits
Sequential ATPG tools are also commercially
available but cannot handle large ckts without
design-for-testability (DfT)
Sequential ckts have potentially detectable faults
Undetectability does not imply redundancy for
sequential ckts
06_seq_tg, v1.0
29
15