Unit-1 TOG 23
Unit-1 TOG 23
2
Syllabus
PO-10
PO-11
PSO-1
PSO-2
PO-12
PO-1
PO-2
PO-5
PO-6
PO-9
PO-3
PO-4
PO-7
PO-8
PO →
CO
CO-1 3 2 2
CO-2 3 2 2 2 2 2 2 2
CO-3 3 2 2
CO-4 3 2 2
CO-5 3 2 2
CO-6 3 2 2 2 2 2 2
Avg. 3 2 2 2 2 2 2
Text Books
Reference Books
M. Abramovici, M.A.
"Digital Systems Testing and Testable Design", Jaico
1 Breuer and A.D.
Publishing House, 2002.
Friedman
Prakash Rashinkar,
“System on a Chip Verification”, Kluwer Academic
3 Peter Paterson,
Publishers, 2002
Leena Singh
https://nptel.ac.in/courses/117103125/
https://www.youtube.com/watch?v=-4XBm5t7_Jg
Algorithm : Perfect
Repeat until tested perfect:
{
Redesign;
Remake;
}
➢ Two relevant points
(i) Test should be designed to truly indicate the desired perfection
(ii) Repeat loop should repeat indefinitely until correct the errors found
All Students
Customer
Determine
Requirements
Write specifications
Fabrication
Manufacturing Testing
Faulty chips
Good chips to customer
Fabrication
the first time or pursuing the goal of zero
defects
➢ These goals are achievable in an error prone
Manufacturing
Testing environment, when errors are detected and
Faulty chips
corrected before damage occurs
Good chips to customer
Process Test
other specifications and is also manufacturable,
and FMA
testable and repairable
Manufacturing
Testing
FMA
➢ Manufacturing and test engineer → fabricate and test wafers, package and test
chips
➢ Sales and field application engineers → interaction with the customer
➢ Complexity of VLSI chip has reached to an extent millions (> 100) of transistors
on chip and clock frequency of GHz (>1)
➢ Transistor feature sizes on VLSI chip reduces roughly by 10.5% per year
➢ Transistor density increases roughly 22.1% every year
➢ Nearly 44% increase in transistors on microprocessor chips every year
Test Complexity
➢ Testing difficulty increases as the transistor density increases
➢ Internal chip modules (embedded memories) becomes very difficult to access
➢ Test patterns for sub assemblies on the chip interfere with each other, due to
the need to observe sub assembly ‘A’ through sub assembly ‘B’ while stimulating
both through circuit inputs
Stuck–At Fault
➢ The most common model used for logical faults is the single stuck-at fault
➢ It assumes that a fault in a logic gate results in one of its inputs or the output is
fixed at either a logic 0 (stuck-at-0) or at logic 1 (stuck-at-1). Stuck-at-0 and
stuck-at-l faults are often abbreviated to s-a-0 and s-a-1, respectively.
➢ If input A=0 and B=1 the output should be Z=1 (in the absence of fault)
➢ If input A is s-a-1 then output will be 0 for A=0 and B=1 (in the presence of
fault)
➢ Thus, AB=01 can be considered as the test for the A input s-a-l, since there is a
difference between the output of the fault-free and faulty gate.
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
Switch level fault model
73
Cont.
➢ Figure illustrates CMOS realisation of NAND gate
➢ The number 1 in the figure indicates an open, whereas the numbers 2 and 3
identify the short between the output node and the VDD and the short between
the output node and the ground, respectively.
➢ A short in a CMOS results if not enough metal is removed by the
photolithography, whereas over-removal of metal results in an open circuit
75
Cont.
➢ Fault 1 in figure will disconnect input A
from the gate of transistors T1 and T3.
➢ In such a situation one transistor may
conduct and the other remain non
conducting
➢ Thus, the fault can be represented by a
stuck at value of A; if A is s-a-0, T1 will
be ON and T3 OFF, and if A is s-a-l, T1
will be OFF and T3 ON.
➢ Fault 2 forces the output node to be shorted to VDD, that is, the fault can be
considered as s-a-l fault.
➢ Fault 3 forces the output node to be s-a-0.
➢ The stuck-at model is also used to represent multiple faults in circuits.
➢ In a multiple stuck-at fault, it is assumed that more than one signal line in the
circuit are stuck at logic 1 or logic 0
➢ Two possible shorts numbered 1 and 2 and two possible opens numbered 3 and
4 are indicated in the diagram.
➢ A short between the output of the two gates cannot be modeled by a stuck-at
fault.
➢ Without a short, the outputs of gates Z1 and Z2 are:
➢ With the short
➢ A short between two lines, as indicated by the dotted line in the diagram will
change the function of the circuit.
85
86
87
Delay Faults
➢ Not all manufacturing defects in VLSI circuits can be represented by the stuck-
at fault model.
➢ Smaller defects, which are likely to cause partial open or short in a circuit, have
a higher probability of occurrence due to the variations in the manufacturing
process.
➢ These defects result in the failure of a circuit to meet its timing specifications
without any alteration of the logic function of the circuit.
➢ A small defect may delay the transition of a signal on a line either from 0 to 1,
or vice versa.
➢ This type of malfunction is modeled by a delay fault.
Breaks
➢ Breaks or opens in CMOS circuits are caused either by missing conducting
material or extra insulating material.
➢ Breaks can be either of the following two types:
➢ Intragate breaks
➢ Signal line breaks.
➢ A stuck-on transistor fault implies the permanent closing of the path between
the source and the drain of the transistor.
➢ A stuck-on transistor has the same drain-source resistance as the on resistance
of a fault-free transistor, whereas a stuck-closed transistor exhibits a drain-source
resistance that is significantly lower than the normal on-resistance.
➢ A transistor stuck-on (stuck-closed) fault may be modeled as a bridging fault
from the source to the drain of a transistor.
➢ A stuck-open transistor implies the permanent opening of the connection
between the source and the drain of a transistor.
➢ The drain-source resistance of a stuck-open transistor is significantly higher
than the off-resistance of a nonfaulty transistor.
➢ If the drain-source resistance of a faulty transistor is approximately equal to
that of a fault-free transistor, then the transistor is considered to be stuck-off.
➢ In truth table the fault-free output is shown in column Z; and the remaining
columns represent the outputs in presence of the three stuck-open (s-op) faults.
➢ The first, As-op, is caused by any input, drain, or source missing connection to
the pull-down FET T3.
➢ The second, Bs-op, is caused by any input, drain, or source missing connection
to the pull-down FET T4.
➢ In order to detect a fault in a circuit, the fault must first be excited; that is, a
certain input combination must be applied to the circuit so that the logic value
appearing at the fault location is opposite to the fault value.
➢ Next, the fault must be sensitized; that is, the effect of the fault is propagated
through the circuit to an observable output
➢ In the figure shown, the input combination abc=111 must be applied for the
excitation of the fault, and d=1 for sensitizing the fault to output Z.
➢ The test for the s-a-1 fault is abcd=1111. This input combination is also a test
for other faults (e.g., gate 1 s-a-0, gate 3 s-a-1, and input a s-a-0, etc.).
103
Cont.
➢ For example, in figure shown, the effect of the stuck-at-1 fault can observed at
output Z if input d is set at 1; if d is set to 0, the output will be 0 and the effect of
the fault will be masked (i.e., the fault will not be detected).
➢ The ability to observe the response of a fault on an internal node via the
primary outputs of a circuit is denoted as observability.
➢ Consider the s-a-0 fault shown in figure, It is not possible to set the node to
logic 1. Therefore, the fault cannot be excited and thus undetectable.
➢ The fault β s-a-0 can be excited by making ab=10, but no sensitized path is
available for propagating the effect of the fault to the output; hence, the fault is
undetectable.
➢ A combinational circuit is denoted as redundant if it has an undetectable fault.
➢ Because there are three equivalence fault sets for both NOR and NAND gates, it
is sufficient to derive tests for three faults only in each case, i.e., one fault from
each set.
• Test process
• What faults to test? (fault modeling)
• How are test pattern obtained? (test pattern
• generation)
• How is test quality (fault coverage) measured?
• (fault simulation)?
• How are test vectors applied and results evaluated?
• (ATE/BIST)
111
Fault Equivalence
➢ Consider a single output combinational circuit with ‘n’ input variables with its
output function as f0(V), where V is an n-bit Boolean vector
➢ Considering two faults, let the output function in the presence of fault-1 be f1(V)
➢ The output function in the presence of fault-2 be f2(V)
➢ Any test ‘V’ for fault-1 must produce different values for f0(V) and f1(V) which
can be expressed as f0(V) f1(V) = 1
➢ Similarly a test for fault-2 must satisfy f0(V) f2(V) = 1
➢ If fault-1 and fault-2 have exactly the same tests then
[f0(V) f1(V)] [f0(V) f2(V)] = 0
➢ Which can be written as f1(V) f2(V) = 0
➢ Which is known as indistinguishability condition, which says that the two faulty
functions are identical when the fault have the same set of tests
➢ Fault Equivalence : Two faults of a Boolean circuit are called equivalent only if
two faulty circuits have identical output functions. Equivalent faults are also called
indistinguishable and will have exactly the same set of tests
➢ Consider a two input AND gate, the s-a-0 of any of the input leads to the output to
be 0, hence the s-a-0 faults are equivalent
➢ No such equivalence relation is found among s-a-1 faults
115
Fault Collapsing
➢ The faults in a circuit can be grouped into equivalence sets
➢ The process of selecting one fault from each equivalence test is called fault
collapsing
➢ The set of selected faults is known as equivalence collapsed set
➢ The relative size of the equivalence collapsed set with respect to the set of all
faults is the collapse ratio
119
Compute fault collapsing ratio
o/p
120
Total s-a-f =14 After applying equivalent fault collapsing,
Number of s-a-f=8
Collapse ratio=8/14
121
For the tree circuit shown in figure, demonstrate fault
collapsing by equivalence and find collapse ratio.
122
Compute the collapse ratio using
equivalent fault collapsing
123
Total s-a-f=2X6=12
124
Set of collapsed faults = 8
125
Show that the two faults c s-a-0 and f s-a-1 are equivalent in the circuit shown.
➢ Functional fault collapsing can further reduce the number of faults, the s-a-1 faults
F1 and F4 are equivalent, and so are the s-a-1 faults on F2 and F3.
Faulty output functions corresponding to four s-a-1 faults, F1, F2, F3, and F4 are
shown in k-map hence F1 and F4 are equivalent and F2 and F3 are equivalent.
130
Fault dominance
131
Fault Dominance
➢ Consider a three input AND gate
135
136
137
138
139
Problems
1. Write all the stuck at faults for a two input NAND gate?
2. For the gate shown, write one test vector required to detect the fault.
3. For the circuit shown find the test vector to detect the fault.
5. In the above circuit show that fault c s-a-1 and f s-a-1 are equivalent
145
146
147
Recap
➢ Introduction to testing
➢ Testing philosophy
➢ Role of testing
➢ Digital and analog VLSI testing
➢ VLSI technology trends affecting testing
➢ Faults
➢ Faults in logic circuits
➢ Breaks and transistor stuck open and stuck on faults
➢ Basic concepts of fault detection
➢ Fault modeling
➢ Fault equivalence
➢ Fault collapsing
➢ Fault dominance
➢ Problems