Design for Testability 1 Basic Concept Design for testability - - PowerPoint PPT Presentation

design for testability
SMART_READER_LITE
LIVE PREVIEW

Design for Testability 1 Basic Concept Design for testability - - PowerPoint PPT Presentation

Design for Testability 1 Basic Concept Design for testability (DFT) Design techniques that make test generation and test application cost-effective. DFT methods for digital circuits: Ad-hoc methods Ad-hoc methods


slide-1
SLIDE 1

Design for Testability

1

slide-2
SLIDE 2

Basic Concept

  • Design for testability (DFT)

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

  • DFT methods for digital circuits:

– Ad-hoc methods

2

– Ad-hoc methods – Structured methods

  • Scan path
  • Level sensitive scan design
  • Random access scan
  • ………
slide-3
SLIDE 3

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.

3

  • Avoid delay dependant logic.
  • Avoid parallel drivers.
  • Avoid monostables and self-resetting logic.
  • Avoid gated clocks.
  • Avoid redundant gates.
slide-4
SLIDE 4
  • Avoid high fanin fanout combinations.
  • Make flip-flops initializable.
  • Separate digital and analog circuits.
  • Provide test control for difficult-to-control

signals. signals.

4

slide-5
SLIDE 5

Ad-hoc Methods :: Drawbacks

  • Experts and tools are not always available.
  • Test generation is often manual, and so

high fault coverage is not guaranteed.

  • Design iterations may be required.

5

  • Design iterations may be required.
  • Difficult to automate.
slide-6
SLIDE 6

Structured Methods

  • Helps to provide good controllability and
  • bservability of internal state variables for

testing.

– Converts the sequential test generation problem into a combinational one.

6

problem into a combinational one.

  • Major approaches:

– Scan path – LSSD – Random access scan – Variations to above …….

slide-7
SLIDE 7

A Sequential Circuit

Combinational Logic

Primary Input Primary Output

7

Flip flops

Present State Next State

slide-8
SLIDE 8

Scan Path Design

  • Basic Problem

– Test generation for sequential circuits is difficult.

  • Objective

– Make all the flip-flops directly controllable and

8

– Make all the flip-flops directly controllable and

  • bservable.
  • What do we gain?

– Combinational circuit test generation can be used. – A few additional tests to test the flip-flops (shift register).

slide-9
SLIDE 9

Scan Design (contd.)

  • Pre-specified design rules.
  • Test structure added to the verified design.

– Add one (or more) test control (TC) primary input. – Replace flip-flops by scan flip-flops.

9

– Connect scan flip-flops to form one or more shift registers in test mode. – Add SCANIN and SCANOUT pins to shift register.

  • Add shift register test and convert ATPG

tests into scan sequences for use in manufacturing test.

slide-10
SLIDE 10

Scan Design Rules

  • Use only clocked D-type master-slave 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.

10

  • All clocks must be controlled from PIs.

– Necessary for flip-flops to work in scan registers.

  • Clocks must not feed data inputs of flip-

flops.

– May lead to race condition.

slide-11
SLIDE 11

Correcting a Rule Violation

  • All clocks must be controlled from PIs.

Comb. logic Comb. logic D1 D2 Q FF

11

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

slide-12
SLIDE 12

Scan Flip-Flop (master-slave)

D TC SD Q Q MUX Master latch Slave latch Logic

  • verhead

12

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

slide-13
SLIDE 13

Adding Scan Structure

SFF SFF

Combinational logic

PI PO SCANOUT

13

SFF SFF SCANIN TC or TCK

slide-14
SLIDE 14
  • Application of the test vectors:

PI Present State PO Next State I1 S1 O1 N1 I2 S2 O2 N2

14

I2 S2 O2 N2 I3 S3 O3 N3 … … … …

slide-15
SLIDE 15

Combinational Test Vectors

I2 I1 O1 O2

Combinational

PI PO

15

S2 S1 N2 N1

Combinational logic

Present state Next state SCANIN TC SCANOUT

slide-16
SLIDE 16

Combinational 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

16

O1 O2 PO SCANOUT N1 N2

slide-17
SLIDE 17
  • Scan sequence length:

(ns + 1) nc + ns clock periods

17

where nc : number of combinational test vectors ns : number of scan flip-flops

slide-18
SLIDE 18

An example: the I/O specifications

3 inputs, 2 outputs, and 3 state variables

PI Present State PO Next State 0 1 0 1 0 0 0 1 1 0 1

18

0 1 1 0 1 0 1 1 0 0 1 1 0 1 1 0 0 1 0 1 1 1 0 0 1 1 0 1 0 1 0 1 0

slide-19
SLIDE 19
  • contd. : corresponding scan sequence

Clock PI SCANIN TC PO SCANOUT 1 xxx 1 xx x 2 xxx xx x 3 xxx xx x

19

4 010 x 1 01 x 5 xxx xx 1 6 xxx 1 xx 7 xxx xx 1 8 011 x 1 11 x

slide-20
SLIDE 20

Scan Testing Time

  • Scan register has to be tested prior to the

application of scan test sequences.

– A shift sequence 00110011… of length ns+4. – Produces all possible transitions in all flip-flops.

  • Total scan test length:

20

  • Total scan test length:

(ns + 1) nc + ns + (ns + 4) ns : number of scan flip-flops nc : number of combinational test vectors ns=2000, nc=500

  • Test length = 106
slide-21
SLIDE 21

A Typical Module With Scan Chains

PI Scan Scan

21

Module

PO Scan in Scan

  • ut
slide-22
SLIDE 22

Multiple Scan Paths

  • Scan flip-flops can be distributed among

any number of shift registers, each having a separate SCANIN and SCANOUT pin.

– PI and PO pins can be shared with SCANIN and SCANOUT pins respectively.

22

and SCANOUT pins respectively.

  • Test sequence length is determined by the

longest scan shift register.

  • Just one test control (TC) pin is essential.
slide-23
SLIDE 23

Multiple Scan Path Example

Combinational Circuit

M U X

PI/SCANIN PO/SCANOUT

23

Circuit

SFF SFF SFF MODE

Only one scan path is shown; others can be added similarly

slide-24
SLIDE 24

Other Issues

  • Multiple scan paths can reduce test

application time.

  • Scan overhead:

– One additional pin (TC)

  • Other pins can be multiplexed with

24

  • Other pins can be multiplexed with

functional input and output pins. – Area overhead

  • Replacing flip-flops by scan flip-flops.

– Performance overhead

  • Additional MUX-es in critical path.
  • Increase in fanout for the flip-flops.
slide-25
SLIDE 25

Scan Overheads

  • IO pins:

– One pin necessary.

  • Area overhead:

Gate overhead = [4 ns / (ng + 10ns)] x 100% where n = number of gates in combinational logic

25

where ng = number of gates in combinational logic ns = number of flip-flops – Example:

  • ng = 100k gates, ns = 2k flip-flops, overhead =

6.7%. – More accurate estimate must consider scan wiring and layout area.

slide-26
SLIDE 26
  • Performance overhead:

– Multiplexer delay added in combinational path;

  • approx. two gate-delays.

– Flip-flop output loading due to one additional fanout; approx. 5-6%.

26

fanout; approx. 5-6%.

slide-27
SLIDE 27

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

27

and design changes

  • Disadvantage: Non-optimum chip layout.
slide-28
SLIDE 28

ATPG Example: S5378

  • !!

"#$%#$ "#$%%&%&'( "#$%%&%&'( )*+

28

  • !

,

  • !!

! ,

  • !!

)*+ "#$%%

  • .,-%/0-)

* %% 1-2#2"2..34& "#$%/0-)* 5

slide-29
SLIDE 29

Summary

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

29

  • 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%)
  • verheads
slide-30
SLIDE 30
  • Disadvantages:
  • Large test data volume and long test time
  • Basically a slow speed (DC) test

30

slide-31
SLIDE 31

Level Sensitive Scan Design

  • Similar to scan path in concept; uses level

sensitive latches.

  • Main issues:

– Absence of races and hazards.

31

– Insensitive to rise time, fall time, delay, etc. – Lower hardware complexity as compared to scan path design. – More complex design rules.

slide-32
SLIDE 32

LSSD

Polarity-Hold Latch:

L D L D +L

C D 0 0 0 1

+L L L

C

32

  • The correct change of the latch output (L) is not dependent
  • n the rise/fall time of C, but only on C being ,1, for a period
  • f time ≥

≥ ≥ ≥ data propagation and stabilization time.

C

1 0 1 1 1

slide-33
SLIDE 33

LSSD

Polarity-Hold Shift-Register Latch (SRL):

L1 DI C SI A +L1 +L1 DI C

33

  • Normal mode: A = B =0, C =0
  • 1.
  • SR (test) mode: C =0, AB = 10
  • 01 to shift SI through L1

and L2.

L2 B +L2 +L2 SI A B

slide-34
SLIDE 34

LSSD

  • Polarity-Hold, hazard-free, and level-

sensitive.

  • To be race-free, clocks C & B as well as A

& B must be non-overlapping.

34

  • Avoids performance degradation

introduced by the MUX in shift-register modification.

slide-35
SLIDE 35

Double-Latch LSSD

C/L

35

X

C/L

Z SI SO C A B L1 L2 L2 L2 L1 L1

slide-36
SLIDE 36

Single-Latch LSSD

C/L C/L C/L C/L

36

C/L C/L C/L C/L

Z Z Z Z X X X X SI SI SI SI SO SO SO SO C C C C A A A A B B B B L1 L1 L1 L1 L2 L2 L2 L2 L2 L2 L2 L2 L2 L2 L2 L2 L1 L1 L1 L1 L1 L1 L1 L1

slide-37
SLIDE 37

Single-Latch LSSD With Conventional SRLs

L2 L2 L1 L1 N1 X1

Y2

SRL

e11 e1n

... ...

~ ~

.

Z1

y1n

. .

y11 .

Sout

Y1

37

L1 L2 L2 L1

2

N2

Y1

X2

Scan Path

... ... . . . . . . .

~ ~

e1m

Sin A

C2

.

Z12

y21 y2m .

Y2 B C1

e21

slide-38
SLIDE 38

SRL Using Two-Port L2

*

D = DI C = CK1 S = I = D2 A = CK2 G1 G3 G4

. . . .

L* L* 38

G2 G8 G7 G5 G6

. . .

B = CK4 D* = D3 C* = CK3

(a) Gate model

slide-39
SLIDE 39

SRL Using Two-Port L2

*

D1 CK1 D2 CK2

L1

Q L1 Q

L* L* .

39 CK2 Q D1 CK1 D2 CK2

L2

Q L2

L*

(b) Symbol

slide-40
SLIDE 40

Single-Latch LSSD With L2* Latches

N1

D1 CK1 D2 CK2 L1 D1 CK1 CK2 L1

Y2 X1

D2

Z1

e11 e1n

... ...

y11 y1n

SRL Y1 L* L*

. .

40

CK2

N2

D1 CK1 D2 CK2 D1 CK1 D2 CK2

L* L*

y2n y21

Y2 X2 C A

...

Z2

e21 e2n

C* B Sin Sout

...

Y1

. . .

slide-41
SLIDE 41

LSSD Design Rules

1. Internal storage elements must be polarity-hold latches. 2. Latches can be controlled by 2 or more non-

  • verlapping clocks that satisfy:

– A latch X may feed the data port of another

41

– A latch X may feed the data port of another latch Y iff the clock that sets the data into Y does not clock X. – A latch X may gate a clock C to produce a gated clock Cg , which drives another latch Y iff Cg , or any other clock C1g , produced from Cg , does not clock X.

slide-42
SLIDE 42

LSSD Design Rules (contd.)

  • 3. There must exist a set of clock primary inputs from

which the clock inputs to all SRLs are controlled either through (1) single-clock distribution tree, or (2) logic that is gated by SRLs and/or non-clock primary inputs. In addition, the following conditions must hold:

42

must hold: – All clock inputs to SRLs must be OFF when clock PIs are OFF. – Any SRL clock input must be controlled from

  • ne or more clock PIs.

– No clock can be ANDed with either the true or the complement of another clock.

slide-43
SLIDE 43

LSSD Design Rules (contd.)

  • 4. Clock PIs cannot feed the data inputs to latches,

either directly or through combinational logic.

  • 5. Every system latch must be part of an SRL; each

SRL must be part of some scan chain.

  • 6. A scan state exists under the following

43

  • 6. A scan state exists under the following

conditions: – Each SRL or scan-out PO is a function of only the preceding SRL or scan-in PI in its scan chain during the scan operation. – All clocks except the shift clocks are disabled at the SRL inputs.

slide-44
SLIDE 44

LSSD Design Rules (contd.)

7. Any shift clock to an SRL can be turned ON or OFF by changing the corresponding clock PI. – A network that satisfies rules 1-4 is level- sensitive. – Race-free operation is guaranteed by rules

44

– Race-free operation is guaranteed by rules 2(1) & 4. – Rule 3 allows a tester to turn off system clocks and use the shift clocks to force data into and out of the scan chain. – Rules 5 & 6 are used to support scan.

slide-45
SLIDE 45

Advantages With LSSD

  • Correct operation independent of AC

characteristics.

  • Reducing FSM to C/L as far as testing is

concerned.

45

  • Eliminating hazards & races; simplifying

test generation and fault simulation.

slide-46
SLIDE 46

Problems With LSSD

  • Design rules imposed on designers --- no freedom to

vary from the overall schemes, and higher design and hardware costs (4-20% more h/w & 4 extra pins).

  • No asynchronous designs.
  • Sequential routing of latches can introduce irregular

46

  • Sequential routing of latches can introduce irregular

structures.

  • Faults changing combinational function to sequential

may cause trouble, e.g., bridging, CMOS stuck-open.

  • Slow test application; normal-speed testing is

impossible.

  • Not good for memory intensive designs.