VLSI Testing Lecture 4: Testability Analysis

Slides:



Advertisements
Similar presentations
Testability Measure What do we mean when we say a circuit is testable?
Advertisements

CMP238: Projeto e Teste de Sistemas VLSI Marcelo Lubaszewski Aula 4 - Teste PPGC - UFRGS 2005/I.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 121 Lecture 12 Advanced Combinational ATPG Algorithms  FAN – Multiple Backtrace (1983)  TOPS – Dominators.
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.
10/4-6/05ELEC / Lecture 111 ELEC / (Fall 2005) Special Topics in Electrical Engineering Low-Power Design of Electronic Circuits.
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.
Give qualifications of instructors: DAP
CS 151 Digital Systems Design Lecture 19 Sequential Circuits: Latches.
Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis1 VLSI Testing Lecture 3b: Testability Analysis n Definition n Controllability and observability.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 71 Lecture 7 Fault Simulation n Problem and motivation n Fault simulation algorithms n Serial n Parallel.
Testability Virendra Singh Indian Institute of Science Bangalore
Copyright 2001, Agrawal & BushnellDay-1 PM Lecture 4a1 Design for Testability Theory and Practice Lecture 4a: Simulation n What is simulation? n Design.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 8alt1 Lecture 8 Testability Measures n Definition n Controllability and observability n SCOAP measures.
Copyright 2001, Agrawal & BushnellDay-1 PM Lecture 4b1 Design for Testability Theory and Practice Lecture 4b: Fault Simulation n Problem and motivation.
Copyright 2001, Agrawal & BushnellDay-1 PM-2 Lecture 51 Testing Analog & Digital Products Lecture 5: Testability Measures n Definition n Controllability.
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.
Spring 08, Apr 1 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2008 Testability Measures Vishwani D. Agrawal James.
ELEN 468 Lecture 241 ELEN 468 Advanced Logic Design Lecture 24 Design for Testability.
Copyright 2001, Agrawal & BushnellDay-1 PM Lecture 61 Design for Testability Theory and Practice Lecture 6: Combinational ATPG n ATPG problem n Example.
Lecture 6 Testability Measures
1 Lecture 10 Redundancy Removal Using ATPG n Redundancy identification n Redundancy removal Original slides copyright by Mike Bushnell and Vishwani Agrawal.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 81 Lecture 8 Testability Measures n Origins n Controllability and observability n SCOAP measures 
Copyright 2001, Agrawal & BushnellDay-1 AM-1 Lecture 11 Testing Analog & Digital Products Dr. Vishwani D. Agrawal James J. Danaher Professor of Electrical.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 101 Lecture 10 Combinational ATPG and Logic Redundancy n Redundancy identification n Redundancy removal.
4/26/05 Kantipudi: ELEC CONTROLLABILITY AND OBSERVABILITY KALYANA R KANTIPUDI VLSI TESTING ’05 TERM PAPER TERM PAPER.
VLSI Testing Lecture 7: Combinational ATPG
10/14/2015 Based on text by S. Mourad "Priciples of Electronic Systems" Digital Testing: Testability Measures.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES
Copyright 2001, Agrawal & BushnellLecture 6: Sequential ATPG1 VLSI Testing Lecture 6: Sequential ATPG n Problem of sequential circuit ATPG n Time-frame.
November 25Asian Test Symposium 2008, Nov 24-27, Sapporo, Japan1 Sequential Circuit BIST Synthesis using Spectrum and Noise from ATPG Patterns Nitin Yogi.
ATPG for Synchronous Sequential Circuits ELEC-7950 Spring 2016 Speaker : Mi Yan Student number : mzy0018.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 61 Lecture 6 Logic Simulation n What is simulation? n Design verification n Circuit modeling n True-value.
VLSI Testing Lecture 5: Logic Simulation
VLSI Testing Lecture 5: Logic Simulation
Lecture 14 Sequential Circuit ATPG Simulation-Based Methods
Hardware Testing and Designing for Testability
Vishwani D. Agrawal Department of ECE, Auburn University
VLSI Testing Lecture 6: Fault Simulation
Algorithms and representations Structural vs. functional test
VLSI Testing Lecture 14: Built-In Self-Test
Lecture 7 Fault Simulation
Lecture 23 Design for Testability (DFT): Full-Scan (chapter14)
332:437 Lecture 12 Finite State Machine Design
Definition Partial-scan architecture Historical background
Lecture 13 Sequential Circuit ATPG Time-Frame Expansion
Definitions D-Algorithm (Roth) D-cubes Bridging faults
Design for Testability
VLSI Testing Lecture 6: Fault Simulation
VLSI Testing Lecture 7: Combinational ATPG
Lecture 10 Sequential Circuit ATPG Time-Frame Expansion
CPE/EE 428, CPE 528 Testing Combinational Logic (5)
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
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
Fault Models, Fault Simulation and Test Generation
VLSI Testing Lecture 7: Combinational ATPG
Guest Lecture by David Johnston
Design for Testability
Automatic Test Pattern Generation
VLSI Testing Lecture 9: Delay Test
VLSI Testing Lecture 7: Delay Test
VLSI Testing Lecture 4: Testability Analysis
Lecture 26 Logic BIST Architectures
Theorems on Redundancy Identification
Lecture 14 Sequential Circuit ATPG Simulation-Based Methods
VLSI Testing Lecture 13: DFT and Scan
ELEC 7770 Advanced VLSI Design Spring 2012 Timing Simulation and STA
Lecture 13 Sequential Circuit ATPG Time-Frame Expansion
Presentation transcript:

VLSI Testing Lecture 4: Testability Analysis Definition Controllability and observability SCOAP measures Combinational circuits Sequential circuits Summary Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

What are Testability Measures? Approximate measures of: Difficulty of setting internal circuit lines to 0 or 1 from primary inputs. Difficulty of observing internal circuit lines at primary outputs. Applications: Analysis of difficulty of testing internal circuit parts – redesign or add special test hardware. Guidance for algorithms computing test patterns – avoid using hard-to-control lines. Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Lecture 4: Testability Analysis Determines testability measures Involves Circuit Topological analysis, but no test vectors (static analysis) and no search algorithm. Linear computational complexity Otherwise, is pointless – might as well use automatic test-pattern generation and calculate: Exact fault coverage Exact test vectors Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Lecture 4: Testability Analysis SCOAP Measures SCOAP – Sandia Controllability and Observability Analysis Program Combinational measures: CC0 – Difficulty of setting circuit line to logic 0 CC1 – Difficulty of setting circuit line to logic 1 CO – Difficulty of observing a circuit line Sequential measures – analogous: SC0 SC1 SO Ref.: L. H. Goldstein, “Controllability/Observability Analysis of Digital Circuits,” IEEE Trans. CAS, vol. CAS-26, no. 9. pp. 685 – 693, Sep. 1979. Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Range of SCOAP Measures Controllabilities – 1 (easiest) to infinity (hardest) Observabilities – 0 (easiest) to infinity (hardest) Combinational measures: Roughly proportional to number of circuit lines that must be set to control or observe given line. Sequential measures: Roughly proportional to number of times flip-flops must be clocked to control or observe given line. Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Combinational Controllability Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Controllability Formulas (Continued) Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Combinational Observability To observe a gate input: Observe output and make other input values non-controlling. Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Observability Formulas (Continued) Fanout stem: Observe through branch with best observability. Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Lecture 4: Testability Analysis Comb. Controllability Circled numbers give level number. (CC0, CC1) Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Controllability Through Level 2 Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Final Combinational Controllability Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Combinational Observability for Level 1 Number in square box is level from primary outputs (POs). (CC0, CC1) CO Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Combinational Observabilities for Level 2 Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Final Combinational Observabilities Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Sequential Measures (Comparison) Combinational Increment CC0, CC1, CO whenever you pass through a gate, either forward or backward. Sequential Increment SC0, SC1, SO only when you pass through a flip-flop, either forward or backward. Both Must iterate on feedback loops until controllabilities stabilize. Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Lecture 4: Testability Analysis D Flip-Flop Equations Assume a synchronous RESET line. CC1 (Q) = CC1 (D) + CC1 (C) + CC0 (C) + CC0 (RESET) SC1 (Q) = SC1 (D) + SC1 (C) + SC0 (C) + SC0 (RESET) + 1 CC0 (Q) = min [CC1 (RESET) + CC1 (C) + CC0 (C), CC0 (D) + CC1 (C) + CC0 (C)] SC0 (Q) is analogous CO (D) = CO (Q) + CC1 (C) + CC0 (C) + CC0 SO (D) is analogous Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

D Flip-Flop Clock and Reset CO (RESET) = CO (Q) + CC1 (Q) + CC1 (RESET) + CC1 (C) + CC0 (C) SO (RESET) is analogous Three ways to observe the clock line: Set Q to 1 and clock in a 0 from D Set the flip-flop and then reset it Reset the flip-flop and clock in a 1 from D CO (C) = min [ CO (Q) + CC1 (Q) + CC0 (D) + CC1 (C) + CC0 (C), CO (Q) + CC1 (Q) + CC1 (RESET) + CO (Q) + CC0 (Q) + CC0 (RESET) + CC1 (D) + CC1 (C) + CC0 (C)] SO (C) is analogous Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Testability Computation For all PIs, CC0 = CC1 = 1 and SC0 = SC1 = 0 For all other nodes, CC0 = CC1 = SC0 = SC1 = ∞ Go from PIs to POs, using CC and SC equations to get controllabilities -- Iterate on loops until SC stabilizes -- convergence is guaranteed. Set CO = SO = 0 for POs, ∞ for all other lines. Work from POs to PIs, Use CO, SO, and controllabilities to get observabilities. Fanout stem (CO, SO) = min branch (CO, SO) If a CC or SC (CO or SO) is ∞ , that node is uncontrollable (unobservable). Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Sequential Example Initialization Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Lecture 4: Testability Analysis After 1 Iteration Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Lecture 4: Testability Analysis After 2 Iterations Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Lecture 4: Testability Analysis After 3 Iterations Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Stable Sequential Measures Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Final Sequential Observabilities Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis

Lecture 4: Testability Analysis Summary Testability measures are approximate measures of: Difficulty of setting circuit lines to 0 or 1 Difficulty of observing internal circuit lines Applications: Analysis of difficulty of testing internal circuit parts Redesign circuit hardware or add special test hardware where measures show poor controllability or observability. Guidance for algorithms computing test patterns – avoid using hard-to-control lines Copyright 2001, Agrawal & Bushnell Lecture 4: Testability Analysis