ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS

Slides:



Advertisements
Similar presentations
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 23/19alt1 Lecture 23 Design for Testability (DFT): Full-Scan (Lecture 19alt in the Alternative Sequence)
Advertisements

Copyright 2001, Agrawal & BushnellLecture 12: DFT and Scan1 VLSI Testing Lecture 10: DFT and Scan n Definitions n Ad-hoc methods n Scan design  Design.
Apr. 20, 2001VLSI Test: Bushnell-Agrawal/Lecture 311 Lecture 31 System Test n Definition n Functional test n Diagnostic test  Fault dictionary  Diagnostic.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 261 Lecture 26 Logic BIST Architectures n Motivation n Built-in Logic Block Observer (BILBO) n Test.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 13/12alt1 Lecture 13 Sequential Circuit ATPG Time-Frame Expansion (Lecture 12alt in the Alternative.
1 Lecture 10 Sequential Circuit ATPG Time-Frame Expansion n Problem of sequential circuit ATPG n Time-frame expansion n Nine-valued logic n ATPG implementation.
1 Chapter Design For Testability The Scan-Path Technique The testing problems with sequential circuit can be overcome by two properties: 1.The.
Dec 21, Design for Testability Virendra Singh Indian Institute of Science Bangalore {computer, ieee}.org IEP on Digital System.
Copyright 2001, Agrawal & BushnellDay-2 PM Lecture 101 Design for Testability Theory and Practice Lecture 10: DFT and Scan n Definitions n Ad-hoc methods.
1 Lecture 23 Design for Testability (DFT): Full-Scan n Definition n Ad-hoc methods n Scan design Design rules Scan register Scan flip-flops Scan test sequences.
ELEN 468 Lecture 241 ELEN 468 Advanced Logic Design Lecture 24 Design for Testability.
Practically Realizing Random Access Scan Anand S. Mudlapur Department of Electrical and Computer Engineering Auburn University, AL USA.
Vishwani D. Agrawal James J. Danaher Professor
January 16, '02Agrawal: Delay testing1 Delay Testing of Digital Circuits Vishwani D. Agrawal Agere Systems, Murray Hill, NJ USA
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 20alt1 Lecture 20alt DFT: Partial, Random-Access & Boundary Scan n Definition n Partial-scan architecture.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 241 Lecture 24 Design for Testability (DFT): Partial-Scan & Scan Variations n Definition n Partial-scan.
BIST vs. ATPG.
Design for Testability
TOPIC : Design of Scan Storage Cells UNIT 4 : Design for testability Module 4.3 Scan Architectures and Testing.
Digital Testing: Scan-Path Design
Washington State University
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS Design for Testability (DFT) - 2.
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 ( )
Design for Testability By Dr. Amin Danial Asham. References An Introduction to Logic Circuit Testing.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
A Robust Pulse-triggered Flip-Flop and Enhanced Scan Cell Design
By Praveen Venkataramani
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
Copyright 2001, Agrawal & BushnellLecture 6: Sequential ATPG1 VLSI Testing Lecture 6: Sequential ATPG n Problem of sequential circuit ATPG n Time-frame.
Ch.5 Logic Design Standard Cell Design TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology 1.
Power Problems in VLSI Circuit Testing Keynote Talk Vishwani D. Agrawal James J. Danaher Professor Electrical and Computer Engineering Auburn University,
ASIC Design Methodology
Topics SRAM-based FPGA fabrics: Xilinx. Altera..
VLSI Testing Lecture 5: Logic Simulation
Hardware Testing and Designing for Testability
Vishwani D. Agrawal Department of ECE, Auburn University
Testing And Testable Design of Digital Systems
COUPING WITH THE INTERCONNECT
VLSI Testing Lecture 14: Built-In Self-Test
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES
Lecture 23 Design for Testability (DFT): Full-Scan (chapter14)
Definition Partial-scan architecture Historical background
Lecture 13 Sequential Circuit ATPG Time-Frame Expansion
Lecture 12: Design for Testability
Design for Testability
Lecture 10 Sequential Circuit ATPG Time-Frame Expansion
The Xilinx Virtex Series FPGA
Timing Analysis 11/21/2018.
Lecture 12: Design for Testability
Design for Testability
Lecture 12: Design for Testability
ELEC-7250 VLSI Testing Scan Design Implementation on ISCAS ’89 Benchmark Circuits – s1423 and s1512 Completed by: Jonathan Harris.
VLSI Testing Lecture 8: Sequential ATPG
Pre-Computed Asynchronous Scan Invited Talk
Sungho Kang Yonsei University
Testing in the Fourth Dimension
Design for Testability
The Xilinx Virtex Series FPGA
VLSI Testing Lecture 9: Delay Test
VLSI Testing Lecture 7: Delay Test
Lecture 26 Logic BIST Architectures
Manufacturing Testing
VLSI Testing Lecture 13: DFT and Scan
Synchronous Digital Design Methodology and Guidelines
Test Data Compression for Scan-Based Testing
Lecture 13 Sequential Circuit ATPG Time-Frame Expansion
Synchronous Digital Design Methodology and Guidelines
A Random Access Scan Architecture to Reduce Hardware Overhead
Presentation transcript:

ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS 11/17/2018 ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS Design for Testability (DFT) - 1

Overview Definition Ad-hoc methods Scan design Summary Design rules Scan register Scan flip-flops Scan test sequences Overhead Scan design system Summary 11/17/2018

Definition Design for testability (DFT) refers to those design techniques that make test generation and test application cost-effective. DFT methods for digital circuits: Ad-hoc methods Structured methods: Scan Partial Scan Built-in self-test (BIST) Boundary scan 11/17/2018

Ad-Hoc DFT Methods Good design practices learned through experience are used as guidelines: Don’t-s and Do-s Avoid asynchronous (unclocked) feedback. Avoid delay dependant logic. Avoid parallel drivers. Avoid monostables and self-resetting logic. Avoid gated clocks. Avoid redundant gates. Avoid high fanin fanout combinations. 11/17/2018

Ad-Hoc DFT Methods Good design practices learnt through experience are used as guidelines: Don’t-s and Do-s (contd.) Make flip-flops initializable. Separate digital and analog circuits. Provide test control for difficult-to-control signals. Buses can be useful and make life easier. Limit gate fanin and fanout. Consider ATE requirements (tristates, etc.) 11/17/2018

Ad-Hoc DFT Methods Design reviews Manual analysis Conducted by experts. Programmed analysis Using design auditing tools Programmed enforcement Must use certain design practices and cell types. Objective: Adherence to design guidelines and testability improvement techniques. 11/17/2018

Ad-Hoc DFT Methods Disadvantages of ad-hoc DFT methods: Experts and tools not always available. Test generation is often manual with no guarantee of high fault coverage. Design iterations may be necessary. 11/17/2018

Scan Design Objectives Simple read/write access to all or subset of storage elements in a design. Direct control of storage elements to an arbitrary value (0 or 1). Direct observation of the state of storage elements and hence the internal state of the circuit. Key is – Enhanced controllability and observability. 11/17/2018

Scan Design Circuit is designed using pre-specified design rules. Test structure (hardware) is added to the verified design: Add one (or more) test control (TC) primary input. Replace flip-flops by scan flip-flops and connect to form one or more shift registers in the test mode. Make input/output of each scan shift register controllable/observable from PI/PO. Use combinational ATPG to obtain tests for all testable faults in the combinational logic. Add shift register tests and convert ATPG tests into scan sequences for use in manufacturing test. 11/17/2018

Scan Design Rules Use only clocked D-type flip-flops for all state variables. At least one PI pin must be available for test; more pins, if available, can be used. All clocks must be controlled from PIs. Clocks must not feed data inputs of flip-flops. 11/17/2018

Correcting a Rule Violation All clocks must be controlled from PIs. Comb. logic D1 Q FF Comb. logic D2 CK Comb. logic Q D1 Comb. logic D2 FF CK 11/17/2018

Scan Flip-Flop (master-slave) D Master latch Slave latch TC Q Logic overhead MUX Q SD CK D flip-flop Master open CK Slave open t Normal mode, D selected Scan mode, SD selected TC t 11/17/2018

Level-Sensitive Scan-Design Latch (LSSD) Master latch Slave latch D Q MCK Q SCK D flip-flop SD MCK Normal mode Logic overhead TCK MCK TCK Scan mode TCK SCK t 11/17/2018

Adding Scan Structure PI PO SFF SCANOUT Combinational logic SFF SFF TC or TCK Not shown: CK or MCK/SCK feed all SFFs (scan Flip-flops). SCANIN 11/17/2018

Comb. Test Vectors I1 I2 O1 O2 PI PO Combinational logic SCANIN TC SCANOUT S1 S2 N1 N2 Next state Present state 11/17/2018

Comb. Test Vectors I1 I2 Don’t care or random bits PI SCANIN S1 S2 TC 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 O1 O2 PO SCANOUT N1 N2 Sequence length = (nsff + 1) ncomb + nsff clock periods ncomb = number of combinational vectors nsff = number of scan flip-flops 11/17/2018

Testing Scan Register Scan register must be tested prior to application of scan test sequences. A shift sequence 00110011 . . . of length nsff+4 in scan mode (TC=0) produces 00, 01, 11 and 10 transitions in all flip-flops and observes the result at SCANOUT output. Total scan test length: ((nsff + 1) ncomb + nsff ) + (nsff + 4) clock periods. (ncomb + 2) nsff + ncomb + 4 clock periods. Example: 2,000 scan flip-flops, 500 comb. vectors, total scan test length ~ 106 clocks. Multiple scan registers reduce test length. 11/17/2018

Multiple Scan Registers Scan flip-flops can be distributed among any number of shift registers, each having a separate scanin and scanout pin. Test sequence length is determined by the longest scan shift register. Just one test control (TC) pin is essential. PI/SCANIN PO/ SCANOUT Combinational logic M U X SFF SFF SFF TC CK 11/17/2018

Scan Overhead IO pins: One pin necessary. Area overhead: Gate overhead = [4 nsff/(ng+10nff)] x 100%, where ng = comb. gates; nff = flip-flops; Example – ng = 100k gates, nff = 2k flip-flops, overhead = 6.7%. More accurate estimate must consider scan wiring and layout area. Performance overhead: Multiplexer delay added in combinational path; approx. two gate-delays. Flip-flop output loading due to one additional fanout; approx. 5-6%. 11/17/2018

Hierarchical Scan Scan flip-flops are chained within subnetworks before chaining subnetworks. Advantages: Automatic scan insertion in netlist Circuit hierarchy preserved – helps in debugging and design changes Disadvantage: Non-optimum chip layout. Scanin Scanout SFF1 SFF4 SFF1 SFF3 Scanin Scanout SFF2 SFF3 SFF4 SFF2 Hierarchical netlist Flat layout 11/17/2018

Optimum Scan Layout X’ X SFF cell IO pad SCANIN Flip- flop cell Y Y’ TC SCAN OUT Routing channels Active areas: XY and X’Y’ Interconnects 11/17/2018

Scan Area Overhead Linear dimensions of active area: X = (C + S) / r X’ = (C + S + aS) / r Y’ = Y + ry = Y + Y(1--b) / T Area overhead X’Y’--XY = -------------- x 100% XY 1--b = [(1+as)(1+ -------) – 1] x 100% T = (as + ------- ) x 100% y = track dimension, wire width+separation C = total comb. cell width S = total non-scan FF cell width s = fractional FF cell area = S/(C+S) a = SFF cell width fractional increase r = number of cell rows or routing channels b = routing fraction in active area T = cell height in track dimension y 11/17/2018

Example: Scan Layout 2,000-gate CMOS chip Fractional area under flip-flop cells, s = 0.478 Scan flip-flop (SFF) cell width increase, a = 0.25 Routing area fraction, b = 0.471 Cell height in routing tracks, T = 10 Calculated overhead = 17.24% Actual measured data: Scan implementation Area overhead Normalized clock rate ______________________________________________________________________ None 0.0 1.00 Hierarchical 16.93% 0.87 Optimum layout 11.90% 0.91 11/17/2018

ATPG Example: S5378 Original 2,781 179 0.0% 4,603 35/49 70.0% 70.9% 0.0% 4,603 35/49 70.0% 70.9% 5,533 s 414 Full-scan 2,781 179 15.66% 4,603 214/228 99.1% 100.0% 5 s 585 105,662 Number of combinational gates Number of non-scan flip-flops (10 gates each) Number of scan flip-flops (14 gates each) Gate overhead Number of faults PI/PO for ATPG Fault coverage Fault efficiency CPU time on SUN Ultra II, 200MHz processor Number of ATPG vectors Scan sequence length 11/17/2018

Design and verification Automated Scan Design Behavior, RTL, and logic Design and verification Rule violations Scan design rule audits Gate-level netlist Combinational ATPG Scan hardware insertion Combinational vectors Scan netlist Scan sequence and test program generation Chip layout: Scan- chain optimization, timing verification Scan chain order Design and test data for manufacturing Test program Mask data 11/17/2018

Timing and Power Small delays in scan path and clock skew can cause race condition. Large delays in scan path require slower scan clock. Dynamic multiplexers: Skew between TC and TC signals can cause momentary shorting of D and SD inputs. Random signal activity in combinational circuit during scan can cause excessive power dissipation. 11/17/2018

Summary Scan is the most popular DFT technique: Advantages: Rule-based design Automated DFT hardware insertion Combinational ATPG Advantages: Design automation High fault coverage; helpful in diagnosis Hierarchical – scan-testable modules are easily combined into large scan-testable systems Moderate area (~10%) and speed (~5%) overhead Disadvantages: Large test data volume and long test time Basically a slow speed (DC) test 11/17/2018