Professional Documents
Culture Documents
Fault Model PDF
Fault Model PDF
Some Definitions
Why Modeling Faults
Various Fault Models
Fault Detection
Fault Collapsing
Fault model.1
Some Real Defects in Chips
Processing Faults
missing contact windows
parasitic transistors
oxide breakdown
Material Defects
bulk defects (cracks, crystal imperfections)
surface impurities (ion migration)
Time-Dependent Failures
dielectric breakdown
electromigration
Packaging Failures
contact degradation
seal leaks
Fault model.2
Faults, Errors and Failures
Fault: A physical defect within a circuit or a system
May or may not cause a system failure
Fault model.3
Why Model Faults ?
Fault model.4
Fault Models
Stuck-At Faults
Bridging Faults
Transistor Stuck-On/Open Faults
Functional Faults
Memory Faults
PLA Faults
Delay Faults
State Transition Faults
Fault model.5
Single Stuck-At Faults
Faulty Response
Test Vector Fault-free Response
0 0
1
1/ 0
1
1 1/0
stuck-at-0
Fault model.6
Multiple Stuck-At Faults
Fault model.7
Why Single Stuck-At Fault Model?
Complexity is greatly reduced.
Many different physical defects may be modeled by the same logical
single stuck-at fault.
Single stuck-at fault is technology independent.
Can be applied to TTL, ECL, CMOS, etc.
Single stuck-at fault is design style independent.
Gate Arrays, Standard Cell, Custom VLSI
Even when single stuck-at fault does not accurately
model some physical defects, the tests derived for logic
faults are still valid for most defects.
Single stuck-at tests cover a large percentage of
multiple stuck-at faults.
Fault model.8
Bridging Faults
B g B g
B g B g
CMOS ?
Fault model.9
CMOS Transistor Stuck-ON
IDDQ
0 stuck-on
stuck-open
? = previous state
0
Fault model.11
CMOS Transistor Stuck-OPEN (Cont.)
Initialization
stuck-open
vector
01/00
10
memory
behaviour
Fault model.12
Functional Faults
Fault model.13
Functional Faults of Decoder
AB
A
2-bit AB
Decoder AB
B
AB
Fault model.14
Memory Faults
Parametric Faults
Output Levels
Power Consumption
Noise Margin
Data Retention Time
Functional Faults
Stuck Faults in Address Register, Data Register,
and Address Decoder
Cell Stuck Faults
Adjacent Cell Coupling Faults
Pattern-Sensitive Faults
Fault model.15
Memory Faults (Cont.)
0 0 0
a=b=0 d=0
0 d b
a=b=1 d=1
0 a 0
Fault model.16
PLA Faults
Stuck Faults
Crosspoint Faults
- Extra/Missing Transistors
Bridging Faults
Break Faults
Fault model.17
Missing Crosspoint Faults in PLA
Missing crosspoint in AND-array
- Growth fault
Missing crosspoint in OR-array
- Disappearance fault
Equivalent stuck fault representation
A B C f1 f2 A B C
Growth
s-a-1
s-a-0
f1
f2
Disappearance
Fault model.18
Extra Crosspoint Faults in PLA
Extra crosspoint in AND-array
- Shrinkage or disappearance fault
Extra crosspoint in OR-array
- Appearance fault
Equivalent stuck fault representation
A B C
A B C f1 f2
f1
f2
Disapp.
Shrinkage "1" "0"
Appearance
Fault model.19
Gate-Delay-Fault
VDD VDD
R1
X
X
L ---> H
CL
Fault model.20
Gate-Delay-Fault
slow
Disadvantage:
Delay faults resulting from the sum
of several small incremental delay
defects may not be detected.
Fault model.21
Path-Delay-Fault
Propagation delay of the path exceeds
the clock interval.
The number of paths grows exponentially
with the number of gates.
Fault model.22
State Transition Graph
Each state transition is associated with a 4-tuple:
(source state, input, output, destination state)
S1
I2/O2 I1/O1
S2 S3
Fault model.23
Single State Transition Fault Model
A fault causes a single state transition
to a wrong destination state.
S1
I/O I/O
S2 S3
Fault model.24
Fault Detection
A test (vector) t detects a fault f iff z (t ) z f (t ) = 1
t detects f <=> ( ) ( )
Example
X1 Z1
x
s-a-1
X2
X3 Z2
Z 1f =X1 Z 2f =X2X3
1
0/1
z
s-a-1
G2 G4
0/1 0/1
X4 1
z (1011)=0 zf (1011)=1
1011 detects the fault f (G2 stuck-at 1)
v/vf : v = signal value in the fault free circuit
vf = signal value in the faulty circuit
Fault model.26
Sensitization
Fault model.27
Detectability
Fault model.28
Undetectable Fault
1
a
G1 1/0
1
s-a-0
b 0 x
z
0
0
???
c
1
G1 output stuck-at-0 fault is undetectable
Undetectable faults do not change the function of the
circuit
The related circuit can be deleted to simplify the circuit
Fault model.29
Test Set
Fault model.30
Fault Equivalence
Fault model.31
Fault Equivalence
Fault model.32
Equivalence Fault Collapsing
Fault model.33
Fault Dominance
Fault model.34
Fault Dominance
Fault model.35
Fault Dominance
D
x
A
C x
B
x
E
Detect A sa1:
( ) ( ) = (CD CE) (D CE) = D CD =
(C = 0, D = 1)
Detect C sa1:
( ) ( ) = (CD CE) (D E) =
(C = 0, D = 1) or (C = 0, E = 1)
C sa1 --> A sa1
Similarly C sa1 --> B sa1
C sa0 --> A sa0
C sa0 --> B sa0
Fault model.36
Fault Collapsing
Fault model.37
Prime Fault
Fault model.38
Why Fault Collapsing?
Memory & CPU-Time saving
To ease the burden for test generation
and fault simulation in testing
# of # of # of
total faults equivalent faults prime faults
1 60% 40%
Fault model.39
Fault Collapsing for
a Combinational Circuit
Fault model.40
Checkpoint Theorem
Fault model.41
Fault Collapsing
The set of checkpoint faults can be further
collapsed by using equivalence and dominance
relation
Example
a
d
f
b h
e g
c
10 checkpoint faults
a s-a-0 d s-a-0 , c s-a-0 e s-a-0
b s-a-0 d 0 , b s-a-1 d 1
6 tests are enough
Fault model.42