CS 150 - Fall 2005 – Lec. #18: Testing - 1 Testing of Logic Circuits zFault Models zTest Generation and Coverage zFault Detection zDesign for Test.

Slides:



Advertisements
Similar presentations
Digital Integrated Circuits© Prentice Hall 1995 Design Methodologies Design for Test.
Advertisements

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.
Mar. 23, 2001VLSI Test: Bushnell-Agrawal/Lecture 201 Lecture 20 Delay Test n Delay test definition n Circuit delays and event propagation n Path-delay.
Introduction to Sequential Logic Design Latches. 2 Terminology A bistable memory device is the generic term for the elements we are studying. Latches.
1 Chapter Design For Testability The Scan-Path Technique The testing problems with sequential circuit can be overcome by two properties: 1.The.
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI Circuit Design Lecture 17 - Sequential.
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.
Lecture 20 Delay Test (Lecture 17alt in the Alternative Sequence)
1 Lecture 20 Delay Test n Delay test definition n Circuit delays and event propagation n Path-delay tests  Non-robust test  Robust test  Five-valued.
EE466: VLSI Design Lecture 17: Design for Testability
Modern VLSI Design 2e: Chapter 4 Copyright  1998 Prentice Hall PTR Topics n Switch networks. n Combinational testing.
CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Sequential Circuits.
Design for Testability Theory and Practice Lecture 11: BIST
Chapter 7: Testing Of Digital Circuits 1 Testing of Digital Circuits M. Balakrishnan Dept. of Comp. Sci. & Engg. I.I.T. Delhi.
Design for Testability
ELEN 468 Lecture 241 ELEN 468 Advanced Logic Design Lecture 24 Design for Testability.
CS Fall 2007 – Lec. #23: Testing - 1 Testing Methodologies Sarah Bird *Many Slides from Randy Katz from Spring 2007 and Kurt Keuzter from Fall 2007.
CS Spring 2007 – Lec. #20: Testing - 1 Testing of Logic Circuits zFault Models zTest Generation and Coverage zFault Detection zDesign for Test.
Embedded Systems Hardware:
January 16, '02Agrawal: Delay testing1 Delay Testing of Digital Circuits Vishwani D. Agrawal Agere Systems, Murray Hill, NJ USA
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.
Embedded Systems Hardware: Storage Elements; Finite State Machines; Sequential Logic.
ELEN 468 Lecture 251 ELEN 468 Advanced Logic Design Lecture 25 Built-in Self Test.
Design for Testability
TOPIC - BIST architectures I
TOPIC : BILBO BIST Architectures UNIT 5 : BIST and BIST Architectures Module 5.2 BIST.
Chapter #6: Sequential Logic Design 6.2 Timing Methodologies
BIST AND DATA COMPRESSION 1 JTAG COURSE spring 2006 Andrei Otcheretianski.
1 Sequential Circuits Registers and Counters. 2 Master Slave Flip Flops.
Technical University Tallinn, ESTONIA Overview: Fault Simulation Overview about methods Low (gate) level methods Parallel fault simulation Deductive fault.
EE 447/EE547 1 VLSI DESIGN Lecture 10 Design for Testability.
Introduction to CMOS VLSI Design Test. CMOS VLSI DesignTestSlide 2 Outline  Testing –Logic Verification –Silicon Debug –Manufacturing Test  Fault Models.
Mugil Vannan H ST Microelectronics India Pvt. Ltd, Noida
CS1Q Computer Systems Lecture 11 Simon Gay. Lecture 11CS1Q Computer Systems - Simon Gay2 The D FlipFlop A 1-bit register is called a D flipflop. When.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Switch networks. n Combinational testing.
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.
August VLSI Testing and Verification Shmuel Wimer Bar Ilan University, School of Engineering.
CSE477 L28 DFT.1Irwin&Vijay, PSU, 2003 CSE477 VLSI Digital Circuits Fall 2003 Lecture 28: Design for Test Mary Jane Irwin ( )
Logic BIST Logic BIST.
Design for Testability By Dr. Amin Danial Asham. References An Introduction to Logic Circuit Testing.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
Introduction to Sequential Logic Design Flip-flops FSM Analysis.
TOPIC : Controllability and Observability
CS/EE 3700 : Fundamentals of Digital System Design
Built-In Self Test (BIST).  1. Introduction  2. Pattern Generation  3. Signature Analysis  4. BIST Architectures  5. Summary Outline.
CEC 220 Digital Circuit Design Mealy and Moore State Machines Friday, March 27 CEC 220 Digital Circuit Design Slide 1 of 16.
Manufacture Testing of Digital Circuits
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Functional testing.
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.
1 Modeling Synchronous Logic Circuits Debdeep Mukhopadhyay Associate Professor Dept of Computer Science and Engineering NYU Shanghai and IIT Kharagpur.
Lecture 5: Design for Testability. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 12: Design for Testability2 Outline  Testing –Logic Verification –Silicon.
EE3A1 Computer Hardware and Digital Design Lecture 13 Detecting faults in Digital Systems.
Hardware Testing and Designing for Testability
VLSI Testing Lecture 14: Built-In Self-Test
CPE/EE 428/528 VLSI Design II – Intro to Testing (Part 2)
CPE/EE 428/528 VLSI Design II – Intro to Testing (Part 3)
ECE 434 Advanced Digital System L18
CS Fall 2005 – Lec. #5 – Sequential Logic - 1
Overview: Fault Diagnosis
测试 Testing 刘鹏 Dept. ISEE Zhejiang University
CSE 370 – Winter Sequential Logic - 1
Sungho Kang Yonsei University
Topics Switch networks. Combinational testing..
Lecture 26 Logic BIST Architectures
Presentation transcript:

CS Fall 2005 – Lec. #18: Testing - 1 Testing of Logic Circuits zFault Models zTest Generation and Coverage zFault Detection zDesign for Test

CS Fall 2005 – Lec. #18: Testing - 2 Fault Model zStuck-At Model yAssume selected wires (gate input or output) are “stuck at” logic value 0 or 1 yModels curtain kinds of fabrication flaws that short circuit wires to ground or power, or broken wires that are floating xWire w stuck-at-0: w/0 xWire w stuck-at-1: w/1 yOften assume there is only one fault at a time—even though in real circuits multiple simultaneous faults are possible and can mask each other yObviously a very simplistic model!

CS Fall 2005 – Lec. #18: Testing - 3 Fault Model zSimple example: zGenerate a testcase to determine if a is stuck at 1 yTry 000 yIf a stuck at 1, expect to see f = 0, but see 1 instead w1w2w3w1w2w3 a/1 b c d f see 1 but should be 0

CS Fall 2005 – Lec. #18: Testing - 4 Fault Model zSimple example w1w2w3w1w2w3 abcabc d f Test w1 w2 w a/0 X X X a/1 X X X b/0 X b/1 X c/0 X c/1 X d/0 X d/1 XX f/0 X X X X X f/1 X X X Fault Detected Test Set

CS Fall 2005 – Lec. #18: Testing - 5 Problems with Fault Model zIn general, n-input circuits require much less than 2 n test inputs to cover all possible stuck-at-faults in the circuit zHowever, this number is usually still too large in real circuits for practical purposes zFinding minimum test cover is an NP-hard problem too

CS Fall 2005 – Lec. #18: Testing - 6 Path Sensitization zWire-at-time testing too laborious zBetter to focus on wiring paths, enabling multi-wire testing at the same time z“Activate” a path so that changes in signal propagating along the path affects the output

CS Fall 2005 – Lec. #18: Testing - 7 Path Sensitization zSimple Example: To activate the path, set inputs so that w 1 can influence f E.g., w 2 = 1, w 3 = 0, w 4 = 1 AND gates: one input at 1 passes the other input NOR gates: one input at 0 inverts the other input To test: w 1 set to 1 should generate f = 0 if path ok faults a/0, b/0, c/1 cause f = 1 w 1 set to 0 should generate f = 1 if path ok faults a/1, b/1, c/0 cause f = 0 One test can capture several faults at once! w1w2w1w2 b f c a w3w3 w4w

CS Fall 2005 – Lec. #18: Testing - 8 Path Sensitization zGood news: one test checks for several faults yNumber of paths much smaller than number of wires yStill an impractically large number of paths for large-scale circuits zPath idea can be used to “propagate” a fault to the output to observe the fault ySet inputs and intermediate values so as to pass an internal wire to the output while setting inputs to drive that internal wire to a known value yIf propagated value isn’t as expected, then we have found a fault on the isolated wire

CS Fall 2005 – Lec. #18: Testing - 9 Fault Propagation w1w2w1w2 b f c g w3w4w3w4 h k w1w2w1w2 f w3w4w3w4 b/ D D 0000 D

CS Fall 2005 – Lec. #18: Testing - 10 Fault Propagation w1w2w1w2 b f c g w3w4w3w4 h k w1w2w1w2 f D w3w4w3w4 g/ D D D

CS Fall 2005 – Lec. #18: Testing - 11 Tree Structured Circuits z To test inputs stuck-at-0 at given AND gate ySet inputs at other gates to generate AND output of zero yForce inputs at selected gate to generate a one yIf f is 1 then circuit ok, else fault z To test inputs stuck-at-1 at given AND gate yDrive input to test to 0, rest of inputs driven to 1 yOther gates driven with inputs that force gates to 0 yIf f is 0 then fault, else OK w1w3w4w1w3w4 w2w3w4w2w3w4 w1w2w3w1w2w3 f

CS Fall 2005 – Lec. #18: Testing - 12 Tree Structured Circuits w1w3w4w1w3w4 w2w3w4w2w3w4 w1w2w3w1w2w3 f w w w w w w w w w w w w w w w w w w w w w w w w w w Stuck-at-0 Stuck-at-1 Product Term Test Stuck-at-1 1

CS Fall 2005 – Lec. #18: Testing - 13 Random Testing zSo far: deterministic testing zAlternative: random testing yGenerate random input patterns to distinguish between the correct function and the faulty function Number of Tests Probability Fault Detected Small number of tests has reasonable probability of finding the fault

CS Fall 2005 – Lec. #18: Testing - 14 Sequential Testing zDue to embedded state inside flip-flops, it is difficult to employ the same methods as with combinational logic zAlternative approach: design for test yScan Path technique: FF inputs pass through multiplexer stages to allow them to be used in normal mode as well as a special test shift register mode

CS Fall 2005 – Lec. #18: Testing - 15 Scan Path Technique z Configure FFs into shift register mode (red path) z Scan in test pattern of 0s and 1s z Non-state inputs can also be on the scan path (think synchronous Mealy Machine) z Run system for one clock cycle in “normal” mode (black path)— next state captured in scan path z Return to shift register mode and shift out the captured state and outputs Combinational Logic

CS Fall 2005 – Lec. #18: Testing - 16 Scan Path Example zw,y1,y2 test vector 001 yScan 01 into y1, y2 FFs z Y1Y2Y1Y2 D Q Q D Q Q y1y2y1y2 w Scan-in Scan-out G/S 0

CS Fall 2005 – Lec. #18: Testing - 17 Scan Path Example zw,y1,y2 test vector 001 yScan 01 into y1, y2 FFs z Y1Y2Y1Y2 D Q Q D Q Q y1y2y1y2 w Scan-in Scan-out G/S 1 0 0

CS Fall 2005 – Lec. #18: Testing - 18 Scan Path Example zw,y1,y2 test vector 001 yScan 01 into y1, y2 FFs z Y1Y2Y1Y2 D Q Q D Q Q y1y2y1y2 w Scan-in Scan-out G/S

CS Fall 2005 – Lec. #18: Testing - 19 Scan Path Example zw,y1,y2 test vector 001 yScan 01 into y1, y2 FFs yNormal w=0 z Y1Y2Y1Y2 D Q Q D Q Q y1y2y1y2 w Scan-in Scan-out G/S

CS Fall 2005 – Lec. #18: Testing - 20 Scan Path Example zw,y1,y2 test vector 001 yScan 01 into y1, y2 FFs yNormal w=0 yOutput z=0, Y1=0, Y2=0 z Y1Y2Y1Y2 D Q Q D Q Q y1y2y1y2 w Scan-in Scan-out G/S

CS Fall 2005 – Lec. #18: Testing - 21 Scan Path Example zw,y1,y2 test vector 001 yScan 01 into y1, y2 FFs yNormal w=0 yOutput z=0, Y1=0, Y2=0 yObserve z directly z Y1Y2Y1Y2 D Q Q D Q Q y1y2y1y2 w Scan-in Scan-out G/S

CS Fall 2005 – Lec. #18: Testing - 22 Scan Path Example zw,y1,y2 test vector 001 yScan 01 into y1, y2 FFs yNormal w=0 yOutput z=0, Y1=0, Y2=0 yObserve z directly yScan out Y1, Y2 z Y1Y2Y1Y2 D Q Q D Q Q y1y2y1y2 w Scan-in Scan-out G/S

CS Fall 2005 – Lec. #18: Testing - 23 Scan Path Example zw,y1,y2 test vector 001 yScan 01 into y1, y2 FFs yNormal w=0 yOutput z=0, Y1=0, Y2=0 yObserve z directly yScan out Y1, Y2 z Y1Y2Y1Y2 D Q Q D Q Q y1y2y1y2 w Scan-in Scan-out G/S 0 0 0

CS Fall 2005 – Lec. #18: Testing - 24 Built-in Self-Test (BIST) zTest Vector Generator yPseudorandom tests with a feedback shift register ySeed generates a sequence of test patterns yOutputs combined using the same technique yGenerates a unique signature that can be checked to determine if the circuit is correct Test Vector Generator Circuit Under Test Response Compressor x 0. x n-1 P 0. P m-1 Signature

CS Fall 2005 – Lec. #18: Testing - 25 Linear Feedback Shift Register D Q Q D Q Q D Q Q D Q Q D Q Q D Q Q D Q Q D Q Q P Signature Random Test Pattern Input from circuit under test

CS Fall 2005 – Lec. #18: Testing - 26 Linear Feedback Shift Register zStarting with the pattern 1000, generates 15 different patterns in sequence and then repeats zPattern 0000 is a no-no D Q Q D Q Q D Q Q D Q Q x3x3 x2x2 x1x1 x0x0 x3x2x1x0fx3x2x1x0f f … … Initial Configuration

CS Fall 2005 – Lec. #18: Testing - 27 Linear Feedback Shift Register zMulti-input Compressor D Q Q D Q Q P3P3 P2P2 D Q Q P1P1 D Q Q P0P0 Signature Circuit Under Test Outputs

CS Fall 2005 – Lec. #18: Testing - 28 Complete Self-Test System Combinational Circuit FFs and Muxes MIC SIC Scan out PRBSG Scan in MUXMUX PRBSG Normal Inputs Random Test Sequences Multi-input Compressor Random Test Sequences Single-input Compressor

CS Fall 2005 – Lec. #18: Testing - 29 Built-in Logic Block Observer (Bilbo) zTest generation and compression in a single circuit! yM 1, M 2 = 11: Regular mode yM 1, M 2 = 00: Shift register mode yM 1, M 2 = 10: Signature generation mode yM 1, M 2 = 01: Reset mode DQ Q DQ Q DQ Q DQ Q M1M1 P3P3 P2P2 P1P1 P0P0 M2M2 Q3Q3 Q2Q2 Q1Q1 Q0Q0 S in G/S Normal/Scan

CS Fall 2005 – Lec. #18: Testing - 30 Bilbo Architecture zScan initial pattern in Bilbo1, reset FFs in Bilbo2 zUse Bilbo1 as PRBS generator for given number of clock cycles and use Bilbo2 to produce signature zScan out Bilbo2 and compare signature; Scan in initial test pattern for CN2; Reset the FFs in Bilbo1 zUse Bilbo2 as PRBS generator for a given number of clock cycles and use Bilbo1 to produce signature zScan out Bilbo1 and compare signature; Combinational Network CN1 Combinational Network CN2 BILBO1 BILBO2 Scan-in Scan-out

CS Fall 2005 – Lec. #18: Testing - 31 Summary zFault models yApproach for determining how to develop a test pattern sequence yWeakness is the single fault assumption zScan Path yTechnique for applying test inputs deep within the system, usually for asserting state yTechnique for getting internal state to edges of circuit for observation zBuilt-in Test yFounded on the approach of random testing yGenerate pseudo random sequences; compute signature; determine if signature generated is same as signature of a correctly working circuity