Overview ECE 553: TESTING AND Definition Ad-hoc methods - - PDF document

overview ece 553 testing and
SMART_READER_LITE
LIVE PREVIEW

Overview ECE 553: TESTING AND Definition Ad-hoc methods - - PDF document

11/11/2014 Overview ECE 553: TESTING AND Definition Ad-hoc methods TESTABLE DESIGN OF Scan design DIGITAL SYSTEMS DIGITAL SYSTEMS Design rules D i l Scan register Scan flip-flops Scan test sequences


slide-1
SLIDE 1

11/11/2014 1

ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS DIGITAL SYSTEMS

Design for Testability (DFT) - 1

Overview

  • Definition
  • Ad-hoc methods
  • Scan design

D i l

11/11/2014 2

– Design rules – Scan register – Scan flip-flops – Scan test sequences – Overhead – Scan design system

  • Summary

Definition

  • Design for testability (DFT) refers to those design

techniques that make test generation and test application cost-effective.

  • DFT methods for digital circuits:

11/11/2014 3

  • DFT methods for digital circuits:

– Ad-hoc methods – Structured methods:

  • Scan
  • Partial Scan
  • Built-in self-test (BIST)
  • Boundary scan

Ad-Hoc DFT Methods

  • Good design practices learned through

experience are used as guidelines:

– Don’t-s and Do-s

  • Avoid asynchronous (unclocked) feedback.

11/11/2014 4

  • Avoid delay dependant logic.
  • Avoid parallel drivers.
  • Avoid monostables and self-resetting logic.
  • Avoid gated clocks.
  • Avoid redundant gates.
  • Avoid high fanin fanout combinations.

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.

11/11/2014 5

  • 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.)

Ad-Hoc DFT Methods

  • Design reviews

– Manual analysis

  • Conducted by experts.

– Programmed analysis

11/11/2014 6

g y

  • Using design auditing tools

– Programmed enforcement

  • Must use certain design practices and cell types.
  • Objective: Adherence to design guidelines and

testability improvement techniques.

slide-2
SLIDE 2

11/11/2014 2

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.

11/11/2014 7

  • Design iterations may be necessary.

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

11/11/2014 8

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

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.

11/11/2014 9

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.

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

11/11/2014 10

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

Correcting a Rule Violation

  • All clocks must be controlled from PIs.

Comb. logic Comb. logic D1 D2 Q FF

11/11/2014 11

logic CK Comb. logic D1 D2 CK Q FF Comb. logic

Scan Flip-Flop (master-slave)

D TC SD Q Q MUX Master latch Slave latch

Logic

  • verhead

11/11/2014 12

CK D flip-flop CK TC Normal mode, D selected Scan mode, SD selected Master open Slave open t t

slide-3
SLIDE 3

11/11/2014 3

Level-Sensitive Scan-Design Latch (LSSD)

D MCK Q Q Master latch Slave latch

11/11/2014 13

SD D flip-flop t SCK TCK SCK MCK TCK Normal mode MCK TCK Scan mode

Logic

  • verhead

Adding Scan Structure

SFF SFF Combinational logic PI PO SCANOUT

11/11/2014 14

SFF SFF logic SCANIN TC or TCK

Not show n: CK or MCK/SCK feed all SFFs (scan Flip- flops).

  • Comb. Test Vectors

I2 I1 O1 O2 PI PO

11/11/2014 15

S2 S1 N2 N1 Combinational logic Presen t state Next state SCANIN TC SCANOUT

  • Comb. Test Vectors

I2 I1 PI SCANIN S1 S2 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 TC Don’t care

  • r random

bits

11/11/2014 16

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

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.

11/11/2014 17

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

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.

11/11/2014 18

g

  • Just one test control (TC) pin is essential.

SFF SFF SFF Combinational logic PI/SCANIN PO/ SCANOUT

M U X

CK TC

slide-4
SLIDE 4

11/11/2014 4

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

11/11/2014 19

p

g

g ,

ff

f p f p ,

– 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%.

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

11/11/2014 20

g

  • Disadvantage: Non-optimum chip layout.

SFF1 SFF2 SFF3 SFF4 SFF3 SFF1 SFF2 SFF4 Scanin Scanout Scanin Scanout Hierarchical netlist Flat layout

Optimum Scan Layout

IO pad Flip- flop ll SFF cell SCANIN X X’

11/11/2014 21

cell Interconnects Routing channels TC SCAN OUT Y Y’ Active areas: XY and X’Y’

Scan Area Overhead

Linear dimensions of active area: X = (C + S) / r X’ = (C + S + αS) / r Y’ = Y + ry = Y + Y(1--β) / T Area overhead X’Y’--XY

y = track dimension, w ire w idth+separation C = total comb. cell w idth S = total non-scan FF cell w idth s = fractional FF cell area

11/11/2014 22

X Y XY = -------------- x 100% XY 1--β = [(1+αs)(1+ -------) – 1] x 100% T 1--β = (αs + ------- ) x 100% T

= S/(C+S) α = SFF cell w idth fractional increase r = number of cell row s

  • r routing channels

β = routing fraction in active area T = cell height in track dimension y

Example: Scan Layout

  • 2,000-gate CMOS chip
  • Fractional area under flip-flop cells, s = 0.478
  • Scan flip-flop (SFF) cell width increase, α

α = 0.25

  • Routing area fraction, β

β = 0.471

  • Cell height in routing tracks, T = 10
  • Calculated overhead = 17 24%

11/11/2014 23

  • 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

ATPG Example: S5378

Original 2,781 179 0.0% Full-scan 2,781 179 15.66% Number of combinational gates Number of non-scan flip-flops (10 gates each) Number of scan flip-flops (14 gates each) Gate overhead

11/11/2014 24

4,603 35/49 70.0% 70.9% 414 414 4,603 214/228 99.1% 100.0% 585 105,662 Number of faults PI/PO for ATPG Fault coverage Fault efficiency Number of ATPG vectors Scan sequence length

slide-5
SLIDE 5

11/11/2014 5

Automated Scan Design

Behavior, RTL, and logic Design and verification Gate-level netlist Scan design rule audits Combinational Scan hard are Rule violations

11/11/2014 25

Combinational ATPG Scan hardware insertion Chip layout: Scan- chain optimization, timing verification Scan sequence and test program generation Design and test data for manufacturing Scan netlist Combinational vectors Scan chain order Mask data Test program

Timing and Power

  • Small delays in scan path and clock skew can

cause race condition.

  • Large delays in scan path require slower scan

clock

11/11/2014 26

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.

Summary

  • Scan is the most popular DFT technique:
  • Rule-based design
  • Automated DFT hardware insertion
  • Combinational ATPG
  • Advantages:

11/11/2014 27

  • 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