Need For Testing 1
Need For Testing 1
• Introduction
• Fault models
– Stuck-line (single and multiple)
– Bridging
– Stuck-open
• Test pattern generation
– Combinational circuit test generation
– Sequential circuit test generation
1
Testing Levels and Test Costs
• Wafer • Cost to detect a fault (per
• Packaged chip chip)
– Wafer: $0.01-$0.1
• Board
– Packaged chip: $0.1-$1
• System – Board: $1-$10
• Field – System: $10-$100
– Field: $100-1000
• Concurrent checking
Manufacturing Testing
Goal: Detect manufacturing detects
2
Testing and Diagnosis
• Testing: Determine if the system (chip, board) is behaving
correctly
• Diagnosis: Locate the cause of malfunctioning
3
Testing : The Buzzwords
• Errors • Types of testing
– Permanent – Off-line, on-line
– Intermittent – Self-test vs external test
– Transient – DC (static) vc AC (at-speed)
• Faults – Edge-pin, guided-probe, bed-
of-nails, E-beam, in-circuit
– Physical
– Logical
• Test Evaluation
– Fault coverage
– Fault simulation
4
Fault Models
• Defects are too many and too difficult to explicitly
enumerate
• Abstraction (technology independence): presence of
physical defect is modeled by changing the logic function
(or delay)
• Reduced complexity: distinct physical defects may be
represented by the same logical fault
• Generality: tests derived for logical faults may detect
vaguely-understood or hard-to-analyze physical defects
• A test pattern detects a fault from the fault model
s-a-0 A A
s-a-1
B B
z z
C C
D D
5
SSL Fault Detection
• A test pattern for fault x s-a-d is an input combination that
1) places d on x (activation), 2) propagates fault effect (D
or D) to primary output
D: 1/0, D: 0/1
Good circuit
Bad circuit
A
s-a-0
B
z
C
E
6
Bridging Faults
• Models short circuits, pairs of nodes considered
• Number of bridging faults?
• Feedback vs non-feedback bridging faults
bridge
A B z zf Wired-AND Wired-OR
A 0 0 0 0 0 0
z
B 0 1 0 ? 0 1
1 0 1 ? 0 1
1 1 1 1 1 1
zf = ?
What are the test patterns in this example?
Stuck-Open Faults
VDD
a
Fault-free circuit: z = a+b
b
Floating node Faulty circuit: zf = a+b + abz~
z
~z : Previous value of z
a b
7
Test Pattern Generation
• Exhaustive testing: Apply 2n pattern to n-input circuit
• Not practical for large n
• Advantage: Fault-model independent
Fault-Oriented Test Generation Algorithm:
A s-a-0 1) Set x to 1: activate fault
B y 2) Justify D on x, propagate D
z
C x to z
D
State outputs
State inputs
m Registers
(not observable)
(not controllable)
• Difficult problem!
• Exhaustive testing requires 2m+n patterns (2m states and 2n
transitions from each state)
• Every fault requires a sequence of patterns
Initializing sequence: drive to known state
Test activation
Propagation sequence: propagate discrepancy to observable output
ECE 261 Krish Chakrabarty 16
8
Sequential Circuit Test
Generation
• Iterative-array model (pseudo-combinational circuit)
D Q y+
A
B y A
z B y
C x z
C x
y
1
y+ y+
A1 A0 0
B1 y B 1 y D
z 1 z
C x C1 D x
y y
Backward
ABC = 11X traversal ABC = 011
in time
Current time frame
Test pattern sequence: {11X, 011}
ECE 261 Krish Chakrabarty 18