Professional Documents
Culture Documents
Fault Modeling
Fault Modeling
EE5375 – ADD II
Prof. MacDonald
Stuck At Fault Models
Z = (A + B) C’ + D C
Zf= (A + B) C’ + D 0 = (A + B) C’
0->1 0->1
c 1
d 0
0->1
0
Fault Activation
any vector XX1X will activate the fault
Fault Detectability and Redundancy
l Pulse Generator
– creates pulse at rising edge of input
– pulse width is equal to propagation delay of inverter
l Difficult to test with logical DC test
– Output is always zero in static sense
– Avoid in logic design
Fault detection and redundancy
circuit A
voting
circuit B
circuit C
01 1 0
b
11 1 1 c
10 0 1
Tf
Tg
Dominance Collapsing
y z
uncollapsed faults list
x
y z
x Dominance fault collapsing
Isn’t guaranteed to work with
redundant circuits, but provides
very good collapsing (see check
point theorem later)
Equivalence Collapsing
y z
functional equivalent and
x
indistinguishable even if all
test vectors are applied.
XY Z Zf1 Zf2
0 0 1 1 1
0 1 1 1 1
1 0 1 1 1
1 1 0 1 1 vector proves detectability in both cases,
but no vector distinguishes between them.
Dominance Collapsing
y z
One fault dominates the other
x
so they can be collapsed.
Doing this means that you can
detect them both but won’t be
able to tell them apart unlike
XY Z Zf1 Zf2 equivalence fault collapsing
0 0 1 1 0d where you can not distinguish the
0 1 1 1 0d faults even with all the vectors.
1 0 1 0d 0d
1 1 0 0 0
vector proves detectability of both but
alone can not distinguish them (diagnosis).
Structural Equivalence
a
b c
d
c
d
Structural Equivalence
a
b c
d
c
d
Structural Equivalence
l With reconvergence, some faults are still functionally
equivalent but not structural equivalent
a
b
Structural Equivalence
l With reconvergence, some faults are still functionally
equivalent but not structural equivalent
b
Three approaches for collapsing
l Functional equivalence
– requires full simulation at global level
– prove equivalent by proving for all vectors output is the same
– requires full truth table analysis – for 32 inputs, need 4G rows
– only technique that guarantees minimum fault list
l Structural can be done at local level – easier
– for fanout of 1 – gate output are SE to destination input
– for gates with controlling value, s-a-c is equal to output s-a-c^I
– retain one fault as representative from each group
– doesn’t collapse completely but gets low hanging fruit
– works even if reconvergence exists
l Checkpointing - by exploiting fault dominance, only need to detect
– primary inputs of fan-out free circuits
– checkpoints of fanout circuits assuming no redundancy
Structural Equivalence
a
b
Structural Equivalence
a
b
Structural Equivalence
a
b
Structural Equivalence
a
b
Structural Equivalence
a
reduced to 10 faults s
b
Branches
stem faults are equivalent to multiple branch faults
however, we only consider single faults
1 1 1
1 1
0
1 1
Here is a case of stem fault detectable and either Alternative case in which one branch is detected
branch not detected by test vector 111 but stem and other branch are not detected.
Circuits fanout free
l With fault dominance, possible to detect all SSF
by only detecting all faults at PIs
d
Circuits fanout free - proof
l If all faults at input of gate are detected than
with fault equivalence and dominance the
outputs are detected as well.
j m
g
c
h
i
d
e
k
Example from Book (4.8) structural
40 faults total (42 if you count PO)
Book mentions 24 regular and 14 check point faults?
a f
b
j m
g
c
h
i
d
e
k
Example from Book (4.8) structural
40 faults total (42 if you count PO)
a f
b
j m
g
c
h
i
d
e
k
Example from Book (4.8) structural
40 faults total (42 if you count PO)
a f
b
j m
g
c
h
i
d
e
k
Example from Book (4.8) structural
40 faults total (42 if you count PO)
.
a f
b
j m
g
c
h
i
d
e
k
Example from Book (4.8) structural
40 faults total (42 if you count PO)
reduced to 14
a f
b
j m
g
c
h
i
d
e
k
Example from Book (4.8) – Checkpoint
14 faults total – 10 at PIs and 4 at branch checkpoints
a f
b
j m
g
c
h
i
d
e
k
Example from Book (4.8) minimum faults
10 faults total after reducing checkpoint faults with further analysis
functional
equivalent functional
dominance
a f
b functional
equivalent
j m
g
c
h functional
functional dominance
equivalent i
d
e
functional
k
equivalent
Automatic Test Pattern Generation
l Automatic Test Pattern Generation (ATPG)
– determine list of faults required to be detected
– generate list of test vectors that detect all or percentage
l Many algorithms
– activate and then sensitize defects
– random generation and then determine what is detected
– hybrid, multi pass approach
l Limited to combinational logic
– scan testing reduces sequential circuits to combinational
– ATPG generates input vectors and expect vectors