Documentos de Académico
Documentos de Profesional
Documentos de Cultura
University of Ioannina
University of Ioannina
VLSI Testing
Dept. of Computer Science and Engineering
Y. Tsiatouhas
CMOS Integrated Circuit Design Techniques
Overview
1 VLSI testing
1. VLSI testing
2. On‐
On‐chip/off
chip/off‐‐chip, on
chip, on‐‐line/off
line/off‐‐line testing
3. Fault models
4. Yield –
Yield – Defect level
Defect level –– Fault coverage
5. Control/observation points
/
6. Path delay fault testing
VLSI Systems
and Computer Architecture Lab 7. Circuit partition/segmentation
1
Testing
VLSI Testing 3
CMOS Technology Scaling
CMOS Technology Scaling
Nanometer
M6
Technologies
M5
Cu
M4
M3
M2
Low k
M1
Metal Gate
Tungsten
High k
VLSI Testing 4
2
Testing Necessity
• Imperfections in chip fabrication may lead to
Early‐life manufacturing defects.
Failure Rate
failures Dominant !
Infant # _ of _ acceptable _ parts
mortality
Wearout Y
Aging total _# _ of _ fabricated _ parts
The Cost of Testing
VLSI Testing 6
3
Reliability and Time to Market
Time to
Market 1
Product‐2
ΔΤ Time in months
Off‐‐Chip and On‐
Off On‐Chip Testing
VLSI Testing 8
4
On‐‐Line and Off‐
On Off‐Line Testing
VLSI Testing 9
Defects –– Faults
Defects Faults –– Errors
VLSI Testing 10
5
Open and Short
and Short‐‐Circuit Defects
Early Technologies
Contact aspect ratio: L/D = 7/1
0.18m Technology
D L
d = defect size
STI
Nanometer Technologies
VLSI Testing 11
Fault Models
A F
B
VLSI Testing 12
6
Permanent and Temporary Faults
VLSI Testing 13
Yield Loss and Yield Enhancement
• There are two types of yield loss in IC manufacturing:
Catastrophic yield loss: due to random defects.
Parametric
P t i yield
i ld loss:
l d to process variations.
due i i
7
Yield and Defect Level
The targets (from design and fabrication point of view) are:
number of defect free ICs
Yi ld (Υ)=
Yield (Υ) total number of fabricated ICs
Mathematical model:
Y 1 e AD / A D
2 A = die area
D = defect density
number of defective ICs that pass the test
Defect Level (DL)= total number ICs that pass the test
These are test escapes!
DL is measured in defective parts per million (DPM) – < 100 DPM high quality
VLSI Testing 15
Fault Coverage
Given that the yield is a priori less than 1, it is a prerequisite of a testing
procedure to provide the highest possible fault coverage (κάλυψη σφαλμάτων).
number of detected faults
F lt C
Fault Coverage (T)
(T) =
total number of possible faults
Theoretical relation among defect level, fault coverage and yield:
DL 1 Y(1 T)
approximation for small
DL (1 T) ln( Y) values of DL
TT = (1‐T)
C = stuck‐at fault coverage
VLSI Testing 16
8
Fault Detection
The detection of faults in a circuit consisting of many hundred‐millions up
to few billions of transistors is an open issue. Possible approaches:
• Application of all possible input combinations and observation of the
circuit responses.
responses
Impractical solution due to the huge number of all possible
combinations.
• Use of efficient algorithms for the generation of a reduced set (test
test
set) of input combinations (test
set test vectors)
vectors along with the
corresponding responses, which is capable to detect “all” possible
faults of the fault model under consideration.
Main strategy:
gy “divide and conquer”
q
• Assist testing with embedded design for testability (DfT) techniques.
Main strategy: “divide and conquer”
Desired fault coverage 100%.
In practice a fault coverage of 9099.9% is achieved depending on the fault model and the circuit under
test.
VLSI Testing 17
Testability
Testability is defined as a measure of the ability to detect the faults of the fault
model under consideration in a circuit under test (CUT). It depends on the:
• Controllability (Ελεγξιμότητα): is a measure of the ability to set a node in a
predefined logic state using proper primary input values (vectors).
• Observability (Παρατηρησιμότητα): is a measure of the ability to
determine the logic state of a node by observing the circuit responses at
the primary outputs.
Fault free circuit Circuit with stuck‐at faults
Fault detection is a process where a fault is sensitized by applying proper values at the
primary inputs of the circuit, so that an error is generated at a circuit node, and
afterwards this error is propagated to a primary output to be observed.
VLSI Testing 18
9
Re‐‐convergent Fan
Re convergent Fan‐‐Out Points
The presence of re‐convergent fan‐out points (σημείων επανασύγκλισης
σημάτων) makes fault detection a hard task. This is due to the fact that in such
cases it is not always feasible to independently set proper values at various
circuit nodes in order to sensitize a fault and/or propagate the generated error
to a primary output.
In the example that follows, there is not any proper value for node B that will
sensitize the fault and in parallel will permit the propagation of the generated
error to the output E. The re‐convergent fan‐out point is node E.
Fault free circuit Circuit with stuck‐at faults
VLSI Testing 19
W L
U W L
U
Original Circuit Observation Point Insertion
W L U W U
L
CP0 CP0
CP1
“0” Control Point Insertion “0” and “1” Control Point Insertion
VLSI Testing 20
10
Control –– Observation Points (ΙI
Control (ΙI)
Sequential Logic
D Q D Q
Flip Flop Initialization
Flip‐Flop Initialization
CLK Q CLK Q
CLR CLR
CP0
CP0
RCO
Mbit Nbit
CP1 Counter Initialization
VLSI Testing 21
Circuit Partitioning (I)
2
Initial Circuit
Sub‐circuit Sub‐circuit
C1 C2
Circuit Under Test
VLSI Testing 22
11
Circuit Partitioning (II)
(Τμηματοποίηση Κυκλώματος)
Modified Circuit
SEL
1
M
U
0 X
Sub‐circuit Sub‐circuit
C1 1 C2
M
U
X
0
0 MUX
1 0 MUX
1
SEL
Testing C1 partition
“0” Strategy: “divide and conquer”
VLSI Testing 23
Circuit Segmentation
(Κατάτμηση Κυκλώματος)
S=“0”
A & C are transparent
A
S
S=“1”
Β is transparent 0
M
B U
S
1 X
0
M
U
1 X
VLSI Testing 24
12
Hard Task:
Hard Task: Sequential Logic Testing
Sequential Logic Testing
In sequential circuits the initial state
(register’s values) is not known by default .
outputs = f(inputs, state) Consequently, the sensitization of faults
and the propagation of the corresponding
erroneous responses turns to be a hard
Inputs task.
Combinational Outputs
Logic A solution is to use techniques for the
proper initialization of the circuit state to
known values.
• Application of proper test vector
sequences and/or the use of Set/Reset
Registers signals to setup the required state.
• Development of efficient techniques to
Clock set the initial state and observe the
“State
State””
subsequent state after the response of
the circuit.
VLSI Testing 25
Path Delay Fault Testing (I)
3
Latch Flip‐Flop
In
Logic Out In
Logic Out
D Q D Q D Q D Q
CK1 CK CK2 CK CK CK CK CK
Delay
Time
Delay
CK1 Time
CK2 CK
t t
VLSI Testing 26
13
Path Delay Fault Testing (II)
0 In1 0 Out1
D Q D Q
CK
side path
CK
0
0
In2 D Q D Q Out2 0
CK CK
Logic
CK path under test CK
1 In1 1
D Q D Q Out1
CK
side path
p
1 CK
In2 D Q D Q Out2
CK CK
Logic
CK path under test CK
VLSI Testing 27
Path Delay Fault Testing (III)
1 In1 1 Out1
D Q D Q
CK
side path Fault‐free
CK
1 case
In2 D Q D Q Out2 0
CK CK Faulty
Logic case
CK path under test CK
A path delay fault requires at least a pair of subsequent test vectors to be detected.
The first test vector initializes the circuit while the second test vector activates the path
under test.
VLSI Testing 28
14
Design for Testability
Design for testability (DFT) techniques are today a common practice to meet the
reliability levels required in modern integrated circuits (ICs). According to this
approach, proper testing circuitry is embedded along with the functional circuit
under test ((CUT)) aimingg to alleviate the testingg p
process and enhance testability.
y
VLSI Testing 29
Scan Testing
Registers Logic
Scan‐In
Inputs Outputs
Clock
Scan‐Out
All the memory elements (latches or Flip‐Flops) are properly connected to form a unified
shift register (scan register). This way the internal state of the circuit is determined
(controlled) by shifting in (scan‐in) to the scan register the required test data to be
applied to the combinational logic. Moreover, the existing internal state (previous logic
response) can be observed by shifting out (scan‐out) the data stored into the scan
register.
VLSI Testing 30
15
Built‐‐In Self Test (BIST)
Built
Chip
Inputs
Circuit Under Outputs
UX
MU
Test
(CUT)
On‐‐Line Testing
On
Secondary
Error_Indication
Cosmic Ray
Detector
Si Transition
Detectors
+ +
+ +
+
+ + +
Inputs Outputs
Burst of Electronic Charge
1M electrons/μm Si
Clock
Circuit
In on‐line testing the circuit is under monitoring for error detection during its operation
in the field. Many techniques exist to correct these errors (e.g. by a retry procedure) in
order to provide error tolerance to the circuit under monitoring.
VLSI Testing 32
16
Testing Protocols
Scan Register
IEEE 1149.1 std.
BSR
BSR
PI CUT PO
Decoder
MUX‐1
User Registers
Dev. ID Register
Shift_DR
Clock_DR Bypass
Update_DR
Run_Test MUX‐2
Decode Logic TDO
FF
TDI
IR Register
Shift_IR
TCK Clock_IR
TMS TAP Update_IR
TRST Controller Reset
VLSI Testing 33
The SoC
The SoC Test Challenge
Test Challenge
Digital Tester
Functional Tester Logic Tester
TAP
μP Logic μP Logic
BIST
BIST
17