A New ATPG Algorithm for 21st Century: The wojoRithm

Slides:



Advertisements
Similar presentations
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 121 Lecture 12 Advanced Combinational ATPG Algorithms  FAN – Multiple Backtrace (1983)  TOPS – Dominators.
Advertisements

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
10/4-6/05ELEC / Lecture 111 ELEC / (Fall 2005) Special Topics in Electrical Engineering Low-Power Design of Electronic Circuits.
Timing Analysis - Delay Analysis Models
1 Analyzing Reconvergent Fanouts in Gate Delay Fault Simulation Dept. of ECE, Auburn University Auburn, AL Hillary Grimes & Vishwani D. Agrawal.
NATW 2008 Using Implications for Online Error Detection Nuno Alves, Jennifer Dworak, R. Iris Bahar Division of Engineering Brown University Providence,
4/20/2006 ELEC7250 Project: Grimes 1 Logic Simulator for Hierarchical Bench Hillary Grimes III – Term Project ELEC 7250 – Spring 2006.
Aiman El-Maleh, Ali Alsuwaiyan King Fahd University of Petroleum & Minerals, Dept. of Computer Eng., Saudi Arabia Aiman El-Maleh, Ali Alsuwaiyan King Fahd.
1 Lecture 11 Major Combinational Automatic Test-Pattern Generation Algorithms n Definitions n D-Algorithm (Roth) D-cubes Bridging faults Logic.
Dec. 19, 2005ATS05: Agrawal and Doshi1 Concurrent Test Generation Auburn University, Department of Electrical and Computer Engineering Auburn, AL 36849,
4/27/2006 ELEC7250: White 1 ELEC7250 VLSI Testing: Final Project Andrew White.
Practically Realizing Random Access Scan By Anand Mudlapur ECE Dept. Auburn University.
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.
4/20/2006ELEC7250: Alexander 1 LOGIC SIMULATION AND FAULT DIAGNOSIS BY JINS DAVIS ALEXANDER ELEC 7250 PRESENTATION.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 11alt1 Lecture 11alt Advances in Combinational ATPG Algorithms  Branch and Bound Search  FAN – Multiple.
ELEC 7250 Term Project Presentation Khushboo Sheth Department of Electrical and Computer Engineering Auburn University, Auburn, AL.
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,
10/25/2007 ITC-07 Paper Delay Fault Simulation with Bounded Gate Delay Model Soumitra Bose Design Technology, Intel Corp. Folsom, CA Hillary.
Spring 08, Mar 27 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2008 Fault Simulation Vishwani D. Agrawal James J.
ELEC7250: VLSI Testing Spring 2004 Experimental Analysis of Fault Collapsing Methods Dixit, Ayoush M.
04/25/2006 ELEC 7250 Final Project: Jie Qin 1 Logic Simulator for Combinational Circuit Jie Qin Dept. of Electrical and Computer Engineering Auburn University,
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 111 Lecture 11 Major Combinational Automatic Test-Pattern Generation Algorithms n Definitions n D-Algorithm.
Dominance Fault Collapsing of Combinational Circuits By Kalpesh Shetye & Kapil Gore ELEC 7250, Spring 2004.
Logic simulator and fault diagnosis Fan Wang Dept. of Electrical & Computer Engineering Auburn University ELEC7250 Term Project Spring 06’
Silicon Programming--Physical Testing 1 Testing--physical faults: yield; s-a-0 and s-a-1 faults; justify and propagate.
Spring 08, Apr 8 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2008 Combinational Circuit ATPG Vishwani D. Agrawal.
Unit II Test Generation
VLSI Testing Lecture 7: Combinational ATPG
March 8, 2006Spectral RTL ATPG1 High-Level Spectral ATPG for Gate-level Circuits Nitin Yogi and Vishwani D. Agrawal Auburn University Department of ECE.
TOPIC : Types of fault simulation
MBSat Satisfiability Program and Heuristics Brief Overview VLSI Testing B Marc Boulé April 2001 McGill University Electrical and Computer Engineering.
Muralidharan Venkatasubramanian Vishwani D. Agrawal
ECE 260B – CSE 241A Testing 1http://vlsicad.ucsd.edu ECE260B – CSE241A Winter 2005 Testing Website:
Tallinn University of Technology, Department of Computer Engineering, November 2006 Digitaalsüsteemide verifitseerimine Arvutitehnika erikursus II, IAY0110,
Dominance Fault Collapsing 1 VLSI TESTING PROJECT Dominance Fault Collapsing Anandshankar Mudlapur Arun Balaji Kannan Muthu Balaji Ramkumar Muthu Balan.
Lopamudra Kundu Reg. No. : of Roll No.:- 91/RPE/ Koushik Basak
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.
Multiple-Vector Column-Matching BIST Design Method Petr Fišer, Hana Kubátová Department of Computer Science and Engineering Czech Technical University.
Lecture 5: Design for Testability. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 12: Design for Testability2 Outline  Testing –Logic Verification –Silicon.
Lecture 9 Advanced Combinational ATPG Algorithms
PLC: Programmable Logical Controller
Algorithms and representations Structural vs. functional test
CS137: Electronic Design Automation
Definitions D-Algorithm (Roth) D-cubes Bridging faults
Definitions D-Algorithm (Roth) D-cubes Bridging faults
VLSI Testing Lecture 6: Fault Simulation
VLSI Testing Lecture 7: Combinational ATPG
ELEC Digital Logic Circuits Fall 2014 Logic Testing (Chapter 12)
CPE/EE 428, CPE 528 Testing Combinational Logic (5)
LPSAT: A Unified Approach to RTL Satisfiability
Vishwani D. Agrawal James J. Danaher Professor
Automatic Test Generation for Combinational Circuits
VLSI Testing Lecture 8: Sequential ATPG
Lecture 12 Advanced Combinational ATPG Algorithms
Garimella Srinivas Gottiparthy Ramraj Vippa Prakash
Fault Models, Fault Simulation and Test Generation
VLSI Testing Lecture 7: Combinational ATPG
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
Automatic Test Pattern Generation
Veeraraghavan Ramamurthy
VLSI Testing Lecture 4: Testability Analysis
This chapter in the book includes: Objectives Study Guide
Sungho Kang Yonsei University
ELEC Digital Logic Circuits Fall 2015 Logic Testing (Chapter 12)
D-Algorithm (1/4) h d' d i j e' n e k a g b c l f' f m Example 1 D’ G1
Presentation transcript:

A New ATPG Algorithm for 21st Century: The wojoRithm John Sunwoo sunwojo@auburn.edu Electrical & Computer Engineering Auburn University, AL

Table of Contents Flow Diagram PI Assignment Mechanism Logic Simulation (How & Why + Demo) Backtrace() Example Results (Developing) Significance & Suggestions on future work Q & A

High Level Algorithm 1)Assign PIs fully (Unique) 2)Simulate 3)Fault site activated? If not, then change PIs and goto step 2 4)Fault propagates to PO? (D or D-bar detected?) If not, set an additional objective to make it propagate (change PIs) and goto step 2 5)Save the vector 6)Done Activate the fault site propagate the fault 3) save the vector

Why Start with Fully Assigned PI? Start with X-state D, PODEM FAN, TOPS, SOCRATES Before let the algorithm to think (ex. Backtrace), why don’t we give it a shot. (FEMT, Free Extra Missile Theory) Can be lucky

High Level Flow Diagram Start Define an objective ( ex . Z - sa 1 , then Objective is Z = ) Objective s achieved ? { _ Check Backtrace To PI change a bit of PI } no Assign all PIs to its non controlling values Apply PIs to the circuit Fault signal propagates through output Find the conflict make it as a secondary objective yes Save Vector Exit Done

Initial Primary Input Assignment

Initial Primary Input Assignment (2) Waste of step! Why non-controlling values, not Random? Random = 50% to activate fault site accidentally Non-controlling values = ? (Add-in Intelligence) Higher chance to make an effective change on the circuit 1 Random 1 1 1 N - C 1 1 1

Logic Simulator Reads in circuit.lev Logic evaluation from lowest level to highest level. myVector : A linked list to be updated simultaneously. Demo

Backtrace( ) Backtrace(label, value) { while (PI has not updated) { 1) check input of gate ‘l’ 2) change one of the input ‘x’ which needs to be change to ‘v’. If none of the input value needs to be change then backtrack. 3) l = l 4) x = v } return new myVector

Example (c17.bench) myVector = [13, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1$, 0$]

Example Decision Steps (c17.bench) 6 1 12 10 1 2 1 10 1 8 3 1 1 7 4 1 1 13 11 1 D* D 5 sa1 9 1 Initial objective: set [9] to “0” Apply vector Backtrace from [9] & *save the path (learning) Apply updated vector D-bar propagates? Additional objective: set [8] to “1” 7. Backtrace from [8] 8. Apply updated vector 9. D detected at PO [13] 10. Save vector, Done

Data <Demo> wojoRithm 5 01111 10011 10001 11111 11100 01101 11011 11101 10100 HITEC 5 00011 00010 00100 10001 10111 11111 10000 01001 10011 01100 One vector short! Both got 100% Fault coverage Compact test vector size is possible

Significance & Suggestion Complete implementation on software Experiment on bigger bench circuits Artificial Intelligence (AI) Random PI VS Static non-controlling PI

Conclusions Algorithm is not fully implemented More analysis is needed The simplest but powerful All node is in known state = faster % simpler backtracing.

Questions?