Page 1EL/CCUT T.-C. Huang May 2004 TCH CCUT Introduction to IC Test Tsung-Chu Huang ( 黃宗柱 ) Department of Electronic Eng. Chong Chou Institute of Tech.

Slides:



Advertisements
Similar presentations
Built-in Self-test.
Advertisements

Digital Integrated Circuits© Prentice Hall 1995 Design Methodologies Design for Test.
MEMORY BIST by: Saeid Hashemi Mehrdad Falakparvaz
V. Vaithianathan, AP/ECE
Design for Testability (DfT)
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 261 Lecture 26 Logic BIST Architectures n Motivation n Built-in Logic Block Observer (BILBO) n Test.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
5/13/2015 Based on text by S. Mourad "Priciples of Electronic Systems" Digital Testing: Built-in Self-test.
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.
Testability Virendra Singh Indian Institute of Science Bangalore
EE466: VLSI Design Lecture 17: Design for Testability
Design for Testability Theory and Practice Lecture 11: BIST
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 251 Lecture 25 Built-In Self-Testing Pattern Generation and Response Compaction n Motivation and economics.
Embedded Hardware and Software Self-Testing Methodologies for Processor Cores Li Chen, Sujit Dey, Pablo Sanchez, Krishna Sekar, and Ying Chen Design Automation.
Design for Testability
ELEN 468 Lecture 241 ELEN 468 Advanced Logic Design Lecture 24 Design for Testability.
Lecture 27 Memory and Delay-Fault Built-In Self-Testing
Testing of Logic Circuits. 2 Outline  Testing –Logic Verification –Silicon Debug –Manufacturing Test  Fault Models  Observability and Controllability.
Comparison of LFSR and CA for BIST
ELEN 468 Lecture 251 ELEN 468 Advanced Logic Design Lecture 25 Built-in Self Test.
TOPIC - BIST architectures I
3. Built-In Self Test (BIST): Periodical Off-Line Test on the Field 3.1 General Structure Unit Under Test Data Compressor Data Generator Comparator Display.
BIST AND DATA COMPRESSION 1 JTAG COURSE spring 2006 Andrei Otcheretianski.
Error Detection and Correction Rizwan Rehman Centre for Computer Studies Dibrugarh University.
Data link layer: services
EE 447/EE547 1 VLSI DESIGN Lecture 10 Design for Testability.
Introduction to IC Test
Testimise projekteerimine: Labor 2 BIST Optimization
Introduction to CMOS VLSI Design Test. CMOS VLSI DesignTestSlide 2 Outline  Testing –Logic Verification –Silicon Debug –Manufacturing Test  Fault Models.
Part.7.1 Copyright 2007 Koren & Krishna, Morgan-Kaufman FAULT TOLERANT SYSTEMS Part 7 - Coding.
CSE477 L28 DFT.1Irwin&Vijay, PSU, 2003 CSE477 VLSI Digital Circuits Fall 2003 Lecture 28: Design for Test Mary Jane Irwin ( )
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS Built-In Self-Test (BIST) - 1.
Logic BIST Logic BIST.
Session 1 Stream ciphers 1.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
Page 1EL/CCUT T.-C. Huang Apr TCH CCUT Introduction to IC Test Tsung-Chu Huang ( 黃宗柱 ) Department of Electronic Eng. Chong Chou Institute of Tech.
Part 2: Packet Transmission Packets, frames Local area networks (LANs) Wide area networks (LANs) Hardware addresses Bridges and switches Routing and protocols.
Test pattern generator is BIST scan chains TESTGENERATOR COMPACOMPACCTTOORRCOMPACOMPACCTTOORRCTOR Control.
Cyclic Redundancy Check CRC Chapter CYCLIC CODES Cyclic codes are special linear block codes with one extra property. In a cyclic code, if a codeword.
1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.
Page 1EL/CCUT T.-C. Huang May 2004 TCH CCUT Introduction to IC Test Tsung-Chu Huang ( 黃宗柱 ) Department of Electronic Eng. Chong Chou Institute of Tech.
Page 1EL/CCUT T.-C. Huang Mar TCH CCUT Introduction to IC Test Tsung-Chu Huang ( 黃宗柱 ) Department of Electronic Eng. Chong Chou Institute of Tech.
Technical University Tallinn, ESTONIA Introduction: The Problem is Money? Cost of testing Quality Cost of quality Cost Cost of the fault 100% 0% Optimum.
TOPIC : Signature Analysis. Introduction Signature analysis is a compression technique based on the concept of (CRC) Cyclic Redundancy Checking It realized.
Error Detection and Correction
Mixed-Mode BIST Based on Column Matching Petr Fišer.
Built-In Self Test (BIST).  1. Introduction  2. Pattern Generation  3. Signature Analysis  4. BIST Architectures  5. Summary Outline.
Technical University Tallinn, ESTONIA Copyright by Raimund Ubar 1 Raimund Ubar N.Mazurova, J.Smahtina, E.Orasson, J.Raik Tallinn Technical University.
Page 1EL/CCUT T.-C. Huang Nov TCH CCUT Introduction to IC Design Tsung-Chu Huang ( 黃宗柱 ) Department of Electronic Eng. Chong Chou Institute of Tech.
Page 1EL/CCUT T.-C. Huang May 2004 TCH CCUT Introduction to IC Test Tsung-Chu Huang ( 黃宗柱 ) Department of Electronic Eng. Chong Chou Institute of Tech.
Technical University Tallinn, ESTONIA 1 Raimund Ubar TTÜ Tallinn, 21. mai 2003 Hästitestitavad ja isetestivad digitaalsüsteemid.
TOPIC : RTD, SST UNIT 5 : BIST and BIST Architectures Module 5.2 Specific BIST Architectures.
Part III: Data Link Layer Error Detection and Correction
Exercise in the previous class (1) Define (one of) (15, 11) Hamming code: construct a parity check matrix, and determine the corresponding generator matrix.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Error Correction/Detection.
Class Report 林格名 : Reed Solomon Encoder. Reed-Solomom Error Correction When a codeword is decoded, there are three possible outcomes –If 2s + r < 2t (s.
Lecture 5: Design for Testability. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 12: Design for Testability2 Outline  Testing –Logic Verification –Silicon.
FIRST REVIEW.
Hardware Testing and Designing for Testability
VLSI Testing Lecture 14: Built-In Self-Test
Motivation and economics Definitions
CPE/EE 428/528 VLSI Design II – Intro to Testing (Part 3)
Sungho Kang Yonsei University
Lecture 26 Logic BIST Architectures
Test Data Compression for Scan-Based Testing
Motivation and economics Definitions
Chapter 10 Error Detection and Correction
Presentation transcript:

Page 1EL/CCUT T.-C. Huang May 2004 TCH CCUT Introduction to IC Test Tsung-Chu Huang ( 黃宗柱 ) Department of Electronic Eng. Chong Chou Institute of Tech /05/10

Page 2EL/CCUT T.-C. Huang May 2004 TCH CCUT Syllabus & Chapter Precedence Introduction Modeling Logic SimulationFault Modeling Fault Simulation Testing for Single Stuck Faults Test Compression Built-In Self-Test Design for Testability

Page 3EL/CCUT T.-C. Huang May 2004 TCH CCUT Aliasing Test Generator Good Circuit Bad Circuit Correct Response Unobservable Aliasing Testable Test Generator Good Circuit Bad Circuit Correct Response Error Response Compress Test Generator Good Circuit Bad Circuit Correct Response Error Response Non-alias Compress Test Generator Good Circuit Bad Circuit Correct Response Error Response

Page 4EL/CCUT T.-C. Huang May 2004 TCH CCUT Compression Rate Original Digital Signal with N Bytes Compressed file with N c Bytes Uncompressed file with M Bytes with distortion Original Test Vectors for Fault Set, F, with N patterns Compressed Vectors for Fault Set, G, with N c patterns Test (Vector) Compression Original Test Results for Fault Set, F, with N patterns Compressed Results for Fault Set, G, with N c patterns Test Signature Compression Aliased iff F≠G, alias rate =

Page 5EL/CCUT T.-C. Huang May 2004 TCH CCUT Test Compression Techniques 1.One-Counting #1’s in response sequence 2.Transition Counting Transition btw responses r t and r t+1 3.Parity Checking 0-parity or 1-parity 4.Syndrome Checking  1-Counting; 1-ratio in the K-map 5.Signature Analysis Based on CRC (Cyclic Redundancy Check) using LFSR (Linear Feedback Shift Register)

Page 6EL/CCUT T.-C. Huang May 2004 TCH CCUT One-Counting Circuit under Test (CUT) Transition-Counting 1C=11 Parity Check → Odd Compression Rate: Aliasing Rate:

Page 7EL/CCUT T.-C. Huang May 2004 TCH CCUT Syndrome Test The Syndrome S is the normalized number of ones in the result bit stream based on exhausting test. That is, the one-count in the deterministic K-map. The syndrome probability can be calculated. AND OR NAND NOR XOR S1S2S1S2 S 1 +S 2 -S 1 S 2 1-S 1 S 2 1-S 1 -S 2 +S 1 S 2 S 1 +S 2 -2S 1 S 2 S1S1 S2S2 S Not practical in circuitry with many inputs.

Page 8EL/CCUT T.-C. Huang May 2004 TCH CCUT Linear Logic Circuit A linear (logic) circuit preserved the principle of superposition and is constructed from: Delay Flipflops Modulo-2 Adder Modulo-2 Scalar Multiplier D xy = Dx x c cxx cx c x y x+y x y

Page 9EL/CCUT T.-C. Huang May 2004 TCH CCUT Linear Feedback Shift Register, LFSR An LFSR can be mapped into a feedback linear circuit with DFFs & XORs in a modulo-2 domain. Canonical Forms: Type I (Direct Form, External Form): Type II (Indirect Form, Internal Form): D1D1 C1C1 + D2D2 C2C2 + D3D3 C3C3 + D4D4 C4C4 + D n-1 C n-1 + DnDn C n =1 D1D1 D2D2 D3D3 D4D4 D n-1 DnDn C n =1 C n-1 + C n-2 + C n-3 + C n-4 + C1C1 +

Page 10EL/CCUT T.-C. Huang May 2004 TCH CCUT Example D1D1 D2D2 + D3D3 So=So=001 S1=S1=100 S2=S2=010 S3=S3=101 S4=S4=110 S5=S5=111 S6=S6=011 S7=S7=001 So=So= Generating Function

Page 11EL/CCUT T.-C. Huang May 2004 TCH CCUT Why LFSR ? Simple and Regular Structure Compatible with scan DFT design Capable of exhaustive and/or pseudo exhaustive testing Low aliasing probability.

Page 12EL/CCUT T.-C. Huang May 2004 TCH CCUT Characteristic polynomial P(x) Characteristic Polynomials of an LFSR D1D1 C1C1 + D2D2 C2C2 + D3D3 C3C3 + D4D4 C4C4 + D n-1 C n-1 + DnDn C n =1 Generating function Initial State = If IS=1 at D n.

Page 13EL/CCUT T.-C. Huang May 2004 TCH CCUT Maximum Length Sequence Let p be the generating period, P(x) divides into 1-x p. Reciprocal polynomial of P(x) is P*(x)=x n P(1/x). If G(x) of an n-stage LFSR has period 2 n-1, then it is called a maximum-length sequence (MLS) and the characteristic polynomial is called a primitive polynomial. An irreducible polynomial P(x) is with odd number of terms and it’s primitive if min(k)=n for. Primitive (MLS) Polynomials Irreducible polynomials

Page 14EL/CCUT T.-C. Huang May 2004 TCH CCUT An Algorithm to Search ML-LFSR 1.For i=1, x+1 is a primitive polynomial; 2.Put searched irreducible polynomials into a queue. 3.Check a polynomial of order n with the irreducible polynomial of order less than square-root of n. 4.If it is irreducible, check if k is the smallest integer such that it divides into 1+x k, where k=2 n-1.

Page 15EL/CCUT T.-C. Huang May 2004 TCH CCUT Examples of Primitive Polynomials D1D1 D2D2 + D3D3 D1D1 D2D2 D3D3 + D1D1 D2D2 + D3D3 D1D1 D2D2 D3D3 + primitive Note that P*(x) must not be primitive even if P(x) primitive.

Page 16EL/CCUT T.-C. Huang May 2004 TCH CCUT Characteristics of MLS 1.The number of ones in an L-Sequence differs from the number of zeros by 1. 2.An L-Sequence produces an equal number of runs of 1s and 0s. 3.In every L-Sequence, one half the runs have length 1, one fourth have length 2, one eighth have length 3, and so forth. 4.The above properties of randomness make feasible the use of LFSRs as test sequence generators in BIST (Built-In Self-Test, introduced in next chapter) circuitry. 5.LFSRs used as counters are taken advantage of its speed (usually with only the exclusive gate for propagation time of the combinational circuits)

Page 17EL/CCUT T.-C. Huang May 2004 TCH CCUT Pseudo Randomness Example: G%(2 n -1)=G%63 G%2 (n-1) =G%8G%2 (n-1) =G%9 G%2 (n-1) =G%7

Page 18EL/CCUT T.-C. Huang May 2004 TCH CCUT LFSR with the All-Zero Pattern D1D1 C1C1 + D2D2 C2C2 + D3D3 C3C3 + D4D4 C4C4 + D n-1 C n-1 + DnDn C n =1 Reset all FFs

Page 19EL/CCUT T.-C. Huang May 2004 TCH CCUT (Pseudo) Random Pattern Generator (RPG) RPG Typically, 32~128 bits Scan chain Typically, length of 500~3000 CUT SA Typically, 32~128 bits

Page 20EL/CCUT T.-C. Huang May 2004 TCH CCUT Signature Analyzer (SA) D1D1 C1C1 + D2D2 C2C2 + D3D3 C3C3 + D4D4 C4C4 + D n-1 C n-1 + DnDn C n =1 or Generating function Initial State = Input Stream of length L Quotient Remainder Characteristic polynomial P(x) Signature Analysis is a compression technique based on the concept of cyclic redundancy checking (CRC). We use S(x) to denote the input stream (instead of G(x) that is confused in textbook).

Page 21EL/CCUT T.-C. Huang May 2004 TCH CCUT Signature Analyzer (SA) RPG as a special case of SA: S(x)=0 and There are 2 L possible input stream, 2 L-n streams produce a signature. Aliasing rate (proportion of masking error streams is SA with >1 non-0 coefficients detects all single-bit errors (e.g. x+1 ).

Page 22EL/CCUT T.-C. Huang May 2004 TCH CCUT Two Different Application Examples SA1SA2 EncryptionDecryption Communication X(t)X(t-d) ???? PRPGSA Testing CUT

Page 23EL/CCUT T.-C. Huang May 2004 TCH CCUT Multiple Input Signature Register (MISR) Only Type II (Internal) forms can be improved to be multiple-input. D1D1 D2D2 D3D3 D4D4 D n-1 DnDn C n =1 C n-1 + C n-2 + C n-3 + C n-4 + C1C1 + CUT Can be RPG or Non-Random Patterns (e.g., Counter)

Page 24EL/CCUT T.-C. Huang May 2004 TCH CCUT Multiple Inputs Used in Seed Loading D1D1 D2D2 D3D3 D4D4 D n-1 DnDn C n =1 C n-1 + C n-2 + C n-3 + C n-4 + C1C1 + Seed base ROM or Register

Page 25EL/CCUT T.-C. Huang May 2004 TCH CCUT Integrated RPG/MISR into Scan Cells Combinational Circuit Di Si Dn Ci Normal MISR RPG Scan

Page 26EL/CCUT T.-C. Huang May 2004 TCH CCUT Syllabus & Chapter Precedence Introduction Modeling Logic SimulationFault Modeling Fault Simulation Testing for Single Stuck Faults Test Compression Built-In Self-Test Design for Testability ( I )

Page 27EL/CCUT T.-C. Huang May 2004 TCH CCUT Built-In Self-Test (BIST) 1.To Reduce input/output pin signal traffic. 2.Permit easy circuit initialization and observation. 3.Eliminate as much test pattern generation as possible. 4.Achieve fair fault coverage on general class of failure mode. 5.Reduce test time. 6.Execute at-speed testing. 7.Test circuit during burn-in.

Page 28EL/CCUT T.-C. Huang May 2004 TCH CCUT Issues 1.Area overhead 2.Performance degradation 3.Fault coverage 4.Ease of Implementation 5.Capability for system test 6.Diagnosis capability

Page 29EL/CCUT T.-C. Huang May 2004 TCH CCUT Typical BIST Techniques 1.Stored Vector Based 1.Microinstruction support 2.Stored in ROM 2.Algorithmic Hardware Test Pattern Generators 1.Counter 2.Linear Feedback Shift Register 3.Cellular Automata Design with BIST TestGood (or Not)