Partial Implications, etc.

Slides:



Advertisements
Similar presentations
Automatic Test Generation and Logic Optimization.
Advertisements

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
9-Oct-2002Prasad et al., ITC'021 A New Algorithm for Global Fault Collapsing into Equivalence and Dominance Sets A. V. S. S. Prasad Agere Systems, Bangalore.
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 & BushnellDay-1 AM-3 Lecture 31 Testing Analog & Digital Products Lecture 3: Fault Modeling n Why model faults? n Some real defects.
3/30/05Agrawal: Implication Graphs1 Implication Graphs and Logic Testing Vishwani D. Agrawal James J. Danaher Professor Dept. of ECE, Auburn University.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 91 Lecture 9 Combinational Automatic Test-Pattern Generation (ATPG) Basics n Algorithms and representations.
Jan. 29, 2002Gaur, et al.: DELTA'021 A New Transitive Closure Algorithm with Application to Redundancy Identification Vivek Gaur Avant! Corp., Fremont,
Diagnostic Test Generation and Fault Simulation Algorithms for Transition Faults Yu Zhang Vishwani D. Agrawal Auburn University, Auburn, Alabama
A Diagnostic Test Generation System Yu Zhang Vishwani D. Agrawal Auburn University, Auburn, Alabama USA Nov. 3rdITC
Reduced Complexity Test Generation Algorithms for Transition Fault Diagnosis Yu Zhang Vishwani D. Agrawal Auburn University, Auburn, Alabama USA.
Aug 23, ‘021Low-Power Design Minimum Dynamic Power Design of CMOS Circuits by Linear Program Using Reduced Constraint Set Vishwani D. Agrawal Agere Systems,
6/11/2015A Fault-Independent etc…1 A Fault-Independent Transitive Closure Algorithm for Redundancy Identification Vishal J. Mehta Kunal K. Dave Vishwani.
Aug 31, '02VDAT'02: Low-Power Design1 Minimum Dynamic Power Design of CMOS Circuits by Linear Program Using Reduced Constraint Set Tezaswi Raja, Rutgers.
5/1/2006VTS'061 Upper Bounding Fault Coverage by Structural Analysis and Signal Monitoring Vishwani D. Agrawal Auburn University, Dept. of ECE, Auburn,
Algorithms and representations Structural vs. functional test
Dec. 19, 2005ATS05: Agrawal and Doshi1 Concurrent Test Generation Auburn University, Department of Electrical and Computer Engineering Auburn, AL 36849,
Concurrent Test Generation Auburn University, Department of Electrical and Computer Engineering Auburn, AL 36849, USA Vishwani D. Agrawal Alok S. Doshi.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt1 Lecture 11alt Advances in Combinational ATPG Algorithms  Branch and Bound Search  FAN – Multiple.
A Two Phase Approach for Minimal Diagnostic Test Set Generation Mohammed Ashfaq Shukoor Vishwani D. Agrawal 14th IEEE European Test Symposium Seville,
Logic Synthesis 5 Outline –Multi-Level Logic Optimization –Recursive Learning - HANNIBAL Goal –Understand recursive learning –Understand HANNIBAL algorithms.
Lecture 5 Fault Modeling
1 Lecture 10 Redundancy Removal Using ATPG n Redundancy identification n Redundancy removal Original slides copyright by Mike Bushnell and Vishwani Agrawal.
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.
Dec. 29, 2005Texas Instruments (India)1 Concurrent Test Generation Auburn University, Department of Electrical and Computer Engineering Auburn, AL 36849,
1 Oct 24-26, 2006 ITC'06 Fault Coverage Estimation for Non-Random Functional Input Sequences Soumitra Bose Intel Corporation, Design Technology, Folsom,
1 Fault Nodes in Implication Graph for Equivalence/Dominance Collapsing, and Identifying Untestable and Independent Faults R. Sethuram
Independence Fault Collapsing
Using Contrapositive Law to Enhance Implication Graphs of Logic Circuits Kunal K Dave Master’s Thesis Electrical & Computer Engineering Rutgers University.
January 16, '02Agrawal: Delay testing1 Delay Testing of Digital Circuits Vishwani D. Agrawal Agere Systems, Murray Hill, NJ USA
Exclusive Test and its Application to Fault Diagnosis Vishwani D. Agrawal Dong Hyun Baik Yong C. Kim Kewal K. Saluja Kewal K. Saluja.
Rewiring – Review, Quantitative Analysis and Applications Matthew Tang Wai Chung CUHK CSE MPhil 10/11/2003.
Partial Scan Design with Guaranteed Combinational ATPG Vishwani D. Agrawal Agere Systems, Circuits and Systems Research Lab Murray Hill, NJ 07974, USA.
Jan. 6, 2006VLSI Design '061 On the Size and Generation of Minimal N-Detection Tests Kalyana R. Kantipudi Vishwani D. Agrawal Department of Electrical.
Independence Fault Collapsing and Concurrent Test Generation Thesis Advisor: Vishwani D. Agrawal Committee Members: Victor P. Nelson, Charles E. Stroud.
Oct. 5, 2001Agrawal, Kim and Saluja1 Partial Scan Design With Guaranteed Combinational ATPG Vishwani D. Agrawal Agere Systems Processor Architectures and.
Dominance Fault Collapsing of Combinational Circuits By Kalpesh Shetye & Kapil Gore ELEC 7250, Spring 2004.
Jan. 11, '02Kim, et al., VLSI Design'021 Mutiple Faults: Modeling, Simulation and Test Yong C. Kim University of Wisconsin, Dept. of ECE, Madison, WI 53706,
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 101 Lecture 10 Combinational ATPG and Logic Redundancy n Redundancy identification n Redundancy removal.
Using Contrapositive Law in an Implication Graph to Identify Logic Redundancies Kunal K. Dave ATI Research INC. Vishwani D. Agrawal Dept. of ECE, Auburn.
Diagnostic and Detection Fault Collapsing for Multiple Output Circuits Raja K. K. R. Sandireddy and Vishwani D. Agrawal Dept. Of Electrical and Computer.
On Timing- Independent False Path Identification Feng Yuan, Qiang Xu Cuhk Reliable Computing Lab, The Chinese University of Hong Kong ICCAD 2010.
VLSI Testing Lecture 7: Combinational ATPG
April 3, 2003Agrawal: Fault Collapsing1 Hierarchical Fault Collapsing; Functional Equivalences and Dominances Vishwani D. Agrawal Rutgers University, Dept.
Fault Models, Fault Simulation and Test Generation Vishwani D. Agrawal Department of ECE, Auburn University Auburn, AL 36849, USA
EE434 ASIC & Digital Systems Partha Pande School of EECS Washington State University
Technology Mapping. 2 Technology mapping is the phase of logic synthesis when gates are selected from a technology library to implement the circuit. Technology.
Copyright 2001, Agrawal & BushnellLecture 6: Sequential ATPG1 VLSI Testing Lecture 6: Sequential ATPG n Problem of sequential circuit ATPG n Time-frame.
An introduction to Fault Detection in Logic Circuits By Dr. Amin Danial Asham.
Jan. 26, 2001VLSI Test: Bushnell-Agrawal/Lecture 51 Lecture 5 Fault Modeling n Why model faults? n Some real defects in VLSI and PCB n Common fault models.
TOPIC : Fault detection and fault redundancy UNIT 2 : Fault modeling Module 2.3 Fault redundancy and Fault collapsing.
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.
Lecture 9 Advanced Combinational ATPG Algorithms
Algorithms and representations Structural vs. functional test
Algorithms and representations Structural vs. functional test
VLSI Testing Lecture 7: Combinational ATPG
ELEC Digital Logic Circuits Fall 2014 Logic Testing (Chapter 12)
Lecture 5 Fault Modeling
Automatic Test Generation for Combinational Circuits
Fault Collapsing via Functional Dominance
Fault Models, Fault Simulation and Test Generation
VLSI Testing Lecture 7: Combinational ATPG
ECE 352 Digital System Fundamentals
VLSI Testing Lecture 3: Fault Modeling
ELEC Digital Logic Circuits Fall 2015 Logic Testing (Chapter 12)
Theorems on Redundancy Identification
Chapter 3 – Describing Logic Circuits
Presentation transcript:

Partial Implications, etc. Using Partial Implications for Redundancy Identification and Fault Equivalence Vishwani D. Agrawal Agere Systems, Murray Hill, New Jersey va@agere.com http://cm.bell-labs.com/cm/cs/who/va 2002 Partial Implications, etc.

Partial Implications, etc. Talk Outline Problem statement Background Implication graph Partial implications Transitive closure Redundancy identification A new method for fault equivalence Conclusion 2002 Partial Implications, etc.

Partial Implications, etc. Problem Statement Many problems can be solved by implication graphs and transitive closure. We will study two problems: Redundancy identification Fault equivalence 2002 Partial Implications, etc.

Partial Implications, etc. Background Implication graphs: Chakradhar, et al., Book’90 Larrabee, IEEE-TCAD’92 Transitive closure: ATPG: Chakradhar, et al., IEEE-TCAD’93 Redundancy, Agrawal, et al., ATS’96 Partial implications: Henftling, et al., EDAC’95 Gaur, et al., DELTA’02, Gaur, MS Thesis’02 Fault equivalence: Bushnell and Agrawal, Book’00 2002 Partial Implications, etc.

Partial Implications, etc. Implication graph An implication graph is a representation of logical implications between pairs of signals of a digital circuit. Nodes Two nodes per signal; nodes a and a correspond to signal a. A node has two states (true,false); represents the signal state. Edges A directed edge from node a to b means “a=1” implies “b=1”. 2002 Partial Implications, etc.

Building an Implication Graph AB + C = 0 A B C AC + BC + ABC = 0 If C is ‘1’ then that implies that A and B must be ‘1’, but the reverse is not true. Similarly, if either A or B is ‘0’ then C will be ‘0’. But if we want to represent the implications of A and B on C then partial implications are necessary. 2002 Partial Implications, etc.

Partial Implications, etc. B A B C C AB + C = 0 A B C AC + BC + ABC = 0 Reference: Henftling, et al., EDAC, 1995 2002 Partial Implications, etc.

Observability Variables Observability variable of a signal represents whether or not that signal is observable at a PO. It can be true or false. OA OC = 1 OC A B OA C B OB (PO) OCB + OA = 0 OCOA + BOA + OCBOA = 0 2002 Partial Implications, etc.

Adding Observability Variables to Implication Graph OC OA OCOA + BOA + OCBOA = 0 B A B C OC OA A B C OC OA OB can be added similarly. 2002 Partial Implications, etc.

Partial Implications, etc. Transitive Closure Transitive closure of a directed graph contains the same set of nodes as the original graph. If there is a directed path from node a to b, then the transitive closure contains an edge from a to b. b a b a c d c d A graph Transitive closure 2002 Partial Implications, etc.

Partial Implications, etc. Stuck-at Faults This is a type of fault, which causes a line to hold a constant logic value, irrespective of change of state at previous stages. There are two types of stuck-at-faults: Stuck-at-1 Stuck-at-0 Detection of a fault requires the fault to be activated and its effect observable at a PO. Fault a s-a-1 is detectable, iff following conditions can be simultaneously satisfied: a = 0 Oa = 1 2002 Partial Implications, etc.

Partial Implications, etc. Redundant Faults A fault that has no test is called an untestable fault. Any untestable fault in a combinational circuit is a redundant fault because it does not cause any change in the input/output logic function of the circuit. Identification of redundant faults is useful because they can be removed from testing consideration, or from hardware 2002 Partial Implications, etc.

Redundancy Identification ATPG based method It uses exhaustive test pattern generation to determine whether or not a target fault has a test. All redundant faults can be found, but the ATPG cost is high (exponential in circuit size). Fault independent method This method analyzes circuit topology and function locally without targeting a specific fault. Many (not all) redundant faults can be found at a lower cost. 2002 Partial Implications, etc.

Redundancy Identification by Transitive Closure s-a-0 e s-a-0 b d Oc Od Circuit with two redundant faults Implication graph (some nodes and edges not shown) Implication Partial implication Transitive closure edge 2002 Partial Implications, etc.

Partial Implications, etc. Method Summarized Obtain an implication graph from the circuit topology and compute transitive closure. Examine all nodes: S-a-0 is redundant if the signal implies its complement. S-a-1 is redundant if the complement of the signal implies the signal. Both faults are redundant if the signal and its complement imply each other. S-a-0 is redundant if the signal implies its false observability variable. S-a-1 is redundant if the complement of the signal implies its false observability variable. S-a-0 is redundant if the observability variable implies the complement of the signal. S-a-1 is redundant if the observability variable implies the signal. Both faults are redundant if the observability variable and its complement imply each other. 2002 Partial Implications, etc.

Classification of Redundant Faults by TCAND Circuit Total red. +aborted faults* Tot. red. faults ident. Unexcit-able red. faults Unpropag-atable red. faults Undriv-able red. faults C1908 6+3 2 C2670 99+18 23+2 3 17+2 C3540 99+40 74 8 66 C5315 59 32 1 30 C6288 33 31 15 16 C7552 67+76 34 *HITEC, Nierman and Patel, EDAC’91 2002 Partial Implications, etc.

Partial Implications, etc. Complexity of TCAND SUN Sparc 5 2002 Partial Implications, etc.

Partial Implications, etc. Limitation of Method Observability variable of a fanout stem is not analyzed. Only the redundant faults due to false controllability of fanout stem can be identified. s-a-1 s-a-0 Two redundant stem faults not identified by transitive closure Three redundant s-a-0 faults identified by transitive closure 2002 Partial Implications, etc.

Partial Implications, etc. Some Conclusions Partial implications help find more redundant faults than the transitive closure without partial implications. The results have been compared with FIRE (another fault-independent program), which did equal to or worse that transitive closure with partial implication. Transitive closure computation run times were linear in the number of nodes for the implication graphs of benchmark circuits, although the known worst-case complexity is O(N3) for N nodes. 2002 Partial Implications, etc.

Partial Implications, etc. Fault Equivalence Two faults of a Boolean circuit are called equivalent if they transform the circuit such that the two faulty circuits have identical output functions. Equivalent faults are indistinguishable and have exactly the same set of tests. Many fault equivalences can be determined by structural analysis based on gate fault equivalences and circuit interconnects; this is done in practice. Some fault equivalences require equivalence checking of faulty circuits; too complex and not generally done. 2002 Partial Implications, etc.

Gate Fault Equivalence sa0 sa1 sa0 sa1 sa0 sa1 sa0 sa1 sa0 sa1 sa0 sa1 sa0 sa1 sa0 sa0 sa0 sa0 sa1 sa1 sa1 sa0 sa1 sa1 sa0 sa1 2002 Partial Implications, etc.

Sa0 and Sa1 Variables Variable Asa0 assumes a true state when A=1 and OA is true s-a-0 A B A Asa0 C OA Asa1 is similarly defined. 2002 Partial Implications, etc.

Equivalence by Imp. Graph s-a-0 s-a-0 A C Asa0 Csa0 B A B C OC OA A B C OC OA 2002 Partial Implications, etc.

Partial Implications, etc. An Open Question Can implication graph/transitive closure recognize functional fault equivalence. These are not found by structural analysis. Example: e = b, for both faults. s-a-1 a e s-a-1 b 2002 Partial Implications, etc.

Partial Implications, etc. Conclusion Partial implications improve redundancy identification. Present limitation of the method is the identification of redundancy due to the false observability of fanout stem; open problem. New formulation of fault equivalence may find some functional equivalences. 2002 Partial Implications, etc.

Partial Implications, etc. THANK YOU 2002 Partial Implications, etc.