VLSI Testing Lecture 3 Fault Modeling Dr Vishwani

  • Slides: 22
Download presentation
VLSI Testing Lecture 3: Fault Modeling Dr. Vishwani D. Agrawal James J. Danaher Professor

VLSI Testing Lecture 3: Fault Modeling Dr. Vishwani D. Agrawal James J. Danaher Professor of Electrical and Computer Engineering Auburn University, Alabama 36849, USA vagrawal@eng. auburn. edu http: //www. eng. auburn. edu/~vagrawal IIT Delhi, Aug 19, 2013, 2: 30 -3: 30 PM Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 1

Contents n n Why model faults? Some real defects in VLSI and PCB Common

Contents n n Why model faults? Some real defects in VLSI and PCB Common fault models Stuck-at faults n n n Single stuck-at faults Fault equivalence Fault dominance and checkpoint theorem Classes of stuck-at faults and multiple faults Transistor faults Summary Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 2

Why Model Faults? n n n I/O function tests inadequate for manufacturing (functionality versus

Why Model Faults? n n n I/O function tests inadequate for manufacturing (functionality versus component and interconnect testing) Real defects (often mechanical) too numerous and often not analyzable A fault model identifies targets for testing A fault model makes analysis possible Effectiveness measurable by experiments Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 3

Some Real Defects in Chips Processing defects § Missing contact windows § Parasitic transistors

Some Real Defects in Chips Processing defects § Missing contact windows § Parasitic transistors § Oxide breakdown §. . . § Material defects § Bulk defects (cracks, crystal imperfections) § Surface impurities (ion migration) §. . . § Time-dependent failures § Dielectric breakdown § Electromigration §. . . § Packaging failures § Contact degradation § Seal leaks §. . . Ref. : M. J. Howes and D. V. Morgan, Reliability and Degradation Semiconductor Devices and Circuits, Wiley, 1981. § Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 4

Observed PCB Defects Occurrence frequency (%) Defect classes Shorts Opens Missing components Wrong components

Observed PCB Defects Occurrence frequency (%) Defect classes Shorts Opens Missing components Wrong components Reversed components Bent leads Analog specifications Digital logic Performance (timing) 51 1 6 13 6 8 5 5 5 Ref. : J. Bateson, In-Circuit Testing, Van Nostrand Reinhold, 1985. Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 5

Common Fault Models n n n n Single stuck-at faults Transistor open and short

Common Fault Models n n n n Single stuck-at faults Transistor open and short faults Memory faults PLA faults (stuck-at, cross-point, bridging) Functional faults (processors) Delay faults (transition, path) Analog faults For more details of fault models, see M. L. Bushnell and V. D. Agrawal, Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits, Springer, 2000. Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 6

Single Stuck-at Fault n Three properties define a single stuck-at fault n n Only

Single Stuck-at Fault n Three properties define a single stuck-at fault n n Only one line is faulty The faulty line is permanently set to 0 or 1 The fault can be at an input or output of a gate Example: XOR circuit has 12 fault sites ( ) and 24 single stuck-at faults c 1 0 a d b e Faulty circuit value Good circuit value j s-a-0 f g 1 0(1) 1(0) h i k z 1 Test vector for h s-a-0 fault Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 7

Fault Equivalence n n Number of fault sites in a Boolean gate circuit is

Fault Equivalence n n Number of fault sites in a Boolean gate circuit is = #PI + #gates + # (fanout branches) Fault equivalence: Two faults f 1 and f 2 are equivalent if all tests that detect f 1 also detect f 2. If faults f 1 and f 2 are equivalent then the corresponding faulty functions are identical. Fault collapsing: All single faults of a logic circuit can be divided into disjoint equivalence subsets, where all faults in a subset are mutually equivalent. A collapsed fault set contains one fault from each equivalence subset. Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 8

Structural Equivalence sa 0 sa 1 sa 0 sa 1 AND sa 0 sa

Structural Equivalence sa 0 sa 1 sa 0 sa 1 AND sa 0 sa 1 OR WIRE sa 0 sa 1 NOT sa 1 sa 0 sa 1 NAND sa 0 sa 1 NOR sa 0 sa 1 FANOUT Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling sa 0 sa 1 9

Equivalence Example sa 0 sa 1 sa 0 sa 1 sa 0 sa 1

Equivalence Example sa 0 sa 1 sa 0 sa 1 sa 0 sa 1 sa 0 sa 1 Copyright 2001, Agrawal & Bushnell sa 0 sa 1 Faults in red removed by equivalence collapsing 20 Collapse ratio = ─── = 0. 625 32 Lecture 3: Fault Modeling 10

Fault Dominance n n n If all tests of some fault F 1 detect

Fault Dominance n n n If all tests of some fault F 1 detect another fault F 2, then F 2 is said to dominate F 1. Dominance fault collapsing: If fault F 2 dominates F 1, then F 2 is removed from the fault list. When dominance fault collapsing is used, it is sufficient to consider only the input faults of Boolean gates. See the next example. In a tree circuit (without fanouts) PI faults form a dominance collapsed fault set. If two faults dominate each other then they are equivalent. Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 11

Dominance Example All tests of F 2 F 1 s-a-1 F 2 s-a-1 110

Dominance Example All tests of F 2 F 1 s-a-1 F 2 s-a-1 110 101 000 100 011 Only test of F 1 s-a-1 s-a-0 A dominance collapsed fault set Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 12

Dominance Example sa 0 sa 1 sa 0 sa 1 sa 0 sa 1

Dominance Example sa 0 sa 1 sa 0 sa 1 sa 0 sa 1 sa 0 sa 1 Copyright 2001, Agrawal & Bushnell sa 0 sa 1 Faults in red removed by equivalence collapsing sa 0 sa 1 Faults in yellow removed by dominance collapsing 15 Collapse ratio = ─── = 0. 47 32 Lecture 3: Fault Modeling 13

Classes of Stuck-at Faults n Following classes of single stuck-at faults are identified by

Classes of Stuck-at Faults n Following classes of single stuck-at faults are identified by fault simulators: n n n Potentially-detectable fault – Test produces an unknown (X) state at primary output (PO); detection is probabilistic, usually with 50% probability. Initialization fault – Fault prevents initialization of the faulty circuit; can be detected as a potentially-detectable fault. Hyperactive fault – Fault induces much internal signal activity without reaching PO. Redundant fault – No test exists for the fault. Untestable fault – Test generator is unable to find a test. Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 14

Multiple Stuck-at Faults n n A multiple stuck-at fault means that any set of

Multiple Stuck-at Faults n n A multiple stuck-at fault means that any set of lines is stuck-at some combination of (0, 1) values. The total number of single and multiple stuck-at faults in a circuit with k single fault sites is 3 k n n – 1. A single fault test can fail to detect the target fault if another fault is also present, however, such masking of one fault by another is rare. Statistically, single fault tests cover a very large number of multiple faults. Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 15

Transistor (Switch) Faults n MOS transistor is considered an ideal switch and two types

Transistor (Switch) Faults n MOS transistor is considered an ideal switch and two types of faults are modeled: n n Stuck-open – a single transistor is permanently stuck in the open state. Stuck-short – a single transistor is permanently shorted irrespective of its gate voltage. Detection of a stuck-open fault requires two vectors. Detection of a stuck-short fault requires the measurement of quiescent current (IDDQ). Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 16

Stuck-Open Example Vector 1: test for A s-a-0 (Initialization vector) p. MOS FETs 1

Stuck-Open Example Vector 1: test for A s-a-0 (Initialization vector) p. MOS FETs 1 0 0 0 A B n. MOS FETs Copyright 2001, Agrawal & Bushnell Vector 2 (test for A s-a-1) VDD Stuckopen C Two-vector s-op test can be constructed by ordering two s-at tests 0 1(Z) Good circuit states Faulty circuit states Lecture 3: Fault Modeling 17

Stuck-Short Example Test vector for A s-a-0 p. MOS FETs 1 0 A B

Stuck-Short Example Test vector for A s-a-0 p. MOS FETs 1 0 A B n. MOS FETs Copyright 2001, Agrawal & Bushnell VDD IDDQ path in faulty circuit Stuckshort C Good circuit state 0 (X) Faulty circuit state Lecture 3: Fault Modeling 18

Summary n n n Fault models are analyzable approximations of defects and are essential

Summary n n n Fault models are analyzable approximations of defects and are essential for a test methodology. For digital logic single stuck-at fault model offers best advantage of tools and experience. Many other faults (bridging, stuck-open and multiple stuck-at) are largely covered by stuck-at fault tests. Stuck-short and delay faults and technologydependent faults require special tests. Memory and analog circuits need other specialized fault models and tests. Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 19

Problems to Solve n n n What are three most common types of blocks

Problems to Solve n n n What are three most common types of blocks a modern SOC is likely to have? Circle three: analog circuit, digital logic, fluidics, memory, MEMS, optics, RF. The cost of a chip is US$1. 00 when its yield is 50%. What will be its cost if you increased the yield to 80%. What is the total number of single stuck-at faults, counting both stuck-at-0 and stuck-at-1, in the following circuit? Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 20

Solution n n What are three most common types of blocks a modern SOC

Solution n n What are three most common types of blocks a modern SOC is likely to have? Circle three: analog circuit, digital logic, fluidics, memory, MEMS, optics, RF. The cost of a chip is US$1. 00 when its yield is 50%. What will be its cost if you increased the yield to 80%. Assume a wafer has n chips, then Chip cost = wafer cost ————— 0. 5 × n Wafer cost = 0. 5 n × $1. 00 = 50 n cents For yield = 0. 8, chip cost = wafer cost/(0. 8 n) = 50 n/(0. 8 n) = 62. 5 cents Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 21

Solution Cont. n What is the total number of single stuck-at faults, counting both

Solution Cont. n What is the total number of single stuck-at faults, counting both stuck-at-0 and stuck-at-1, in the following circuit? Counting two faults on each line, Total number of faults = 2 × (#PI + #gates + #fanout branches) = 2 × (2 + 2) = 12 s-a-0 s-a-1 s-a-0 s-a-1 Copyright 2001, Agrawal & Bushnell Lecture 3: Fault Modeling 22