Design Technology Center National Tsing Hua University A New Paradigm for Scan Chain Diagnosis Using Signal Processing Techniques Shi-Yu Huang ( 黃錫瑜 )

Slides:



Advertisements
Similar presentations
V. Vaithianathan, AP/ECE
Advertisements

Advanced ITC Presentation A. Pogiel J. Rajski J. Tyszer.
Copyright 2001, Agrawal & BushnellLecture 12: DFT and Scan1 VLSI Testing Lecture 10: DFT and Scan n Definitions n Ad-hoc methods n Scan design  Design.
An Algorithm for Diagnostic Fault Simulation Yu Zhang Vishwani D. Agrawal Auburn University, Auburn, Alabama USA 13/29/2010IEEE LATW 10.
1 Pattern-Directed Circuit Virtual Partitioning for Test Power Reduction Qiang Xu The Chinese University of Hong Kong Dianwei Hu and Dong Xiang Tsinghua.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 261 Lecture 26 Logic BIST Architectures n Motivation n Built-in Logic Block Observer (BILBO) n Test.
1 A Random Access Scan Architecture to Reduce Hardware Overhead Anand S. Mudlapur Vishwani D. Agrawal Adit D. Singh Department of Electrical and Computer.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 13/12alt1 Lecture 13 Sequential Circuit ATPG Time-Frame Expansion (Lecture 12alt in the Alternative.
NCHUCS1 Scan Chain Reorder Sying-Jyan Wang Department of Computer Science National Chung-Hsing University.
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI Circuit Design Lecture 17 - Sequential.
1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
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 71 Lecture 7 Fault Simulation n Problem and motivation n Fault simulation algorithms n Serial n Parallel.
Aiman El-Maleh, Ali Alsuwaiyan King Fahd University of Petroleum & Minerals, Dept. of Computer Eng., Saudi Arabia Aiman El-Maleh, Ali Alsuwaiyan King Fahd.
Copyright 2001, Agrawal & BushnellDay-2 PM Lecture 101 Design for Testability Theory and Practice Lecture 10: DFT and Scan n Definitions n Ad-hoc methods.
Dynamic Scan Clock Control In BIST Circuits Priyadharshini Shanmugasundaram Vishwani D. Agrawal
Diagnostic Test Generation and Fault Simulation Algorithms for Transition Faults Yu Zhang Vishwani D. Agrawal Auburn University, Auburn, Alabama
Yu Zhang Vishwani D. Agrawal Auburn University, Auburn, Alabama /13/2010 NATW 10 1 A Diagnostic Test Generation System.
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.
Externally Tested Scan Circuit with Built-In Activity Monitor and Adaptive Test Clock Priyadharshini Shanmugasundaram Vishwani D. Agrawal.
Logic Simulation 4 Outline –Fault Simulation –Fault Models –Parallel Fault Simulation –Concurrent Fault Simulation Goal –Understand fault simulation problem.
X-Compaction Itamar Feldman. Before we begin… Let’s talk about some DFT history: Design For Testability (DFT) has been around since the 1960s. The technology.
Statistical Diagnosis for Intermittent Scan Chain Hold-Time Fault Laboratory for Reliable Computing (LaRC) Electrical Engineering Department National Tsing.
1 Lecture 23 Design for Testability (DFT): Full-Scan n Definition n Ad-hoc methods n Scan design Design rules Scan register Scan flip-flops Scan test sequences.
Design for Testability Theory and Practice Lecture 11: BIST
Practically Realizing Random Access Scan By Anand Mudlapur ECE Dept. Auburn University.
Low Power Implementation of Scan Flip-Flops Chris Erickson Graduate Student Department of Electrical and Computer Engineering Auburn University, Auburn,
ELEN 468 Lecture 241 ELEN 468 Advanced Logic Design Lecture 24 Design for Testability.
Embedded Systems Hardware:
Output Hazard-Free Transition Tests for Silicon Calibrated Scan Based Delay Testing Adit D. Singh Gefu Xu Auburn University.
Lecture 5 Fault Simulation
Practically Realizing Random Access Scan Anand S. Mudlapur Department of Electrical and Computer Engineering Auburn University, AL USA.
Vishwani D. Agrawal James J. Danaher Professor
Aug. 13, 2005Mudlapur et al.: VDAT'051 A Novel Random Access Scan Flip-Flop Design Anand S. Mudlapur Vishwani D. Agrawal (Speaker) Adit D. Singh Department.
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 20alt1 Lecture 20alt DFT: Partial, Random-Access & Boundary Scan n Definition n Partial-scan architecture.
Oct. 5, 2001Agrawal, Kim and Saluja1 Partial Scan Design With Guaranteed Combinational ATPG Vishwani D. Agrawal Agere Systems Processor Architectures and.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 241 Lecture 24 Design for Testability (DFT): Partial-Scan & Scan Variations n Definition n Partial-scan.
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.
Design for Testability
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,
March 6, th Southeastern Symposium on System Theory1 Transition Delay Fault Testing of Microprocessors by Spectral Method Nitin Yogi and Vishwani.
Class Design Project - Test Generation 1 Class Design Project Test Generation Hillary Grimes III ELEC Project Presentation April 26, 2007.
黃錫瑜 Shi-Yu Huang National Tsing-Hua University, Taiwan Speeding Up Byzantine Fault Diagnosis Using Symbolic Simulation.
Design for Testability
Introduction to CMOS VLSI Design Test. CMOS VLSI DesignTestSlide 2 Outline  Testing –Logic Verification –Silicon Debug –Manufacturing Test  Fault Models.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS Design for Testability (DFT) - 2.
EE141 VLSI Test Principles and Architectures Ch. 7 - Logic Diagnosis - P. 1 1 Chapter 7 Logic Diagnosis.
Modern VLSI Design 3e: Chapter 5,6 Copyright  2002 Prentice Hall PTR Adapted by Yunsi Fei Topics n Sequential machine (§5.2, §5.3) n FSM construction.
CSE477 L28 DFT.1Irwin&Vijay, PSU, 2003 CSE477 VLSI Digital Circuits Fall 2003 Lecture 28: Design for Test Mary Jane Irwin ( )
Design for Testability By Dr. Amin Danial Asham. References An Introduction to Logic Circuit Testing.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
A Robust Pulse-triggered Flip-Flop and Enhanced Scan Cell Design
 Counters are sequential circuits which "count" through a specific state sequence. They can count up, count down, or count through other fixed sequences.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
Jing Ye 1,2, Yu Hu 1, and Xiaowei Li 1 1 Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences.
Final Exam Review. Homework Notes Pay attention to significant digits Should not have more significant digits in answer than in problem Example: HW1 #1.1.
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.
LARC 研究群 – 晶片驗證實驗室 LARC – VLSI Verification Lab. 指導老師:清華大學電機系 黃錫瑜 副教授 辦公室 : 資電館 818 室 Circuit Model test patterns = expected.
Deterministic Diagnostic Pattern Generation (DDPG) for Compound Defects Fei Wang 1,2, Yu Hu 1, Huawei Li 1, Xiaowei Li 1, Jing Ye 1,2 1 Key Laboratory.
Fast VLSI Implementation of Sorting Algorithm for Standard Median Filters Hyeong-Seok Yu SungKyunKwan Univ. Dept. of ECE, Vada Lab.
Test Generation for Designs with Multiple Clocks Xijiang LinSudhakar M. Reddy Mentor Graphics Corp SW Boeckman Rd. Wilsonville, OR ECE Department.
Lecture 5: Design for Testability. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 12: Design for Testability2 Outline  Testing –Logic Verification –Silicon.
EE141 Chapter 7 Logic Diagnosis.
Definition Partial-scan architecture Historical background
Lecture 26 Logic BIST Architectures
VLSI Testing Lecture 13: DFT and Scan
Test Data Compression for Scan-Based Testing
Presentation transcript:

Design Technology Center National Tsing Hua University A New Paradigm for Scan Chain Diagnosis Using Signal Processing Techniques Shi-Yu Huang ( 黃錫瑜 ) Jan. 6, 2006 National Tsing-Hua University, Taiwan Acknowledgements 曾昭文 楊振勳

2 Fault Models Scan Chain Faults Functional FaultsTiming Faults Setup-Time Violation Faults (Transition Faults) Stuck-at Bridging Slow-To-Rise Fault Slow-To-Fall Fault Hold-Time Violation Fault

3 A Stuck-At Fault In the Chain Effect: A killer of the scan-test sequence D Q input pins clock output pins D Q D Q Combinational Logic scan-input (SI) scan-output (SO) MUX scan-enable x s-a-0 ? All-0 syndrome

4 Definition: Snapshot Image input pins clock output pins Scan input (SI) Scan output (SO) Mission Logic 0 0 D Q MUX x s-a MUX Snapshot image: {(F 1, F 2, F 3, F 4 ) | (0, 1, 0, 1)} F1F1 F2F2 F3F3 F4F4 Def: A snapshot image is the combination of flip-flop values at certain time instance

5 Definition: Observed Image input pins clock output pins Scan input (SI) Scan output (SO) Mission Logic 0 0 D Q MUX x s-a MUX Snapshot image: {(F 1, F 2, F 3, F 4 ) | (0, 1, 0, 1)} Observed image: {(F 1, F 2, F 3, F 4 ) | (0, 0, 0, 1)} F1F1 F2F2 F3F3 F4F4 Def: An observed image is the scanned-out version of a snapshot image.

6 Test Application: Scan-Capture-Scan 1000 core logic x 1011 Step 1: Scan-in an ATPG pattern 0110 core logic x 0110 core logic x 0010 Step 2: Capture the response to FF’s Step 3: Scan-out and compare SI SO down-stream part Is distorted S-A-0 up-stream part will be distorted S-A-0

7 Test Application: Run-and-Scan Step 1: Apply a sequence of functional patterns from PI’s  Setting up a snapshot image at FF’s Step 2: Scan-out an observed image 0110 core logic x 0010 SO S-A-0 up-stream part will be distorted Less distorted image Test Sequence The fault location is embedded in the observed image

8 Prior Works & Our Advantages  Previous works  Hardware Assisted Extra logic on the scan chain [Edirisooriya 1995] [Nayaranan 1995] [Wu 1998]  Fault Simulation Based To find a faulty circuit matching the syndromes Tightening heuristic  upper & lower bounds [Kundu 1993] [Cheney 2000] [Stanley 2000] [Guo 2001][Y. Huang 2003, 2004, 2005]  Advantages of our approach  (1) Use signal processing techniques  (2) Fault model independent  (3) More capable of handling bridging faults

9 Outline  Introduction  Proposed Approach - Test Sequence Generation - Profile Analysis  Experimental Results  Conclusion

10 Signal Frequency At Flip-Flops st vector2nd vector 3rd vector 0 0 First flip-flop F1: {0, 0, 0, 0}  signal-1 frequency 0 (to be improved) Second flip-flop F2: {0, 1, 0, 1}  signal-1 frequency 0.5 (better) Mission logic Mission logic Mission logic 1st frame2nd frame3rd frame Reset State Observed Image F1 F2 A good set of test sequences  should make each FF as random as possible

11 Diagnostic Test Sequence Selection th 0 0 1st2nd rd4th th6th Selected clock cycles {1, 4, 5, 7}: 1st sequence 2nd sequence 3rd sequence 4th sequence 1 st sequence: {v 1 } 2 nd sequence: {v 1, v 2, v 3, v 4 } 3 rd sequence: {v 1, v 2, v 3, v 4, v 5 } 4 th sequence: {v 1, v 2, v 3, v 4, v 5, v 6, v 7 } reset

12 Interleaved Random-Shift Sequences The advantages of interleaved random-shift sequences:  The sequence is shorter in order to randomize FF values  The fault contamination is less Shift by one bit 0 0 2nd1st reset 0 1 2nd 1 0 Shift by one bit Observed Image Random Vector Random Vector Random Vector

13 Signal Profiling A profile is the distribution of certain statistics of the flip-flops. Fault-free model Faulty flip-flop Up-streamDown-stream core logic Test Sequences fault-free image Scan Shifting core logic perturbed image Failing chip x similar different Fault-free profile Comparing failing profile with the fault-free profile  Could reveal the fault location

14 Profile Analysis Fault-free images (say 100 of them) Failing images (say 100 of them) report a ranked list of fault locations Derive the fault-free profile Derive the failing profile Derive the difference profile Perform filtering on the difference profile Perform edge detection to derive ranking profile difference profile = fault-free profile ⊕ failing profile Collected from tester Details of filtering and edge detection are referred to the paper.

15 Example: Single Stuck-At Fault Example: FIR filter Scan chain: 160 flip-flops Fault injected: 80-th FF Fault-free Profile Faulty Profile Signal-1 Frequency (%) Scan Input  FF index  Scan Output Fault-Free Profile Failing Profile

16 Why Smoothing the Difference Profile?  There are lots of ripples on the raw profiling  We wish to capture the trend Difference profile Scan-InScan-Out Signal-1 Frequency

17 Running-Sum Filtering Notations: D[i]: The signal-1 frequency for i-th FF in Difference Profile SD[i]: The signal-1 frequency of i-th FF in Smoothed Difference Profile SD[i] = 0.2(D[i-4]+D[i-3]+ D[i-2]+ D[i-1]+ D[i])

18 Edge Detection

19 Example: Filtering & Edge Detection Signal-1 Frequency (%) Difference Profile Smooth ProfileRanking Profile Filtered Difference Profile Filtering & Edge Detection Scan Input  FF index  Scan Output

20 Example: Double Transition Faults FIR: 1 chain of 160 cells DFF80 DFF40 Fault-free Profile Faulty Profile Fault-Free Profile Failing Profile Signal-1 Frequency (%) Scan Input  FF index  Scan Output The difference is not as prominent here as that for stuck-at faults.  However, our profile analysis still works well.

21 Example: Double Transition Faults (cont’) Signal-1 Frequency (%) Ranking Profile Filtered Difference Profile Scan Input  FF index  Scan Output Difference Profile Scan Input  FF index  Scan Output

22 Outline  Introduction  Proposed Approach  Experimental Results  Conclusion

23 In-House Test Cases Design Name Size (# Gates) # Scan FF’s # of Images Used (1) GCD1.5k66500 (2) Montgomery Inverse 4.5k (3) Viterbi Decoder 9.5k (4) FIR Filter11k We assume one scan chain for a design Diagnostic test sequences are derived by interleaved random-shift operations

24 Result (1): Single Fault in the Chain Design 1st – hit indexSuccess Rate Stuck-AtBridgeTransitionStuck-AtBridgeTransition GCD %98%100% MON %92%96% FIR %98%100% VITERBI %95%94% Average %96%97.5% (Quality Metrics): (1) Success rate: The percentage of finding a fault in top-10 candidates (2) 1 st -hit index: The first candidate that turns out to be a real fault.

25 Result (2): Single Fault + Faulty Logic Design 1st – hit indexSuccess Rate Stuck-AtBridgeTransitionStuck-AtBridgeTransition GCD %98%97% MON %92%91% FIR %98%95% VITERBI %95%92% Average %96%93.75% (Quality Metrics): (1) Success rate: The percentage of finding a fault in top-10 candidates (2) 1 st -hit index: The first candidate that turns out to be a real fault.

26 Conclusion  Limitations of Existing Methods  (1) More or less bound to certain fault models  (2) Not suitable for bridging faults  (3) Not suitable for intermittent faults  Our contributions  Use signal processing techniques  Free of Fault Models  Good for stuck-at, transition, bridging, etc.  Works well when the core logic is also faulty