Efficient On-Line Testing of FPGAs with Provable Diagnosabilities Vinay Verma (Xilinx Inc. ) Shantanu Dutt (Univ. of Illinois at Chicago) Vishal Suthar.

Slides:



Advertisements
Similar presentations
Interconnect Testing in Cluster Based FPGA Architectures Research by Ian G.Harris and Russel Tessier University of Massachusetts. Presented by Alpha Oumar.
Advertisements

Survey of Detection, Diagnosis, and Fault Tolerance Methods in FPGAs
Original Figures for "Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring"
Advertisement In this work we presents novel and efficient methods for on- line CLB testing in FPGA’s. We use a ROving Tester (ROTE) which unlike any prior.
10/28/2009VLSI Design & Test Seminar1 Diagnostic Tests and Full- Response Fault Dictionary Vishwani D. Agrawal ECE Dept., Auburn University Auburn, AL.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 261 Lecture 26 Logic BIST Architectures n Motivation n Built-in Logic Block Observer (BILBO) n Test.
1 Dictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults Chidambaram Alagappan Vishwani D. Agrawal Department of Electrical and Computer.
Built-In Self-Test for Field Programmable Gate Arrays funded by National Security Agency Chuck Stroud Electrical & Computer Engineering Auburn University.
Chapter 3 Image Enhancement in the Spatial Domain.
Self-Checking Carry-Select Adder Design Based on Two-Rail Encoding
Compaction of Diagnostic Test Set for a Full-Response Dictionary Mohammed Ashfaq Shukoor Vishwani D. Agrawal 18th IEEE North Atlantic Test Workshop, 2009.
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 21alt1 Lecture 21alt BIST -- Built-In Self-Test (Alternative to Lectures 25, 26 and 27) n Definition.
Aiman El-Maleh, Ali Alsuwaiyan King Fahd University of Petroleum & Minerals, Dept. of Computer Eng., Saudi Arabia Aiman El-Maleh, Ali Alsuwaiyan King Fahd.
BIST for Logic and Memory Resources in Virtex-4 FPGAs Sachin Dhingra, Daniel Milton, and Charles Stroud Electrical and Computer Engineering Auburn University.
Nitin Yogi and Vishwani D. Agrawal Auburn University Auburn, AL 36849
A Diagnostic Test Generation System Yu Zhang Vishwani D. Agrawal Auburn University, Auburn, Alabama USA Nov. 3rdITC
Design for Testability Theory and Practice Lecture 11: BIST
A Two Phase Approach for Minimal Diagnostic Test Set Generation Mohammed Ashfaq Shukoor Vishwani D. Agrawal 14th IEEE European Test Symposium Seville,
~ EDA lab ~ Interconnect Verification for SOC Jing-Yang Jou Department of Electronics Engineering National Chiao Tung University Hsinchu, Taiwan
Using Hierarchy in Design Automation: The Fault Collapsing Problem Raja K. K. R. Sandireddy Intel Corporation Hillsboro, OR 97124, USA
An Experimental Evaluation on Reliability Features of N-Version Programming Xia Cai, Michael R. Lyu and Mladen A. Vouk ISSRE’2005.
Build-In Self-Test of FPGA Interconnect Delay Faults Laboratory for Reliable Computing (LaRC) Electrical Engineering Department National Tsing Hua University.
Evaluation of Redundancy Analysis Algorithms for Repairable Embedded Memories by Simulation Laboratory for Reliable Computing (LaRC) Electrical Engineering.
ECE 7502 Class Discussion Seyi Ayorinde Tuesday, February 3rd, 2015
TOPIC : Introduction to BIST and types of BIST
4/26/05Cheng: ELEC72501 A New Method for Diagnosing Multiple Stuck- at-Faults using Multiple and Single Fault Simulations An-jen Cheng ECE Dept. Auburn.
BIST AND DATA COMPRESSION 1 JTAG COURSE spring 2006 Andrei Otcheretianski.
Diagnostic and Detection Fault Collapsing for Multiple Output Circuits Raja K. K. R. Sandireddy and Vishwani D. Agrawal Dept. Of Electrical and Computer.
Built-In Self-Test of Programmable I/O Cells in Virtex-4 FPGAs Bradley F. Dutton, Lee W. Lerner, and Charles E. Stroud Dept. of Electrical & Computer Engineering.
International Test Conference Charlotte, NC, Sep 30-Oct 2, 2003 Defect Tolerance at the End of the Roadmap Mahim Mishra and Seth C. Goldstein Carnegie.
Lecture II-2: Probability Review
1 Fault-Tolerant Computing Systems #2 Hardware Fault Tolerance Pattara Leelaprute Computer Engineering Department Kasetsart University
Zvi Kohavi and Niraj K. Jha 1 Capabilities, Minimization, and Transformation of Sequential Machines.
Technical University Tallinn, ESTONIA 1 Boolean derivatives Calculation of the Boolean derivative: Given:
1 Fitting ATE Channels with Scan Chains: a Comparison between a Test Data Compression Technique and Serial Loading of Scan Chains LIRMM CNRS / University.
Technical University Tallinn, ESTONIA 1 Faults in Circuits and Fault Diagnosis 0110 T FaultF 5 located Fault table Test experiment Test generation.
Muralidharan Venkatasubramanian Vishwani D. Agrawal
Quine-McCluskey (Tabular) Minimization Two step process utilizing tabular listings to: Identify prime implicants (implicant tables) Identify minimal PI.
EE141 VLSI Test Principles and Architectures Ch. 9 - Memory Diagnosis & BISR - P. 1 1 Chapter 9 Memory Diagnosis and Built-In Self-Repair.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
1 Fault Tolerance in Field Programmable Gate Arrays Nehir Sönmez 12/5/2005.
Efficient On-line Interconnect BIST in FPGAs with Provable Detectability for Multiple Faults Vishal Suthar and Shantanu Dutt Dept. of ECE University of.
Section 1  Quickly identify faulty components  Design new, efficient testing methodologies to offset the complexity of FPGA testing as compared to.
CS294, Yelick Consensus revisited, p1 CS Consensus Revisited
Re-Configurable Byzantine Quorum System Lei Kong S. Arun Mustaque Ahamad Doug Blough.
TOPIC : Introduction to Fault Simulation
TOPIC : Transition Count Compression UNIT 5 : BIST and BIST Architectures Module 5.4 Compression Techniques.
Baseband Receiver Receiver Design: Demodulation Matched Filter Correlator Receiver Detection Max. Likelihood Detector Probability of Error.
1 Advanced Digital Design Reconfigurable Logic by A. Steininger and M. Delvai Vienna University of Technology.
In-Place Decomposition for Robustness in FPGA Ju-Yueh Lee, Zhe Feng, and Lei He Electrical Engineering Dept., UCLA Presented by Ju-Yueh Lee Address comments.
Testing of Synchronous Sequential Circuits By Dr. Amin Danial Asham.
Quantum algorithms are at most polynomially faster for any symmetric function Andris Ambainis University of Latvia.
Pseudo-random generators Talk for Amnon ’ s seminar.
Mixed PLB and Interconnect BIST for FPGAs Without Fault-Free Assumptions Vishal Suthar and Shantanu Dutt Electrical and Computer Engineering University.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Functional testing.
TOPIC : RTD, SST UNIT 5 : BIST and BIST Architectures Module 5.2 Specific BIST Architectures.
SENG521 (Fall SENG 521 Software Reliability & Testing Fault Tolerant Software Systems: Techniques (Part 4a) Department of Electrical.
A Survey of Fault Tolerant Methodologies for FPGA’s Gökhan Kabukcu
1 Lecture Plan Modelling Profit Distribution from Wind Production (Excel Case: Danish Wind Production and Spot Prices) Reasons for copula.
TITLE : types of BIST MODULE 5.1 BIST basics
July 10, th VLSI Design and Test Symposium1 BIST / Test-Decompressor Design using Combinational Test Spectrum Nitin Yogi Vishwani D. Agrawal Auburn.
Static and Dynamic Fault Diagnosis
VLSI Testing Lecture 14: System Diagnosis
VLSI Testing Lecture 14: Built-In Self-Test
CPE/EE 428/528 VLSI Design II – Intro to Testing (Part 3)
ELEC Digital Logic Circuits Fall 2014 Logic Testing (Chapter 12)
Overview: Fault Diagnosis
Sungho Kang Yonsei University
VLSI Testing Lecture 7: Delay Test
Lecture 26 Logic BIST Architectures
Presentation transcript:

Efficient On-Line Testing of FPGAs with Provable Diagnosabilities Vinay Verma (Xilinx Inc. ) Shantanu Dutt (Univ. of Illinois at Chicago) Vishal Suthar (Univ. of Illinois at Chicago)

Outline Previous on-line testing methods Roving Tester (ROTE) & Bulilt-in Self Tester (BISTer) Concepts Two new BISTer architectures – –1-diagnosable BISTer-1 – –2-diagnosable BISTer-2 New fast functional testing and diagnosis: FAST- TAD Simulation results (fault coverage and fault latency) Conclusions

Previous On-Line Testing Methods On-line testing: Testing a (small) part of the FPGA while a circuit is executing on another part – increases system availability Fault scanning technique of [Shnidman et al., IEEE Tr. VLSI’98] that is applicable to bus-based FPGAs STAR technique of [Abramovici, et al., ITC’99] that uses a roving tester that tests part of the FPGA while the rest executes the application circuit. –Their group have presented several Built-in-Self-Testers (BISTers) with different diagnosabilities and complex adaptive diagnosis; e.g., [Abramovici, et al., ITW’00] – will be discussed later –Have also presented on-line BIST for interconnects [Stroud et al., ITW’01]

Roving Tester (ROTE) with Built-in-Self-Testers (BISTers) CIRCUIT ROTE BISTer Two column left spare for ROTE; one for fault reconf. ROTE roves across the FPGA ROTE concept similar to STAR at a high level Differentiation: BIST designs, fault reconfig. & incr. re-routing techniques SPARE COLUMN CIRCUIT SPARE COLUMN TPG - Test Pattern Generator CUT - Cells Under Test ORA - Output Response Anal. TPG CUT ORA BISTer Syndrome

Definitions k-diagnosability: A testing technique is said to be k-diagnosable if in the presence of any m ≤ k faulty components it can correctly identify all m faulty components among the n ≥ k components that it tests. Detailed syndrome: The detailed syndrome for a session is the 0/1 bit pattern observed at the ORA output (0 => match, 1 => mismatch) over all the test vectors of the TPG. Gross syndrome: A gross syndrome of a session is the overall pass/fail (indicated as X/√) observation over all modes of operation for that session. In other words, the gross syndrome of a session is a X (fail) if the ORA output is 1 for any input test vector and is a √ (pass), otherwise. TPG CUT ORA BISTer Syndrome

TPG - Test Pattern Generator CUT - Cells Under Test ORA - Output Response Analyser BISTer-0 [M. Abramovici et. al., ITC ’99] CUT ORA TPG CUT ORA CUT TPG CUT ORA A B C D A A B B C C D D CUT TPG ORA CUT A D B C (S1) (S2) (S3) (S4) Exhaustive testing of CUTs S1, S2, S3, S4 are four sessions of testing in a BISTer tile

S1S2S3S4 ATPGCUTORACUT BCUTTPGCUTORA CORACUTTPGCUT DCUTORACUTTPG Theorem: BISTer-0 is zero-diagnosable. Proof: The same pair of PLBs are configured as CUTs in two different sessions: PLBs A and C in S2 and S4 PLBs B and D in S1 and S3. When either PLB fails, the gross syndrome will be identical in these sessions. E.g. if A fails as a CUT only, then its gross syndrome is identical to the gross syn. of C failing as a CUT only. Hence we cannot distinguish between faulty PLBs A and C.FaultyPLBS1S2S3S4A√X √/ XX C X√X BISTer-0 [M. Abramovici et. al., ITC ’99] Thus has a complex adaptive diagnosis phase

Our BISTer-1 Architecture A B C D TPG ORA CUT ORACUT S1S2S3S4 Sess  PLB  TPGCUT ORA B A C D S1S2S3S4Inference √√√√ No faulty PLB X√√√ Fault not in PLB √X√√ √√X√ √√√X XX√√ Faulty C (CUT) √XX√ Faulty D (CUT) √√XX Faulty A (CUT) X√√X Faulty B (CUT) X√X√ Fault not in PLB √X√X XXX√ Faulty D √XXX Faulty A XX√X Faulty C X√XX Faulty B XXXX Fault not in PLB CUT B A C D TPG CUT ORA

Our BISTer-1 Architecture S1S2S3S4Inference √√√√ No faulty PLB X√√√ Fault not in PLB √X√√ √√X√ √√√X XX√√ Faulty C (CUT) √XX√ Faulty D (CUT) √√XX Faulty A (CUT) X√√X Faulty B (CUT) X√X√ Fault not in PLB √X√X XXX√ Faulty D √XXX Faulty A XX√X Faulty C X√XX Faulty B XXXX Fault not in PLB A B C D TPG ORA CUT ORACUT S1S2S3S4 Sess  PLB  CUT Theorem: BISTer-1 is 1-diagnosable Each PLB is a CUT in 2 unique sessn’s and a TPG in another unique session – this serves to uniquely identify the faulty PLB which will have a X X √ in these sessions.

BISTer-2 Architecture Y2 Y1 D ORA 2 C CUT TPG CUTTPG ORA 1 A B E F Y1 – output of the ORA comparing CUTs Y2 – output of the ORA comparing TPGs Theorem: BISTer-2 is 1-diagnosable Faulty PLB S1S2S3S4S5S6AX √XXXX BXX √XXX CXXX √XX DXXXX √X EXXXXX √ F √XXXXX Gross syndrome corresponding to Y1 Proof: Gross syndrome corresponding to Y1 for each faulty PLB is unique. E.g. Y1 is pass in section 2 only for faulty PLB A and no other PLB. 6 rotations => 6 sessions

Theorem: BISTer-2 is 2-diagnosable under the assumptions: 1. No fault masking for all detailed syndromes 2. Faulty PLBs either uniformly all fail or all pass as TPG/ORA Proof: For the case faulty PLBs fail as TPG/ORA also, possible gross syndromes (GS) are: Y1Y2 = X √ and XX Class 1: faulty pairs corresponding to GS= X √. 3 Class 1 pairs: (CUT,CUT) 2, (CUT,OR1) 1 and (OR1,CUT) 1 Class 2 includes remaining faulty pairs (GS=XX). For session S1, Class 1 includes BD 2, BC 1 and CD 1 Y2 Y1 D OR 2 C CUT TPG CUTTPG OR 1 A B E F BISTer-2 Architecture (cont.) (S1) Y2 D TPG C OR1 CUT TPGOR2 CUT A B E F (S2) Y1 Y2 Y1 D TPG C OR2 OR1CUT A B E F (S6) S1: GS = X √ => BC/CD/BD S2: GS = X √ => CD S2: GS = X X => BC/BD S6: GS = X √ => BC S6: GS = X X => BD S1: GS = X X => Class 2 pairs In S1-S6 all the faulty pairs at dist. 1 & 2 will be in Class 1 and hence will be diag. => GS’s are distinct for all dist. 1 & 2 faulty pairs dist. 3 pair dist. 1 pair Class 1 pairs CD only Class 1 pair from S1 BC only Class 1 pair from S1 Class 1 pairs dist. 2 pair

The detailed syndrome for a session is the 0/1 bit pattern observed at the ORA output (0 => match, 1 => mismatch) over all the test vectors of the TPG. For faulty pairs at dist. 3, i.e., pairs AD, BE and CF, G.S. of Y1Y2 = XX in all sessions. Hence they don’t fall in Class 1 and hence are not distinguishable among themselves. To distinguish these dist. 3 pairs we compare their detailed syndromes: AD: dS1 = dS3 (T-C in both sess’s), dS4 = dS6 (C-T in both) Similarly, BE: dS1 = dS5, dS2 = dS4 CF: dS2 = dS6, dS3 = dS5 These pairs are uniquely diag. except for the case when dS1 = dS3 = dS5 and dS2 = dS4 = dS6; which is a very low probability event---e.g. requires 4 v. low prob. events of the type ds(CUT, TPG) = ds(TPG, CUT) Thus all faulty pairs are diagnosable with high probability. Y2 Y1 D OR 2 C CUT TPG CUTTPG OR 1 A E F BISTer-2 Architecture (cont.) (S1) Y1 Y2 D CUT C OR1 OR2TPG A B E F (S3) B Three dist. 3 pairs

Fast-TAD: A Fast Functional Testing and Diagnosis In this methodology a PLB is tested only for specific functions (called operational functions) it will assume as the ROTE moves across the FPGA. A PLB X is functionally-faulty (f-faulty) if faults in X produce incorrect outputs, when X implements any of its operational functions. Property: While roving the ROTE in an FPGA either without f-faults or with reconfigured f-faults, a PLB X needs to implement at most 2 functions: its original function (when ROTE is in its initial position) and the fn. of the PLB two f-fault-free PLBs to its right. ROTE PLB in column c3 implements functions fx1 and fx3 as the ROTE moves across the FPGA. c3 c4 c5 fx1fx2 fx3fx4 c6 c7 ROTE c1 c2 c5 fx3fx4 c6 c7 fx2fx1 c1 c2 c3 c4 fx3 fx4 c5 c6 c7 ROTE c1 c2 Operational functions of c3 Advantages: Faster T&D >> yield >> availab.

Diagnosis in Fast-TAD (overlaid on BISTer-1) SesPLBS1S2S3S4 ATPGORACUTd1,d2CUTa1,a2 BCUTb1,b2TPGORACUTa1,a2 CCUTb1,b2CUTc1,c2TPGORA DORACUTc1,c2CUTd1,d2TPG f-faultyPLBS1S2S3S4A √X/√ X BX√ C X√ D X√ Each PLB is tested in its two operational fn. A f-faulty PLB Q config. as a TPG will have a GS of √ while Q configured as a CUT & performing its oper. functions will have GS of X. In all other cases GS is either a √ or a X √X /√ X X√ In some cases, faults in A and C ( or B and D) may not be distinguishable – a 2 nd test reqd. Require 10.t1 time versus 16.t1 if both CUTs in a session are config. both their oper fns.Ses.PLBS1(C/A)S2(B/D)ATPGCUTb1,b2 BCUTc1,c2CUTb1,b2 CCUTc1,c2ORA DORATPG FaultyPLBS1(C/A)S2(B/D)A√ BX CX D√ Theorem: Fast-TAD using BISTer-1 is 1-diagnosableSesPLBS1S2S3S4ATPGORACUTd1,d2a1,a2CUTa1,a2b1,b2 BCUTb1,b2c1,c2TPGORACUTa1,a2b1,b2 CCUTb1,b2c1,c2CUTc1,c2d1,d2TPGORA DORACUTc1,c2d1,d2CUTd1,d2a1,a2TPG

Simulation Environment A 32 x 32 FPGA was simulated with 3-input 1-output PLBs. Fast-TAD with BISTer-1 and STAR BISTer (enhancement of BISTer-0 with 1-diagnosability) techniques were implemented on this FPGA. The adaptive diagnosis phase of the STAR BISTer is very complex; we have simulated only the fault detection and direct diagnosis phase of the STAR BISTer (BISTer-1 has no adaptive diagnosis phase) Two types of faults (with internal fault density up to 25%) were inserted: 1. Randomly distributed faults with external faulty density up to 40% 2. Clustered faults with cluster density up to 3% Prob. of a fault around a “center” fault = k/d (k=const, d=distance) 1 2 Center faulty PLB Correlated faulty PLB Non-faulty PLB Legend:

Simulation of 3 x 2 STAR BISTer [M. Abramovici et, al., ITW ’00]TCTO TC TCTO TC 1-diagnosable; it can diagnose 1 fault in a 3 x 2 BISTer area (1 / 6). Each BISTer consists of 3 TPGs, 2 CUTs and 1 ORA – 6 sessions reqd. STAR moves by 2 cols Very complex adaptive diagnosis phase T – TPG, O – ORA, C – CUT BAT CDT BATCDT TBATCD BATCDT TBATCD Version of our 2 x 2 BISTer-1 w/ a 3-PLB TPG # of TPG PLBs = ratio of inps/outps in PLB => 3 TPGs for testing 3-inp 1-outp PLBs 2x3 BISTer-1: 3 TPGs, 2 CUTs & 1 ORA Basically two partially overlapped basic 2x2 BISTer-1’s – 8 sessions reqd. ROTE moves by 2 cols Result: Can diagnose up to 1 fault in every alt. col of a 2-row FPGA subarray – diagnosability is thus 1 / 4 approaching that of ideal Bister-1’s

Results: Fault Coverage v/s Fault Density Randomly distributed faults Clustered faults with k = 0.5 in The three values of fault density in the plot correspond to cluster densities of 1%, 2% and 3% respectively.

Results: Fault Latency v/s Fault Density

Conclusions Developed a 1-diag. (1 of 4) BISTer Developed (for the 1st time) a 2-diag. (2 of 6) – w/ high prob. -- BISTer Developed (for the 1st time) functional T&D: tests PLBs in only 2 funcs that they will perform; prev. methods performed exhaust testing Fast-TAD w/ BISTer-1 has the same diagnosability (1 of 4) for f-faults Our methods do not require adaptive diagnosis; previous techniques have complex adaptive diag. mechanisms Simulation results for Fast-TAD w/ BISTer-1: fault coverages of 96% & 92 % at fault densities of 10% & 20% resp. The previous best STAR-2x3-BISTer (non-adaptive version): coverages of 74% & 46% at these densities Much lower fault latency of Fast-TAD w/ BISTer-1 compared to that of the STAR-3x2-BISter Its high fault coverage at high flt. densities and low fault latency should prove useful for testing and diagnosing emerging tech. FPGAs (<= 90 nm, nanotechnology) that are expected to have high fault densities

BISTer-2 architecture Y2 Y1 D ORA 2 C CUT TPG CUTTPG ORA 1 A B E F S1S2S3S4S5S6ATPGOR2TPGCUTOR1CUT BCUTTPGOR2TPGCUTOR1 COR1CUTTPGOR2TPGCUT DCUTOR1CUTTPGOR2TPG ETPGCUTOR1CUTTPGOR2 FOR2TPGCUTOR1CUTTPG OR1 => ORA 1 (Y1) OR2 => ORA 2 (Y2) Y1 – output of the ORA comparing CUTs Y2 – output of the ORA comparing TPGs Theorem: BISTer-2 is 1-diagnosable Proof: Gross syndrome corresponding to Y1 for each faulty PLB is unique. E.g. Y1 is pass in section 2 only for faulty PLB A and no other PLB. Faulty PLB S1S2S3S4S5S6AX √XXXX BXX √XXX CXXX √XX DXXXX √X EXXXXX √ F √XXXXX Gross syndrome corresponding to Y1