Testimise projekteerimine: Labor 1 Understanding BIST Sergei Kostin

Slides:



Advertisements
Similar presentations
Introduction to DFT Alexander Gnusin.
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.
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
On the Selection of Efficient Arithmetic Additive Test Pattern Generators S. Manich, L. García, L. Balado, E. Lupon, J. Rius, R. Rodriguez, J. Figueras.
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
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.
11/17/05ELEC / Lecture 201 ELEC / (Fall 2005) Special Topics in Electrical Engineering Low-Power Design of Electronic Circuits.
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.
Fall 2006, Nov. 30 ELEC / Lecture 12 1 ELEC / (Fall 2006) Low-Power Design of Electronic Circuits Test Power Vishwani D.
Lecture 27 Memory and Delay-Fault Built-In Self-Testing
Comparison of LFSR and CA for BIST
Ugur Kalay, Marek Perkowski, Douglas Hall Universally Testable AND-EXOR Networks Portland State University Speaker: Alan Mishchenko.
ELEN 468 Lecture 251 ELEN 468 Advanced Logic Design Lecture 25 Built-in Self Test.
TOPIC - BIST architectures I
TOPIC : BILBO BIST Architectures UNIT 5 : BIST and BIST Architectures Module 5.2 BIST.
TOPIC : Introduction to BIST and types of BIST
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 vs. ATPG.
BIST AND DATA COMPRESSION 1 JTAG COURSE spring 2006 Andrei Otcheretianski.
Spring 07, Jan 30 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 SOC Test Scheduling Vishwani D. Agrawal James.
Generating Random Numbers in Hardware. Two types of random numbers used in computing: --”true” random numbers: ++generated from a physical source (e.g.,
Testimise projekteerimine: Labor 2 BIST Optimization
Department of Computer Engineering Tallinn University of Technology Estonia Final Workshop of CDC Tallinn, Brotherhood of the Blackheads, 21.
Department of Computer Engineering Tallinn University of Technology Estonia 8 th European Workshop on Microelectronics Education – EWME‘2010 Darmstadt,
Mugil Vannan H ST Microelectronics India Pvt. Ltd, Noida
Unit IV Self-Test and Test Algorithms
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
Test pattern generator is BIST scan chains TESTGENERATOR COMPACOMPACCTTOORRCOMPACOMPACCTTOORRCTOR Control.
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 May 2004 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.
Efficient On-line Interconnect BIST in FPGAs with Provable Detectability for Multiple Faults Vishal Suthar and Shantanu Dutt Dept. of ECE University of.
Technical University Tallinn, ESTONIA Overview 1.Introduction 2.Testability measuring 3.Design for testability 4.Built in Self-Test.
TOPIC : Signature Analysis. Introduction Signature analysis is a compression technique based on the concept of (CRC) Cyclic Redundancy Checking It realized.
TOPIC : Controllability and Observability
Mixed-Mode BIST Based on Column Matching Petr Fišer.
Technical University Tallinn, ESTONIA Copyright by Raimund Ubar 1 Raimund Ubar N.Mazurova, J.Smahtina, E.Orasson, J.Raik Tallinn Technical University.
A Test-Per-Clock LFSR Reseeding Algorithm for Concurrent Reduction on Test Sequence Length and Test Data Volume Wei-Cheng Lien 1, Kuen-Jong Lee 1 and Tong-Yu.
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.
POWER OPTIMIZATION IN RANDOM PATTERN GENERATOR By D.Girish Kumar 108W1D8007.
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.
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)
Pattern Compression for Multiple Fault Models
Sungho Kang Yonsei University
Sungho Kang Yonsei University
MS Thesis Defense Presentation by Mustafa Imran Ali COE Department
Lecture 26 Logic BIST Architectures
Reseeding-based Test Set Embedding with Reduced Test Sequences
Test Data Compression for Scan-Based Testing
Motivation and economics Definitions
Presentation transcript:

Testimise projekteerimine: Labor 1 Understanding BIST Sergei Kostin

Laborid 2 1.Understanding BIST (6. nädal) 2.BIST Optimization (10. nädal) 3.Understanding Boundary Scan (14. nädal) BISTA Trainer 1149 Cadence BISTA Turbotester Kursuse töö (eksam)

3 BISTA (Built-in Self Test Analyser) BIST Technique Teaching Tool

4 Trainer 1149 Boundary Scan Technique Teaching Tool

5 Kuidas saada kasutajakontot: Et saada klassi kasutajakontot pead ennast juba eelnevalt olema registreerinud meie LDAP baasis. Kasutajakonto loomine toimub üle ÕIS-i (ois.va.ttu.ee  TTÜ üldparooli loomine). Järgmiseks etapiks on klassi serverisse kasutajakonto loomine. Selleks pöördu webi lehele auth.ttu.ee, logi sisse oma kasutajanime ning parooliga ning kliki lingile "loo klassi kasutaja konto". Kindluse mõttes küsitakse veel korra parooli, mis langeb kokku sisselogimise parooliga ning genereeritakse kasutaja loomise päring. Päringuid töödeldakse perioodiliselt kuid MITTE KOHE pärast päringu sisestamist. Päringu täitmise staatust saab kontrollida webi lehelt auth.ttu.ee. Uus klassi kasutajate süsteem

Juhendid arvutite seadmiseks 6 Esmasel sisselogimisel järgnevad sammud: 1.vahetada oma shell ümber, selleks anda käsklus konsoolis ‘passwd -r ldap -e’ 2. küsitakse parooli ja uue shelli väärtust, uueks shelliks panna: ‘/bin/tcsh’ 3..cshrc puudumisel kopeerida endale õige, järgneva käsuga ‘cp /home/kasutaja/.cshrc.’ 4.Võta maha kommentaarid(e. #).cshrc failis ridadel: setenv TESTER setenv JDK16 5. logida end arvutist välja ning oodata 60 sekundit enne uut sisselogimist

7 BIST (Built-in Self Test) ehk sisseehitatud isetestimine on digitaalskeemi (mikroskeemi, plaadi, süsteemi jms) omadus iseennast testida. BIST Control Unit Circuit Under Test (CUT) Test Pattern Generator (PRPG) Output Response Analyzer (MISR) BIST Memory Typical BIST Architecture

8 Why BIST?  Motivations for BIST:  Need for a cost-efficient testing (general motivation)  Doubts about the stuck-at fault model  Increasing difficulties with TPG (Test Pattern Generation)  Growing volume of test pattern data  Cost of ATE (Automatic Test Equipment)  Test application time  Gap between tester and UUT (Unit Under Test) speeds  Drawbacks of BIST:  Additional pins and silicon area needed  Decreased reliability due to increased silicon area  Performance impact due to additional circuitry  Additional design time and cost

Test Patterns Generator Store in ROM – too expensive Exhaustive Pseudo-exhaustive Pseudo-random (LFSR) – Preferred method Binary counters – use more hardware than LFSR Modified counters T est pattern augmentation LFSR combined with a few patterns in ROM Hardware diffracter – generates pattern cluster in neighborhood of pattern stored in ROM 9

10 BIST: Exhaustive test Universal test sets 1. Exhaustive test (trivial test) 2. Pseudo-exhaustive test Properties of exhaustive tests 1. Advantages (concerning the stuck at fault model): - test pattern generation is not needed - fault simulation is not needed - no need for a fault model - redundancy problem is eliminated - single and multiple stuck-at fault coverage is 100% - easily generated on-line by hardware 2. Shortcomings: - long test length (2 n patterns are needed, n - is the number of inputs) - CMOS stuck-open fault problem

LFSR 11 LFSR – Linear feedback shift register, hardware that generates pseudo-random pattern sequence 1 xx2x2 x3x3 x4x4 Characteristic Polynomial: P(x) = 1 + x 3 + x

Properties of Polynomials Irreducible polynomial – cannot be factored, is divisible only by itself Irreducible polynomial of degree n is characterized by: –An odd number of terms including 1 term –Divisibility into 1 + x k, where k = 2 n – 1 Any polynomial with all even exponents can be factored and hence is reducible An irreducible polynomial is primitive if it divides the polynomial 1+x k for k = 2 n – 1, but not for any smaller positive integer k Only primitive polynomials of an n-bit LFSR generates maximum possible unique patterns 2 n – 1 12

Reciprocal Polynomial 13 The reciprocal polynomial of P(X) is defined by: Example: The reciprocal of polynomial P 3 (x) = 1 + x+ x 3 is  The reciprocal of a primitive polynomial is also primitive

Primitive Polynomials 14 Number of primitive polynomials of degree N NPrimitive Polynomials 1,2,3,4,6,7,15,221 + X + X n 5,11, 21, X 2 + X n 10,17,20,25,28,311 + X 3 + X n 91 + X 4 + X n X 5 + X n X 7 + X n 81 + X 2 + X 3 + X 4 + X n X + X 3 + X 4 + X n X + X 4 + X 6 + X n 14, X + X 3 + X 4 + X n Table of primitive polynomials up to degree 31 NNo

15 Problems with Pseudorandom Test Problem: low fault coverage Counter Decoder & LFSR Reset If Reset = 1 signal has probability 0,5 then counter will not work and 1 for AND gate may never be produced 1 The main motivations of using random patterns are: - low generation cost - high initial efeciency Time Fault Coverage

16 Problems with BIST: Hard-To-Test-Faults Problem: Low fault coverage The main motivations of using random patterns are: - low test generation cost - high initial efficiency 1 2 n -1 Patterns from LFSR: Pseudorandom test window: Hard to test faults 1 2 n -1 Dream solution: Find LFSR such that: Hard to test faults Time Fault Coverage

NB! For using BISTA in Linux classroom 17 Circuits directory: /cad/bista/circuits Test files directory:/t /TEMP_BISTA (t0... – your home directory) Temporary directory: /t0...../TEMP_BISTA Turbotester directory: /cad/bista/ttUNIX Check for BISTA settings

PRPG Panel Tips 18  Settings panel: Used to define program startup parameters  Selection tracing The model files chosen by user are traced and later could be reselected without searching their location in the file system  History panel: reflects experiments and result performed during the session or restored from memory  Loop detection For identifying primitive polynomials right click on model button left click – shows full info; right click – load data

Algorithm Panel Tips (1) 19  Algorithms  New = ATPG ATPG (Automated Test Pattern Generator) Genetic Deterministic Random ATPG algorithms description:

Algorithm Panel Tips (2) 20 Looking for “good” seed (press “New or “Load”) Number of patterns to be considered: Fast–Medium–Thorough Find HTTF – finds hard-to-test faults Cover HTTF – shows pattens testing HTTF Selected vectors can be saved by pressing “Save selection” Any.tst file can be considered for looking HTTF (press “Load”)