Lecture 05 - Fault - Simulation
Lecture 05 - Fault - Simulation
Netlist
Fault Statistics
Collapsed fault list Fault Simulator
A0, A1, B0…
8/20/2023 2
SPJ is a lengthy process needs to be done for fault separately, but we can get 100% fault
coverage of detectable faults.
8/20/2023 3
90
80
70
% Fault Coverage
60
50
40
30
20
10
0
0 20 40 60 80 100 120 140 160 180 200
RTP is a very fast process, detects multiple faults in each run, but we may not get 100%
fault coverage of detectable faults.
8/20/2023 4
The block C( ) is the fault-free circuit and blocks C(f1) through C(fn) are copies of the same
circuit with faults f1 through fn . The same vectors are applied to all blocks and the outputs
of the faulty circuits are compared in the comparators shown as Comp. Event Driven can
save time as one circuit to other not much change
When fault fn is detected for the first time by vector 35, the simulation of block C(fn) is
suspended beyond that vector. This procedure, known as fault dropping, considerably speeds
up the fault simulation process .
8/20/2023 5
Fault dropping considerably speeds up the fault simulation process . Max time for Algorithm
is M(n+1), M is max total test vectors of each block, n is number of faults. While testing only n
vectors max required, Algorithm finds those n vectors. Could be less than n as multiple faults
can be detected by a same vector.
8/20/2023 6
MZ M0
Fault Free 1 0
S-a-1 X 1
S-a-0 0 0
𝒁′ = 𝒁&𝑴𝒁 |𝑴𝟎
Each faut site to be modeled as above and in test bench values of MZ and M0 are be set
for different runs
8/20/2023 7
8/20/2023 8
8/20/2023 9
Advantages:
Easy to implement
Ability to handle a wide range of fault models (stuck-at, delay, Br, …)
Very fast combinational simulation
Disadvantages:
Many simulation runs required
CPU time prohibitive for VLSI circuits
8/20/2023 10
8/20/2023 11
1 1 1 1
1 W5 1 0 1 0
s-a-0 s-a-0
1
W1 1 0 1 0
1 1 1 0 1 0 1 0 W6
O2
s-a-1
W4 0 0 1 0
1 1 1 0 0 0 1 1
https://www.youtube.com/watch?v=eLUhlph4VCQ
8/20/2023 12
Advantages:
A large number of faults are detected by each pattern when simulating the
beginning of test sequence.
„ isadvantages:
D
Only applicable to the unit or zero delay models
Faults cannot be dropped unless all (w-1) faults are detected
8/20/2023 13
All signal values in each faulty circuit are deduced from the fault-free
circuit values and the circuit structure. Since the circuit structure is the same
for all faulty circuits, all deductions are carried out simultaneously. Thus, a
deductive fault simulator processes all faults in a single pass of true-value
simulation augmented with the deductive procedures. This gives the deductive
simulators a tremendous speed, but only when the modeling conditions can be
satisfied.
https://www.youtube.com/watch?v=zTLI2i69tKQ
8/20/2023 14
1 c 0/1
e 0/1
b
Lb=[b0] Le=[a1, c1, e1]
Inputs Output
Gate Type a b c O/P Fault List
AND 0 1 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
https://www.youtube.com/watch?v=zTLI2i69tKQ
8/20/2023 15
0 c 0/1
e 0/1
b
Lb=[b1] Le=[b1, c1, e1]
Inputs Output
Gate Type a b c O/P Fault List
AND 0 1 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
AND 1 0 0 (𝐿𝑏 ∩ 𝐿𝑎) ∪ 𝑐1
https://www.youtube.com/watch?v=zTLI2i69tKQ
8/20/2023 16
0 c 0/1
e 0/1
b
Lb=[b1] Le=[La.Lb ,c1, e1]
Inputs Output
Gate Type a b c O/P Fault List
AND 0 1 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
AND 1 0 0 (𝐿𝑏 ∩ 𝐿𝑎) ∪ 𝑐1
AND 0 0 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
8/20/2023 https://www.youtube.com/watch?v=zTLI2i69tKQ 17
1 c 1/0
e 1/0
b
Lb=[b0] Le=[a0, bo, co, d0]
Inputs Output
Gate Type a b c O/P Fault List
AND 0 1 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
AND 1 0 0 (𝐿𝑏 ∩ 𝐿𝑎) ∪ 𝑐1
AND 0 0 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
AND 1 1 1 (𝐿𝑎 ∪ 𝐿𝑏) ∪ 𝑐0
8/20/2023 https://www.youtube.com/watch?v=zTLI2i69tKQ 18
1 c 1/0
e 1/0
b
Lb=[b0] Le=[a0, bo, co, d0]
Inputs Output
Gate Type a b c O/P Fault List
AND 0 1 0 a1, c1
AND 1 0 0 b1, c1
AND 0 0 0 c1
AND 1 1 1 a0, b0, c0
8/20/2023 https://www.youtube.com/watch?v=zTLI2i69tKQ 19
0 c 0/1
b
Lb=[a1]
8/20/2023 20
Lb=[a1, b0]
La=[a1] Lc=[b0, c1]
0
b 1/0
c 0/1
La=[a1]
0
Inputs Output
Gate Type a b c O/P Fault List
AND 0 1 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
AND 1 0 0 (𝐿𝑏 ∩ 𝐿𝑎) ∪ 𝑐1
AND 0 0 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
AND 1 1 1 (𝐿𝑎 ∪ 𝐿𝑏) ∪ 𝑐0
8/20/2023 21
Lb=[a0, b1]
La=[a0] Lc=[ao,b1, c1]
1
b 0/1
c 0/1
La=[a0]
1
Inputs Output
Gate Type a b c O/P Fault List
AND 0 1 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
AND 1 0 0 (𝐿𝑏 ∩ 𝐿𝑎) ∪ 𝑐1
AND 0 0 0 (𝐿𝑎 ∩ 𝐿𝑏) ∪ 𝑐1
AND 1 1 1 (𝐿𝑎 ∪ 𝐿𝑏) ∪ 𝑐0
8/20/2023 22
Single Vector Simulation will give what are the faults which can
be detected and what should be the correct expected result.
8/20/2023 23
8/20/2023 24
Advantages:
Very efficient
Simulate all faults in one pass
Disadvantages:
Not easy to handle unknowns
Only for zero-delay timing model Potential
memory management problem
8/20/2023 25
✓ ✓ ✓ ✓
8/20/2023
Good event
Events that happen in good circuit
Affect both good gates and bad gates
Bad event
Events that occur in the faulty circuit of corresponding fault
Affect only bad gates
Diverge
Addition of new bad gates
Converge
Removal of bad gates whose I/O signals are the same as corresponding good gates
8/20/2023
8/20/2023 29
Not Computed
data from previous
simulation retained
8/20/2023 30
8/20/2023 31
Advantages
Efficient
Faults can be simulated in any modeling style or detail supported in true-
value simulation (offers most flexibility.)
Faster than other methods
Disadvantages
Potential memory problem
Size of the concurrent fault list changes at run time
8/20/2023 32
Speed
Serial fault simulation: slowest
Parallel fault simulation: O(n3), n: num of gates
Deductive fault simulation: O(n2)
Concurrent fault is faster than deductive fault simulation
Memory usage
Serial fault simulation, parallel fault simulation: no problem
Deductive fault simulation: dynamic allocate memory and hard to predict size
Concurrent fault simulation: more severe than deductive fault simulation
8/20/2023 33
In Roth’s D-calculus D = (1,0) and D’=(0,1). D algebra will be covered in subsequent classes.
8/20/2023 34
3. NPTEL Lectures
https://www.youtube.com/watch?v=M8VEEaYwlQ&list=PLbMVogVj5nJTClnafWQ9F
K2nt3cGG8kCF&index=31
35