VLSI Testing and Testability: Fault Simulation
VLSI Testing and Testability: Fault Simulation
Fault Simulation
Dr. S. Sivanantham
School of Electronics Engineering
VIT University
Vellore 632014
INIDA
VLSI Testing and Testability
FAULT SIMULATION TECHNIQUES
Basics
Fault simulation algorithms
Serial
Parallel
Deductive
Concurrent
Differential
Random Fault Sampling
Time Complexity
• Proportional to
n: Circuit size, number of logic gates
p: Number of test patterns
f : Number of modeled faults
• Complexity = P * F *G~ O(G3) with single s-a faults
• Complexity is higher than logic simulation, O(G2), but is much lower
than test pattern generation.
• In reality, the complexity is much lower due to fault dropping and
advanced techniques.
VLSI Testing and Testability
Definitions
Fault Specification Defining a set of modeled faults and
performing fault collapsing
Fault Dropping The removal of detected, hyperactive and
hypertrophic faults during the run ( Inverse of
fault insertion)
Fault Insertion Selecting a subset of faults to be simulated
and creating a netlist with these faults
Remarks:
• expensive in computation
• fault dropping is applied, i.e. simulation is stopped after a specific fault fn
has been detected for the first time
• Parallel
– Simulation of w faults in parallel
• Deductive
– Predicts faulty responses from fault-free
• Concurrent
– Interleave faulty and true-value simulation
Comparator fn detected?
Circuit with fault fn
• Advantages
– Easy to implement: a regular logic simulator is used, plus a mechanism for injecting
faults
– A wide range of fault models are supported
• Drawback
– Low performance: simulation time can be prohibitively high for large fault lists
e.g. for n faults, n time the simulation time of a true-value will be needed
VLSI Testing and Testability
Example