ELEN 468 Lecture 251 ELEN 468 Advanced Logic Design Lecture 25 Built-in Self Test

Preview:

Citation preview

ELEN 468 Lecture 25 1

ELEN 468Advanced Logic Design

Lecture 25Built-in Self Test

ELEN 468 Lecture 25 2

BIST ( Built-in Self Test )PRPG: Pseudo Random Pattern GeneratorORA: Output Response AnalyzerCUT: Circuit Under Test

PRPG

CUT

ORA

Start

Pass/fail

PI PO

ELEN 468 Lecture 25 3

BIST MotivationUseful for field test and diagnosis (less expensive than a local automatic test equipment)

ELEN 468 Lecture 25 4

Designand test

+ / -

+ / -

+ / -

Fabri-cation

+

+

+

Manuf.Test

-

-

-

Level

Chips

Boards

System

Maintenancetest

-

Diagnosisand repair

-

-

Serviceinterruption

-

+ Cost increase - Cost saving+/- Cost increase may balance cost reduction

Benefits and Costs of BIST

ELEN 468 Lecture 25 5

Economics – BIST Costs Chip area overhead for:

Test controller Hardware pattern generator Hardware response compacter Testing of BIST hardware

Pin overhead – at least 1 pin needed to activate BIST operation

Performance overhead – extra path delays

Reliability reduction – due to increased area and complexity

ELEN 468 Lecture 25 6

BIST Benefits

Reduced testing and maintenance cost

Lower test generation cost Reduced storage / maintenance of

test patterns Simpler and less expensive ATE Can test many units in parallel Shorter test application times Can test at functional system speed

ELEN 468 Lecture 25 7

BIST Types

On-line BIST Concurrent Non-concurrent

Off-line BIST Functional Structural

ELEN 468 Lecture 25 8

BIST Architecture

ELEN 468 Lecture 25 9

Pseudo-Random Pattern Generation through LFSR

Linear Feedback Shift Register (LFSR) Produces patterns algorithmically – repeatable Has most of desirable random # properties

Long sequences needed for good fault coverage

ELEN 468 Lecture 25 10

Response Compaction

Severe amounts of data in CUT response to LFSR patterns – example: Generate 5 million random patterns CUT has 200 outputs 5 million x 200 = 1 billion bits response

Uneconomical to store and check all of these responses on chipResponses must be compacted

ELEN 468 Lecture 25 11

LFSR for Response Compacter

ELEN 468 Lecture 25 12

Signature AnalysisSignature – any statistical circuit property distinguishing between bad and good circuitsAliasing – due to information loss, signatures of good and some bad machines matchSignature analysis – compare good machine response into good machine signature. Actual signature generated during testing, and compared with good machine signature

ELEN 468 Lecture 25 13

BILBO (Built-in Logic Block Observer)

Four modes:1. Flip-flop2. LFSR pattern generator3. LFSR response compacter4. Scan chain for flip-flops

ELEN 468 Lecture 25 14

Example of BILBOCombined functionality of D flip-flop, pattern generator, response compacter and scan chain

ELEN 468 Lecture 25 15

BILBO Serial Scan ModeB1 B2 = “00”

Dark lines show enabled data paths

ELEN 468 Lecture 25 16

BILBO LFSR Pattern Generator Mode

B1 B2 = “01”

ELEN 468 Lecture 25 17

BILBO in D-FF (Normal) Mode

B1 B2 = “10”

ELEN 468 Lecture 25 18

BILBO in Response Compactor Mode

B1 B2 = “11”

ELEN 468 Lecture 25 19

Exercises Exercises 77

ELEN 468 Lecture 25 20

Problem 1

always @ ( … ) begin

for ( j = 0; j < n; j = j + 1 )

begin a[j] = 0;

for ( k = 0; k < j; k = k + 1 )

@ ( posedge clock )

a[j] = a[j] + x[k];

end end

always @ ( … ) begin

for ( j = 0; j < n; j = j + 1 )

begin

a[j] = 0;

for ( k = 0; k < j; k = k + 1 )

@ ( posedge clock )

a[j] = a[j] + x[k];

end

end

always @ ( … ) begin…

a[0] = 0; for ( j = 0; j < n; j = j +

1 ) begin

@ ( posedge clock ) a[j] = a[j-1] + x[j-1];end

end

always @ ( … ) begin…

a[0] = 0; for ( j = 0; j < n; j = j +

1 ) begin

@ ( posedge clock ) a[j] = a[j-1] + x[j-1];end

end

ELEN 468 Lecture 25 21

Problem 2

Flip-flopa

y

x

b

c zLatch

clock

ELEN 468 Lecture 25 22

Problem 3.1

+

Reg a

Reg b

Reg c

+

+

ELEN 468 Lecture 25 23

Problem 3.2

+

Reg a

Reg b

Reg c

+

+

Recommended