Fault equivalent & collapsing

Combinational circuits
faults f and g are equivalent iff Zf(x) = Zg(x)
equivalent faults are not distinguishable

For gate with controlling value c and inversion i :

all input sac faults and output sa(c i) faults are

equivalent

1
 Equivalence Rules Equivalence
Equivalence Example
Example
sa0 sa1 Faults in red
sa0 sa1 removed by
sa0 sa1 equivalence
WIRE/BUFFER
sa0 sa0 collapsing
sa0 sa1 sa0 sa1 sa1 sa1 sa0 sa1 sa0 sa1
sa0 sa1 sa0 sa1
AND OR sa0 sa1
sa0 sa1 sa0 sa1 INVERTER sa0 sa1
sa0 sa1 sa0 sa1
sa0 sa1 sa0 sa1
NOT sa0
sa1
sa0 sa1 sa0 sa1
sa0 sa1 sa0 sa1
sa0 sa1 sa0 sa1 sa0 sa1
NAND NOR sa0
sa1 sa0 sa1
sa0 sa1 sa0 sa1 sa0 sa0 sa1
sa1 sa0
FANOUT sa1 sa0 sa1
20
Collapse ratio = = 0.625
32

Fault
Fault Dominance
Dominance Fault dominace
If all tests of some fault F1 detect another fault F2, then Combinational circuits
F2 is said to dominate F1. if f dominates g => any test that detects g
Dominance fault collapsing: If fault F2 dominates F1, will also detect f . Therefore , only
then F2 is removed from the fault list. dominating faults must be detected
When dominance fault collapsing is used, it is sufficient
to consider only the input faultsof Boolean gates. Example :
In a tree circuit (without fanouts) PI faults form a x [x, y] is the only test to deleted
z
dominance collapsed fault set. y f1 = y sa1, since it detects
f2 = z sa0 => f2 dominates

Dominance
Dominance Example
Example
Fault dominance & collapsing
All tests of F2
F1
For gate with controlling value c & s-a-1
F2
inversion i, the output sa(ci) s-a-1
110
001
010
dominates any input sac 000
011
101
sequential circuits 100
s-a-1
dominance fault collapsing is not useful Only test of F1
s-a-1
s-a-1
s-a-0
A dominance collapsed fault set
(after equivalence collapsing)

2
 Equivalent to sa1 at the input

in dominance fault collapsing

it is sufficient to consider only
the input faults

Equivalent to sa0 at the input

3
 Checkpoint
Checkpoint Theorem
Theorem
Primary inputs and fanout branches of a combinational circuit
are called checkpoints.
Checkpoint theorem: A test set that detects all single
(multiple) stuck-at faults on all checkpoints of a
combinational circuit, also detects all single (multiple) stuck-
at faults in that circuit.

Total fault sites = 16

Checkpoints ( ) = 10

4
5