Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt1 Lecture 11alt Advances in Combinational ATPG Algorithms  Branch and Bound Search  FAN – Multiple.

Slides:



Advertisements
Similar presentations
Hybrid BDD and All-SAT Method for Model Checking Orna Grumberg Joint work with Assaf Schuster and Avi Yadgar Technion – Israel Institute of Technology.
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 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.
Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis1 VLSI Testing Lecture 3b: Testability Analysis n Definition n Controllability and observability.
TOPIC : Backtracking Methodology UNIT 3 : VLSI Testing Module 3.2: Arriving at Input Test Vector.
Partial Implications, etc.
1 Recursive Learning Madhurima Maddela. ELEC /26/052 Decision Tree Traditionally used to branch and bound in the search space to generate test.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 91 Lecture 9 Combinational Automatic Test-Pattern Generation (ATPG) Basics n Algorithms and representations.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 8alt1 Lecture 8 Testability Measures n Definition n Controllability and observability n SCOAP measures.
1 Lecture 11 Major Combinational Automatic Test-Pattern Generation Algorithms n Definitions n D-Algorithm (Roth) D-cubes Bridging faults Logic.
6/11/2015A Fault-Independent etc…1 A Fault-Independent Transitive Closure Algorithm for Redundancy Identification Vishal J. Mehta Kunal K. Dave Vishwani.
1 Boolean Satisfiability in Electronic Design Automation (EDA ) By Kunal P. Ganeshpure.
Algorithms and representations Structural vs. functional test
Copyright 2001, Agrawal & BushnellDay-1 PM-2 Lecture 51 Testing Analog & Digital Products Lecture 5: Testability Measures n Definition n Controllability.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 9alt1 Lecture 9alt Combinational ATPG (A Shortened version of Original Lectures 9-12) n ATPG problem.
4/28/05 Raghuraman: ELEC To Generate a Single Test Vector to detect all/most number of faults in a given set Project by: Arvind Raghuraman Course.
Copyright 2001, Agrawal & BushnellDay-1 PM Lecture 61 Design for Testability Theory and Practice Lecture 6: Combinational ATPG n ATPG problem n Example.
Lecture 6 Testability Measures
Constraint Satisfaction Problems
1 Lecture 10 Redundancy Removal Using ATPG n Redundancy identification n Redundancy removal Original slides copyright by Mike Bushnell and Vishwani Agrawal.
1 Oct 24-26, 2006 ITC'06 Fault Coverage Estimation for Non-Random Functional Input Sequences Soumitra Bose Intel Corporation, Design Technology, Folsom,
Efficient Reachability Checking using Sequential SAT G. Parthasarathy, M. K. Iyer, K.-T.Cheng, Li. C. Wang Department of ECE University of California –
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.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 101 Lecture 10 Combinational ATPG and Logic Redundancy n Redundancy identification n Redundancy removal.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 15: March 18, 2009 Static Timing Analysis and Multi-Level Speedup.
Using Contrapositive Law in an Implication Graph to Identify Logic Redundancies Kunal K. Dave ATI Research INC. Vishwani D. Agrawal Dept. of ECE, Auburn.
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.
Testing.
Unit II Test Generation
VLSI Testing Lecture 7: Combinational ATPG
Search by partial solutions.  nodes are partial or complete states  graphs are DAGs (may be trees) source (root) is empty state sinks (leaves) are complete.
ECE 260B – CSE 241A Testing 1http://vlsicad.ucsd.edu ECE260B – CSE241A Winter 2005 Testing Website:
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 23: April 20, 2015 Static Timing Analysis and Multi-Level Speedup.
On the Relation between SAT and BDDs for Equivalence Checking Sherief Reda Rolf Drechsler Alex Orailoglu Computer Science & Engineering Dept. University.
Copyright 2001, Agrawal & BushnellLecture 6: Sequential ATPG1 VLSI Testing Lecture 6: Sequential ATPG n Problem of sequential circuit ATPG n Time-frame.
SOLUTION TO module 3.3. Feb.. 16, 2001VLSI Test: Bushnell-Agrawal/Lecture 112 Example 7.2 Fault A sa0 Step 1 – D-Drive – Set A = 1 D 1 D.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Combinational ATPG.
A New ATPG Algorithm for 21 st Century: The wojoRithm John Sunwoo Electrical & Computer Engineering Auburn University, AL.
EE141 VLSI Test Principles and Architectures Test Generation 1 1 中科院研究生院课程: VLSI 测试与可测试性设计 第 5 讲 测试生成 (1) 李晓维 中科院计算技术研究所
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 20: April 4, 2011 Static Timing Analysis and Multi-Level Speedup.
Binary Decision Diagrams Prof. Shobha Vasudevan ECE, UIUC ECE 462.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Hybrid BDD and All-SAT Method for Model Checking
Lecture 9 Advanced Combinational ATPG Algorithms
Algorithms and representations Structural vs. functional test
VLSI Testing Lecture 4: Testability Analysis
Algorithms and representations Structural vs. functional test
Definitions D-Algorithm (Roth) D-cubes Bridging faults
Definitions D-Algorithm (Roth) D-cubes Bridging faults
VLSI Testing Lecture 7: Combinational ATPG
Lecture 10 Sequential Circuit ATPG Time-Frame Expansion
CPE/EE 428, CPE 528 Testing Combinational Logic (5)
Automatic Test Generation for Combinational Circuits
CPE/EE 428, CPE 528 Testing Combinational Logic (4)
VLSI Testing Lecture 8: Sequential ATPG
Lecture 12 Advanced Combinational ATPG Algorithms
A New ATPG Algorithm for 21st Century: The wojoRithm
Fault Models, Fault Simulation and Test Generation
VLSI Testing Lecture 7: Combinational ATPG
Automatic Test Pattern Generation
VLSI Testing Lecture 4: Testability Analysis
Theorems on Redundancy Identification
CS137: Electronic Design Automation
Presentation transcript:

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt1 Lecture 11alt Advances in Combinational ATPG Algorithms  Branch and Bound Search  FAN – Multiple Backtrace, head lines (1983)  TOPS – Dominators (1987)  SOCRATES – Learning (1988)  EST – Search space learning (1991)  ATPG Performance improvements  Summary

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt2 ATPG: A Boolean Satisfiability Problem CUT with fault f(a,b,c) = 1 Test Vector (a,b,c)

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt3 SAT is NP-Complete a cc b b cc 0 1 f a b c f Binary Decision Diagram (BDD)

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt4 Search for a Solution  Problem: Given a value of a Boolean function of binary variables, find values of the variables.  Solution: Starting at the root, enumerative traversal of the binary decision diagram (BDD) until a solution is found.  BDD is a search tree – search consists of  Branch: Set an untried value for a variable – Backtrack to previous branching point if there is no untried value  Stop if solution found, or backtracked to root without untried values  Or, bound search tree for future traversals if solution is impossible and backtrack to previous branching point (some variable orderings may lead to early bounding)  Or, continue

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt5 Example: f = 1 a cc b b cc 0 1 f a b c f Binary Decision Diagram (BDD) bound

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt6 FAN: Fujiwara and Shimono (1983)  New concepts:  Unique sensitization  Stop Backtrace at head lines  Multiple Backtrace

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt7 PODEM Makes Unwise Signal Assignments  Blocks fault propagation due to assignment J = 0

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt8 Unique Sensitization of FAN with No Search  FAN immediately sets necessary signals to propagate fault Path over which fault is uniquely sensitized

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt9 Headlines  Headlines H and J separate circuit into 3 parts, for which test generation can be done independently

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt10 Contrasting Decision Trees PODEM decision tree FAN decision tree

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt11 Multiple Backtrace FAN – breadth-first passes – 1 time PODEM – depth-first passes – 6 times

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt12 AND Gate Vote Propagation  AND Gate  Easiest-to-control Input:  # 0’s = OUTPUT # 0’s  # 1’s = OUTPUT # 1’s  All other inputs:  # 0’s = 0  # 1’s = OUTPUT # 1’s [5, 3] [0, 3]

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt13 Multiple Backtrace Fanout Stem Voting  Fanout Stem --  # 0’s = Σ Branch # 0’s,  # 1’s = Σ Branch # 1’s [5, 1] [1, 1] [3, 2] [4, 1] [5, 1] [18, 6]

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt14 PODEM Fails to Determine Unique Signals  Backtracing operation fails to set all 3 inputs of gate L to 1  Causes unnecessary search sa1

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt15 FAN -- Early Determination of Unique Signals  Determine all unique signals implied by current decisions immediately  Avoids unnecessary search sa1

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt16 TOPS: Dominators Kirkland and Mercer (1987)  Dominator of g – all paths from g to PO must pass through the dominator  Absolute -- k dominates B  Relative – dominates only paths to a given PO  If dominator of fault becomes 0 or 1, backtrack

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt17 SOCRATES: Learning (1988)  Static and dynamic learning:  a = 1 f = 1 means that we learn f = 0 a = 0 by applying the Boolean contrapositive theorem  Set each signal first to 0, and then to 1  Discover implications  Learning criterion: remember f = v f only if:  f = v f requires all inputs of f to be non-controlling  A forward implication contributed to f = v f  

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt18 Improved Unique Sensitization Procedure  When a is only D-frontier signal, find dominators of a and set their inputs unreachable from a to 1  Find dominators of single D-frontier signal a and make common input signals non-controlling

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt19 Constructive Dilemma  [(a = 0) (i = 0)] [(a = 1) (i = 0)] (i = 0)  If both assignments 0 and 1 to a make i = 0, then i = 0 is implied independently of a    

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt20 EST: Search Space Learning (Giraldi and Bushnell)  E-frontier – partial circuit functional decomposition  Equivalent to a node in a BDD  Cut-set between circuit part with known labels and part with X signal labels  EST learns E-frontiers during ATPG and stores them in a hash table  Dynamic programming – when new decomposition generated from implications of a variable assignment, looks it up in the hash table  Avoids repeating a search already conducted  Terminates search when decomposition matches:  Earlier one that lead to a test (retrieves stored test)  Earlier one that lead to a backtrack  Accelerated SOCRATES nearly 5.6 times

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt21 Fault B sa1

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt22 Fault h sa1

Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt23 Summary 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 † † † † Performance improvement through 40 years of research.