ECE 555 Lecture 16: Design for Testability

Slides:



Advertisements
Similar presentations
Numbers Treasure Hunt Following each question, click on the answer. If correct, the next page will load with a graphic first – these can be used to check.
Advertisements

1
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Fixture Measurements Doug Rytting.
UNITED NATIONS Shipment Details Report – January 2006.
RXQ Customer Enrollment Using a Registration Agent (RA) Process Flow Diagram (Move-In) Customer Supplier Customer authorizes Enrollment ( )
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Create an Application Title 1A - Adult Chapter 3.
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
Chapter 7: Steady-State Errors 1 ©2000, John Wiley & Sons, Inc. Nise/Control Systems Engineering, 3/e Chapter 7 Steady-State Errors.
Turing Machines.
Table 12.1: Cash Flows to a Cash and Carry Trading Strategy.
Digital Integrated Circuits© Prentice Hall 1995 Design Methodologies Design for Test.
PP Test Review Sections 6-1 to 6-6
Chapter 3 Basic Logic Gates 1.
Chapter 4 Gates and Circuits.
Discrete Mathematical Structures: Theory and Applications
Digital Logical Structures
The scale of IC design Small-scale integrated, SSI: gate number usually less than 10 in a IC. Medium-scale integrated, MSI: gate number ~10-100, can operate.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Flip-Flops and Registers
BOUNDARY SCAN.
Chapter 4 Gates and Circuits.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
© 2012 National Heart Foundation of Australia. Slide 2.
Adding Up In Chunks.
While Loop Lesson CS1313 Spring while Loop Outline 1.while Loop Outline 2.while Loop Example #1 3.while Loop Example #2 4.while Loop Example #3.
V. Vaithianathan, AP/ECE
Note to the teacher: Was 28. A. to B. you C. said D. on Note to the teacher: Make this slide correct answer be C and sound to be “said”. to said you on.
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
Datorteknik TopologicalSort bild 1 To verify the structure Easy to hook together combinationals and flip-flops Harder to make it do what you want.
Analyzing Genes and Genomes
1 Let’s Recapitulate. 2 Regular Languages DFAs NFAs Regular Expressions Regular Grammars.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Essential Cell Biology
©2004 Brooks/Cole FIGURES FOR CHAPTER 12 REGISTERS AND COUNTERS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter.
Interfacing to the Analog World
PSSA Preparation.
Essential Cell Biology
Datorteknik TopologicalSort bild 1 To verify the structure Easy to hook together combinationals and flip-flops Harder to make it do what you want.
Energy Generation in Mitochondria and Chlorplasts
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
Introduction to CMOS VLSI Design Lecture 17: Design for Testability David Harris Harvey Mudd College Spring 2004.
fakultät für informatik informatik 12 technische universität dortmund Test Peter Marwedel TU Dortmund Informatik 12 Germany Graphics: © Alexandra Nolte,
EE466: VLSI Design Lecture 17: Design for Testability
Design for Testability
Testing of Logic Circuits. 2 Outline  Testing –Logic Verification –Silicon Debug –Manufacturing Test  Fault Models  Observability and Controllability.
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.
Testing of integrated circuits and design for testability J. Christiansen CERN - EP/MIC
CSE477 L28 DFT.1Irwin&Vijay, PSU, 2003 CSE477 VLSI Digital Circuits Fall 2003 Lecture 28: Design for Test Mary Jane Irwin ( )
Lecture 5: Design for Testability. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 12: Design for Testability2 Outline  Testing –Logic Verification –Silicon.
UNIT VIII: CMOS TESTING
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
Lecture 12: Design for Testability
Lecture 12: Design for Testability
Design for Testability
Lecture 12: Design for Testability
Presentation transcript:

ECE 555 Lecture 16: Design for Testability Slides by David Harris Harvey Mudd College Spring 2004 16: Design for Testability

Outline Testing Logic Verification Silicon Debug Manufacturing Test Fault Models Observability and Controllability Design for Test Scan BIST Boundary Scan 16: Design for Testability

Testing Testing is one of the most expensive parts of chips Logic verification accounts for > 50% of design effort for many chips Debug time after fabrication has enormous opportunity cost Shipping defective parts can sink a company Example: Intel FDIV bug Logic error not caught until > 1M units shipped Recall cost $450M (!!!) 16: Design for Testability

Logic Verification Does the chip simulate correctly? Usually done at HDL level Verification engineers write test bench for HDL Can’t test all cases Look for corner cases Try to break logic design Ex: 32-bit adder Test all combinations of corner cases as inputs: 0, 1, 2, 231-1, -1, -231, a few random numbers Good tests require ingenuity 16: Design for Testability

Silicon Debug Test the first chips back from fabrication If you are lucky, they work the first time If not… Logic bugs vs. electrical failures Most chip failures are logic bugs from inadequate simulation Some are electrical failures Crosstalk Dynamic nodes: leakage, charge sharing Ratio failures A few are tool or methodology failures (e.g. DRC) Fix the bugs and fabricate a corrected chip 16: Design for Testability

Shmoo Plots How to diagnose failures? Hard to access chips Picoprobes Electron beam Laser voltage probing Built-in self-test Shmoo plots Vary voltage, frequency Look for cause of electrical failures 16: Design for Testability

Shmoo Plots How to diagnose failures? Hard to access chips Picoprobes Electron beam Laser voltage probing Built-in self-test Shmoo plots Vary voltage, frequency Look for cause of electrical failures 16: Design for Testability

Manufacturing Test A speck of dust on a wafer is sufficient to kill chip Yield of any chip is < 100% Must test chips after manufacturing before delivery to customers to only ship good parts Manufacturing testers are very expensive Minimize time on tester Careful selection of test vectors 16: Design for Testability

Testing Your Chips If you don’t have a multimillion dollar tester: Build a breadboard with LED’s and switches Hook up a logic analyzer and pattern generator Or use a low-cost functional chip tester 16: Design for Testability

Stuck-At Faults How does a chip fail? Usually failures are shorts between two conductors or opens in a conductor This can cause very complicated behavior A simpler model: Stuck-At Assume all failures cause nodes to be “stuck-at” 0 or 1, i.e. shorted to GND or VDD Not quite true, but works well in practice 16: Design for Testability

Examples 16: Design for Testability

Observability & Controllability Observability: ease of observing a node by watching external output pins of the chip Controllability: ease of forcing a node to 0 or 1 by driving input pins of the chip Combinational logic is usually easy to observe and control Finite state machines can be very difficult, requiring many cycles to enter desired state Especially if state transition diagram is not known to the test engineer 16: Design for Testability

Test Pattern Generation Manufacturing test ideally would check every node in the circuit to prove it is not stuck. Apply the smallest sequence of test vectors necessary to prove each node is not stuck. Good observability and controllability reduces number of test vectors required for manufacturing test. Reduces the cost of testing Motivates design-for-test 16: Design for Testability

Test Example SA1 SA0 A3 A2 A1 A0 n1 n2 n3 Y Minimum set: 16: Design for Testability

Test Example SA1 SA0 A3 {0110} {1110} A2 A1 A0 n1 n2 n3 Y Minimum set: 16: Design for Testability

Test Example SA1 SA0 A3 {0110} {1110} A2 {1010} {1110} A1 A0 n1 n2 n3 Y Minimum set: 16: Design for Testability

Test Example SA1 SA0 A3 {0110} {1110} A2 {1010} {1110} n1 n2 n3 Y Minimum set: 16: Design for Testability

Test Example SA1 SA0 A3 {0110} {1110} A2 {1010} {1110} n1 n2 n3 Y Minimum set: 16: Design for Testability

Test Example SA1 SA0 A3 {0110} {1110} A2 {1010} {1110} n1 {1110} {0110} n2 n3 Y Minimum set: 16: Design for Testability

Test Example SA1 SA0 A3 {0110} {1110} A2 {1010} {1110} n1 {1110} {0110} n2 {0110} {0100} n3 Y Minimum set: 16: Design for Testability

Test Example SA1 SA0 A3 {0110} {1110} A2 {1010} {1110} n1 {1110} {0110} n2 {0110} {0100} n3 {0101} {0110} Y Minimum set: 16: Design for Testability

Test Example SA1 SA0 A3 {0110} {1110} A2 {1010} {1110} n1 {1110} {0110} n2 {0110} {0100} n3 {0101} {0110} Y {0110} {1110} Minimum set: {0100, 0101, 0110, 0111, 1010, 1110} 16: Design for Testability

Design for Test Design the chip to increase observability and controllability If each register could be observed and controlled, test problem reduces to testing combinational logic between registers. Better yet, logic blocks could enter test mode where they generate test patterns and report the results automatically. 16: Design for Testability

Scan Convert each flip-flop to a scan register Only costs one extra multiplexer Normal mode: flip-flops behave as usual Scan mode: flip-flops behave as shift register Contents of flops can be scanned out and new values scanned in 16: Design for Testability

Scannable Flip-flops 16: Design for Testability

Built-in Self-test Built-in self-test lets blocks test themselves Generate pseudo-random inputs to comb. logic Combine outputs into a syndrome With high probability, block is fault-free if it produces the expected syndrome 16: Design for Testability

PRSG Linear Feedback Shift Register Shift register with input taken from XOR of state Pseudo-Random Sequence Generator Step Q 111 1 2 3 4 5 6 7 16: Design for Testability

PRSG Linear Feedback Shift Register Shift register with input taken from XOR of state Pseudo-Random Sequence Generator Step Q 111 1 110 2 3 4 5 6 7 16: Design for Testability

PRSG Linear Feedback Shift Register Shift register with input taken from XOR of state Pseudo-Random Sequence Generator Step Q 111 1 110 2 101 3 4 5 6 7 16: Design for Testability

PRSG Linear Feedback Shift Register Shift register with input taken from XOR of state Pseudo-Random Sequence Generator Step Q 111 1 110 2 101 3 010 4 5 6 7 16: Design for Testability

PRSG Linear Feedback Shift Register Shift register with input taken from XOR of state Pseudo-Random Sequence Generator Step Q 111 1 110 2 101 3 010 4 100 5 6 7 16: Design for Testability

PRSG Linear Feedback Shift Register Shift register with input taken from XOR of state Pseudo-Random Sequence Generator Step Q 111 1 110 2 101 3 010 4 100 5 001 6 7 16: Design for Testability

PRSG Linear Feedback Shift Register Shift register with input taken from XOR of state Pseudo-Random Sequence Generator Step Q 111 1 110 2 101 3 010 4 100 5 001 6 011 7 16: Design for Testability

PRSG Linear Feedback Shift Register Shift register with input taken from XOR of state Pseudo-Random Sequence Generator Step Q 111 1 110 2 101 3 010 4 100 5 001 6 011 7 111 (repeats) 16: Design for Testability

BILBO Built-in Logic Block Observer Combine scan with PRSG & signature analysis 16: Design for Testability

Boundary Scan Testing boards is also difficult Need to verify solder joints are good Drive a pin to 0, then to 1 Check that all connected pins get the values Through-hold boards used “bed of nails” SMT and BGA boards cannot easily contact pins Build capability of observing and controlling pins into each chip to make board test easier 16: Design for Testability

Boundary Scan Example 16: Design for Testability

Boundary Scan Interface Boundary scan is accessed through five pins TCK: test clock TMS: test mode select TDI: test data in TDO: test data out TRST*: test reset (optional) Chips with internal scan chains can access the chains through boundary scan for unified test strategy. 16: Design for Testability

Summary Think about testing from the beginning Simulate as you go Plan for test after fabrication “If you don’t test it, it won’t work! (Guaranteed)” 16: Design for Testability