Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 91 Lecture 9 Combinational Automatic Test-Pattern Generation (ATPG) Basics n Algorithms and representations.

Slides:



Advertisements
Similar presentations
CMP238: Projeto e Teste de Sistemas VLSI Marcelo Lubaszewski Aula 4 - Teste PPGC - UFRGS 2005/I.
Advertisements

Representing Boolean Functions for Symbolic Model Checking Supratik Chakraborty IIT Bombay.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 121 Lecture 12 Advanced Combinational ATPG Algorithms  FAN – Multiple Backtrace (1983)  TOPS – Dominators.
Appendix: Other ATPG algorithms 1. TOPS – Dominators Kirkland and Mercer (1987) n Dominator of g – all paths from g to PO must pass through the dominator.
Based on text by S. Mourad "Priciples of Electronic Systems" Digital Testing: Design Representation and Fault Detection
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 261 Lecture 26 Logic BIST Architectures n Motivation n Built-in Logic Block Observer (BILBO) n Test.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 13/12alt1 Lecture 13 Sequential Circuit ATPG Time-Frame Expansion (Lecture 12alt in the Alternative.
1 Lecture 10 Sequential Circuit ATPG Time-Frame Expansion n Problem of sequential circuit ATPG n Time-frame expansion n Nine-valued logic n ATPG implementation.
Partial Implications, etc.
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 21alt1 Lecture 21alt BIST -- Built-In Self-Test (Alternative to Lectures 25, 26 and 27) n Definition.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 8alt1 Lecture 8 Testability Measures n Definition n Controllability and observability n SCOAP measures.
6/11/2015A Fault-Independent etc…1 A Fault-Independent Transitive Closure Algorithm for Redundancy Identification Vishal J. Mehta Kunal K. Dave Vishwani.
Algorithms and representations Structural vs. functional test
The Control Unit: Sequencing the Processor Control Unit: –provides control signals that activate the various microoperations in the datapath the select.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 251 Lecture 25 Built-In Self-Testing Pattern Generation and Response Compaction n Motivation and economics.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 9alt1 Lecture 9alt Combinational ATPG (A Shortened version of Original Lectures 9-12) n ATPG problem.
Copyright 2001, Agrawal & BushnellDay-1 PM Lecture 61 Design for Testability Theory and Practice Lecture 6: Combinational ATPG n ATPG problem n Example.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt1 Lecture 11alt Advances in Combinational ATPG Algorithms  Branch and Bound Search  FAN – Multiple.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2004 Lecture 4.
1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.
1 Fault Nodes in Implication Graph for Equivalence/Dominance Collapsing, and Identifying Untestable and Independent Faults R. Sethuram
January 16, '02Agrawal: Delay testing1 Delay Testing of Digital Circuits Vishwani D. Agrawal Agere Systems, Murray Hill, NJ USA
Lecture 27 Memory and Delay-Fault Built-In Self-Testing
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 81 Lecture 8 Testability Measures n Origins n Controllability and observability n SCOAP measures 
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 111 Lecture 11 Major Combinational Automatic Test-Pattern Generation Algorithms n Definitions n D-Algorithm.
Computer ArchitectureFall 2008 © August 20 th, Introduction to Computer Architecture Lecture 2 – Digital Logic Design.
Sequential Testing Two choices n Make all flip-flops observable by putting them into a scan chain and using scan latches o Becomes combinational testing.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 101 Lecture 10 Combinational ATPG and Logic Redundancy n Redundancy identification n Redundancy removal.
ELEN 468 Lecture 231 ELEN 468 Advanced Logic Design Lecture 23 Testing.
Spring 08, Apr 8 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2008 Combinational Circuit ATPG Vishwani D. Agrawal.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
1 CSCE 932, Spring 2007 Test Generation for Combinational Logic.
Unit II Test Generation
VLSI Testing Lecture 7: Combinational ATPG
Technical University Tallinn, ESTONIA 1 Boolean derivatives Calculation of the Boolean derivative: Given:
Chapter 6-2 Multiplier Multiplier Next Lecture Divider
Chapter 7. Testing of a digital circuit
Technical University Tallinn, ESTONIA 1 Faults in Circuits and Fault Diagnosis 0110 T FaultF 5 located Fault table Test experiment Test generation.
LOGIC GATES. Electronic digital circuits are also called logic circuits because with the proper input, they establish logical manipulation paths. Each.
ECE 260B – CSE 241A Testing 1http://vlsicad.ucsd.edu ECE260B – CSE241A Winter 2005 Testing Website:
Copyright 2001, Agrawal & BushnellLecture 6: Sequential ATPG1 VLSI Testing Lecture 6: Sequential ATPG n Problem of sequential circuit ATPG n Time-frame.
Manufacture Testing of Digital Circuits
Solving the Logic Satisfiability problem Solving the Logic Satisfiability problem Jesus De Loera.
EE141 VLSI Test Principles and Architectures Test Generation 1 1 中科院研究生院课程: VLSI 测试与可测试性设计 第 5 讲 测试生成 (1) 李晓维 中科院计算技术研究所
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 51 Lecture 5 Fault Modeling n Why model faults? n Some real defects in VLSI and PCB n Common fault.
Speaker: Nansen Huang VLSI Design and Test Seminar (ELEC ) March 9, 2016 Simulation-Based Equivalence Checking.
Invitation to Computer Science, C++ Version, Fourth Edition
Lecture 9 Advanced Combinational ATPG Algorithms
Algorithms and representations Structural vs. functional test
Algorithms and representations Structural vs. functional test
Definitions D-Algorithm (Roth) D-cubes Bridging faults
Lecture 13 Sequential Circuit ATPG Time-Frame Expansion
Definitions D-Algorithm (Roth) D-cubes Bridging faults
VLSI Testing Lecture 7: Combinational ATPG
Lecture 10 Sequential Circuit ATPG Time-Frame Expansion
ELEC Digital Logic Circuits Fall 2014 Logic Testing (Chapter 12)
Chapter 4 Gates and Circuits.
LPSAT: A Unified Approach to RTL Satisfiability
Binary Decision Diagrams
Automatic Test Generation for Combinational Circuits
VLSI Testing Lecture 8: Sequential ATPG
Lecture 12 Advanced Combinational ATPG Algorithms
Fault Models, Fault Simulation and Test Generation
VLSI Testing Lecture 7: Combinational ATPG
Automatic Test Pattern Generation
XOR Function Logic Symbol  Description  Truth Table 
Lecture 26 Logic BIST Architectures
ELEC Digital Logic Circuits Fall 2015 Logic Testing (Chapter 12)
Lecture 13 Sequential Circuit ATPG Time-Frame Expansion
Presentation transcript:

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 91 Lecture 9 Combinational Automatic Test-Pattern Generation (ATPG) Basics n Algorithms and representations n Structural vs. functional test n Definitions n Search spaces n Completeness n Algebras n Types of Algorithms

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 92 Origins of Stuck-Faults n Eldred (1959) – First use of structural testing for the Honeywell Datamatic 1000 computer n Galey, Norby, Roth (1961) – First publication of stuck-at-0 and stuck-at-1 faults n Seshu & Freeman (1962) – Use of stuck- faults for parallel fault simulation n Poage (1963) – Theoretical analysis of stuck-at faults

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 93 Functional vs. Structural ATPG

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 94 Carry Circuit

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 95 Functional vs. Structural (Continued) n Functional ATPG – generate complete set of tests for circuit input-output combinations  129 inputs, 65 outputs:  = 680,564,733,841,876,926,926,749, 214,863,536,422,912 patterns  Using 1 GHz ATE, would take 2.15 x years n Structural test:  No redundant adder hardware, 64 bit slices  Each with 27 faults (using fault equivalence)  At most 64 x 27 = 1728 faults (tests)  Takes s on 1 GHz ATE n Designer gives small set of functional tests – augment with structural tests to boost coverage to 98 + %

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 96 Definition of Automatic Test-Pattern Generator n Operations on digital hardware:  Inject fault into circuit modeled in computer  Use various ways to activate and propagate fault effect through hardware to circuit output  Output flips from expected to faulty signal n Electron-beam (E-beam) test observes internal signals – “picture” of nodes charged to 0 and 1 in different colors  Too expensive n Scan design – add test hardware to all flip-flops to make them a giant shift register in test mode  Can shift state in, scan state out  Widely used – makes sequential test combinational  Costs: 5 to 20% chip area, circuit delay, extra pin, longer test sequence

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 97 Circuit and Binary Decision Tree

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 98 Binary Decision Diagram n BDD – Follow path from source to sink node – product of literals along path gives Boolean value at sink n Rightmost path: A B C = 1 n Problem: Size varies greatly with variable order

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 99 Algorithm Completeness n Definition: Algorithm is complete if it ultimately can search entire binary decision tree, as needed, to generate a test n Untestable fault – no test for it even after entire tree searched n Combinational circuits only – untestable faults are redundant, showing the presence of unnecessary hardware

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 910 Algebras: Roth’s 5-Valued and Muth’s 9-Valued Symbol D 0 1 X G0 G1 F0 F1 Meaning 1/0 0/1 0/0 1/1 X/X 0/X 1/X X/0 X/1 Failing Machine X 0 1 Good Machine X 0 1 X Roth’s Algebra Muth’s Additions

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 911 Roth’s and Muth’s Higher-Order Algebras n Represent two machines, which are simulated simultaneously by a computer program:  Good circuit machine (1 st value)  Bad circuit machine (2 nd value) n Better to represent both in the algebra:  Need only 1 pass of ATPG to solve both  Good machine values that preclude bad machine values become obvious sooner & vice versa n Needed for complete ATPG:  Combinational: Multi-path sensitization, Roth Algebra  Sequential: Muth Algebra -- good and bad machines may have different initial values due to fault

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 912 Exhaustive Algorithm n For n-input circuit, generate all 2 n input patterns n Infeasible, unless circuit is partitioned into cones of logic, with 15 inputs  Perform exhaustive ATPG for each cone  Misses faults that require specific activation patterns for multiple cones to be tested 

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 913 Random-Pattern Generation n Flow chart for method n Use to get tests for % of faults, then switch to D-algorithm or other ATPG for rest

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 914 Boolean Difference Symbolic Method (Sellers et al.) g = G (X 1, X 2, …, X n ) for the fault site f j = F j (g, X 1, X 2, …, X n ) 1 j m X i = 0 or 1 for 1 i n     

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 915 n Shannon’s Expansion Theorem: F (X 1, X 2, …, X n ) = X 2 F (X 1, 1, …, X n ) + X 2 F (X 1, 0, …, X n ) n Boolean Difference (partial derivative): F j g n Fault Detection Requirements: G (X 1, X 2, …, X n ) = 1 F j g Boolean Difference (Sellers, Hsiao, Bearnson) = F j (1, X 1, X 2, …, X n ) F j (0, X 1, …, X n ) = F j (1, X 1, X 2, …, X n ) F j (0, X 1, …, X n ) = 1        

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 916 Path Sensitization Method Circuit Example 1 Fault Sensitization 2 Fault Propagation 3 Line Justification

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 917 Path Sensitization Method Circuit Example  Try path f – h – k – L blocked at j, since there is no way to justify the 1 on i 1 0 D D D D D

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 918 Path Sensitization Method Circuit Example  Try simultaneous paths f – h – k – L and g – i – j – k – L blocked at k because D-frontier (chain of D or D) disappears 1 D D D D D 1 1 1

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 919 Path Sensitization Method Circuit Example  Final try: path g – i – j – k – L – test found! 0 D D D 1 D D 1 0 1

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 920 Boolean Satisfiability n 2SAT: x i x j + x j x k + x l x m … = 0 x p x y + x r x s + x t x u … = 0 n 3SAT: x i x j x k + x j x k x l + x l x m x n … = 0 x p x y + x r x s x t + x t x u x v … =

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 921 Satisfiability Example for AND Gate  a k b k c k = 0 (non-tautology) or   (a k + b k + c k ) = 1 (satisfiability) n AND gate signal relationships: Cube:  If a = 0, then z = 0 a z  If b = 0, then z = 0 b z  If z = 1, then a = 1 AND b = 1 z ab  If a = 1 AND b = 1, then z = 1 a b z n Sum to get: a z + b z + a b z = 0 (third relationship is redundant with 1 st two)

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 922 Pseudo-Boolean and Boolean False Functions n Pseudo-Boolean function: use ordinary + -- integer arithmetic operators  Complementation of x represented by 1 – x  F pseudo—Bool = 2 z + a b – a z – b z – a b z = 0 n Energy function representation: let any variable be in the range (0, 1) in pseudo-Boolean function n Boolean false expression: f AND (a, b, z) = z (ab) = a z + b z + a b z 

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 923 AND Gate Implication Graph n Really efficient n Each variable has 2 nodes, one for each literal n If … then clause represented by edge from if literal to then literal n Transform into transitive closure graph  When node true, all reachable states are true n ANDing operator used for 3SAT relations  

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 924 Computational Complexity n Ibarra and Sahni analysis – NP-Complete (no polynomial expression found for compute time, presumed to be exponential) n Worst case: no_pi inputs, 2 no_pi input combinations no_ff flip-flops, 4 no_ff initial flip-flop states (good machine 0 or 1 bad machine 0 or 1) work to forward or reverse simulate n logic gates  n n Complexity: O (n x 2 no_pi x 4 no_ff ) 

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 925 History of Algorithm Speedups Algorithm D-ALG PODEM FAN TOPS SOCRATES Waicukauski et al. EST TRAN Recursive learning Tafertshofer et al. Est. speedup over D-ALG (normalized to D-ALG time) ATPG System 2189 ATPG System 8765 ATPG System 3005 ATPG System Year † † † †

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 926 Analog Fault Modeling Impractical for Logic ATPG n Huge # of different possible analog faults in digital circuit n Exponential complexity of ATPG algorithm – a 20 flip-flop circuit can take days of computing  Cannot afford to go to a lower-level model n Most test-pattern generators for digital circuits cannot even model at the transistor switch level (see textbook for 5 examples of switch-level ATPG)