Presentation is loading. Please wait.

Presentation is loading. Please wait.

Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis1 VLSI Testing Lecture 3b: Testability Analysis n Definition n Controllability and observability.

Published byKatherine Bluett Modified over 9 years ago

Similar presentations

Presentation on theme: "Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis1 VLSI Testing Lecture 3b: Testability Analysis n Definition n Controllability and observability."— Presentation transcript:

1 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis1 VLSI Testing Lecture 3b: Testability Analysis n Definition n Controllability and observability n SCOAP measures  Combinational circuits  Sequential circuits n Summary

2 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis2 What are Testability Measures? n 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. n 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.

3 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis3 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

4 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis4 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.

5 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis5 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.

6 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis6 Combinational Controllability

7 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis7 Controllability Formulas (Continued)

8 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis8 Combinational Observability To observe a gate input: Observe output and make other input values non-controlling.

9 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis9 Observability Formulas (Continued) Fanout stem: Observe through branch with best observability.

10 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis10 Comb. Controllability Circled numbers give level number. (CC0, CC1)

11 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis11 Controllability Through Level 2

12 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis12 Final Combinational Controllability

13 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis13 Combinational Observability for Level 1 Number in square box is level from primary outputs (POs). (CC0, CC1) CO

14 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis14 Combinational Observabilities for Level 2

15 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis15 Final Combinational Observabilities

16 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis16 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.

17 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis17 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 (RESET)  SO (D) is analogous

18 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis18 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: 1. Set Q to 1 and clock in a 0 from D 2. Set the flip-flop and then reset it 3. 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) + CC1 (C) + CC0 (C), CO (Q) + CC0 (Q) + CC0 (RESET) + CC1 (D) + CC1 (C) + CC0 (C)]  SO (C) is analogous

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

20 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis20 Sequential Example Initialization

21 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis21 After 1 Iteration

22 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis22 After 2 Iterations

23 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis23 After 3 Iterations

24 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis24 Stable Sequential Measures

25 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis25 Final Sequential Observabilities

26 Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis26 Summary n Testability measures are approximate measures of:  Difficulty of setting circuit lines to 0 or 1  Difficulty of observing internal circuit lines n Applications:  Analysis of difficulty of testing internal circuit parts n 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

Download ppt "Copyright 2001, Agrawal & BushnellLecture 3b: Testability Analysis1 VLSI Testing Lecture 3b: Testability Analysis n Definition n Controllability and observability."

Similar presentations

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

Testability Measure What do we mean when we say a circuit is testable?
CMP238: Projeto e Teste de Sistemas VLSI Marcelo Lubaszewski Aula 4 - Teste PPGC - UFRGS 2005/I.

CMP238: Projeto e Teste de Sistemas VLSI Marcelo Lubaszewski Aula 4 - Teste PPGC - UFRGS 2005/I.
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.

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 5970-001/6970-001 Lecture 111 ELEC 5970-001/6970-001(Fall 2005) Special Topics in Electrical Engineering Low-Power Design of Electronic Circuits.

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 13/12alt1 Lecture 13 Sequential Circuit ATPG Time-Frame Expansion (Lecture 12alt in the Alternative.

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 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

Give qualifications of instructors: DAP
CS 151 Digital Systems Design Lecture 19 Sequential Circuits: Latches.

CS 151 Digital Systems Design Lecture 19 Sequential Circuits: Latches.
1 Lecture 20 Sequential Circuits: Latches. 2 Overview °Circuits require memory to store intermediate data °Sequential circuits use a periodic signal to.

1 Lecture 20 Sequential Circuits: Latches. 2 Overview °Circuits require memory to store intermediate data °Sequential circuits use a periodic signal to.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Logic Simulation.

ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Logic Simulation.
1 Lecture 14 Sequential Circuit ATPG Simulation-Based Methods n Use of fault simulation for test generation n Contest n Directed search n Cost functions.

1 Lecture 14 Sequential Circuit ATPG Simulation-Based Methods n Use of fault simulation for test generation n Contest n Directed search n Cost functions.
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 21alt1 Lecture 21alt BIST -- Built-In Self-Test (Alternative to Lectures 25, 26 and 27) n Definition.

Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 21alt1 Lecture 21alt BIST -- Built-In Self-Test (Alternative to Lectures 25, 26 and 27) n Definition.
Design for Testability Theory and Practice

Design for Testability Theory and Practice
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.

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.
Nitin Yogi and Vishwani D. Agrawal Auburn University Auburn, AL 36849

Nitin Yogi and Vishwani D. Agrawal Auburn University Auburn, AL 36849
Testability Virendra Singh Indian Institute of Science Bangalore

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 & 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 & BushnellVLSI Test: Lecture 8alt1 Lecture 8 Testability Measures n Definition n Controllability and observability n SCOAP measures.
Parallel Pattern Single Fault Propagation for Combinational Circuits VLSI Testing (ELEC 7250) Submitted by Blessil George, Jyothi Chimakurthy and Malinky.

Parallel Pattern Single Fault Propagation for Combinational Circuits VLSI Testing (ELEC 7250) Submitted by Blessil George, Jyothi Chimakurthy and Malinky.
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 Lecture 4b1 Design for Testability Theory and Practice Lecture 4b: Fault Simulation n Problem and motivation.

Similar presentations

Ads by Google