Design For Testability and Automatic Test Pattern Generation
Design For Testability and Automatic Test Pattern Generation
DILIP MATHURIA
M.TECH (VLSI)
160137004
OBJECTIVES
What is DFT?
Why we need DFT?
DFT Methods
Testing Economics
Goal of DFT
ATPG
BIST
Faults Models
Stuck at Faults Model
Path Sensitization
WHAT IS DFT?
Design for testability (DFT) refers to those design techniques
that make test generation and test application cost-
effective.
If a chip fault is not detected by chip testing, then finding the fault
costs 10 times as much at the PCB level as at the chip level.
Similarly, if a board fault is not found by PCB testing, then finding
the fault costs 10 times as much at the system level as at the board
level.
GOAL OF DESIGN FOR TESTABILITY (DFT)
Improve
Controllability
Observability
Predictability
DFT METHODS
DFT methods for digital circuits:
Ad-hoc methods
Structured methods:
Scan
Partial Scan
Built-in self-test (BIST)
Boundary scan
AD-HOC DFT METHODS
Good design practices learnt through experience are used as guidelines:
Avoid asynchronous (unclocked) feedback
Make flip-flops initializable
Avoid redundant gates
Avoid large fan-in gates
Provide test control for difficult-to-control signals
Avoid gated clocks
Design reviews conducted by experts or design auditing tools
Disadvantages of ad-hoc DFT methods:
Experts and tools not always available
Test generation is often manual with no guarantee of high fault coverage
Design iterations may be necessary
SCAN DESIGN
Circuit is designed using pre-specified design rules.
Test structure (hardware) is added to the verified design:
Add a test control (TC) primary input.
Replace flip-flops by scan flip-flops (SFF) and connect to form one or more shift
registers in the test mode.
Make input/output of each scan shift register controllable/observable from
PI/PO.
Use only clocked D-type of flip-flops for all state variables
At least one PI pin must be available for test; more pins, if available, can be used
BUILT-IN SELF-TEST
System-on-Chip Advances in microelectronics technology have introduced a new
paradigm in IC design: System-on-Chip (SoC)
49. 1
S el f -t est
co n tro l
Many systems are nowadays designed by embedding predesigned
and preverified complex functional blocks (cores) into one single
UDL die
g acy
DS P
UDL
10% UDL
o p mp l ex
co re 75% memory
E mb ed d ed
DRAM
50% in-house cores
60-70% soft cores
BIST TECHNIQUES
BIST techniques are classified:
on-line BIST - includes concurrent and non-concurrent techniques
off-line BIST - includes functional and structural approaches
BRIDGING FAULTS
A short circuit between two signal lines is called bridging faults. Bridging to VDD or VSS is
equivalent to stuck at fault model.
If one driver dominates the other driver in a bridging situation, the dominant driver forces the
logic to the other one, in such case a dominant bridging fault is used.
COMBINATIONAL ATPG
The combinational ATPG method allows testing the individual nodes (or flip-flops)
of the logic circuit without being concerned with the operation of the overall
circuit.
This allows using a relatively simple vector matrix to quickly test all the
comprising FFs, as well as to trace failures to specific FFs.
SEQUENTIAL ATPG
Sequential-circuit ATPG searches for a sequence of test vectors to detect a particular
fault through the space of all possible test vector sequences.
Even a simple stuck-at fault requires a sequence of vectors for detection in a
sequential circuit.
Due to the presence of memory elements, the controllability and observability of the
internal signals in a sequential circuit are in general much more difficult than those in
a combinational logic circuit.
PATH SENSITIZATION
Fault Sensitization
Fault Propagation
Line Justification
PATH SENSITIZATION
Try path f h k L. This path is blocked at j,
since there is no way to justify the 1 on i
1 D
D D
1 D
D 0
1
1
PATH SENSITIZATION
Try simultaneous paths f h k L and
g i j k L. These paths blocked at k because
D-frontier (chain of D or D) disappears
1 D
D 1
1
D D
D
1
PATH SENSITIZATION
Final try: path g i j k L test found!
0
0 D
1 D
D D D
1
1
THANK YOU!!!