Programmable BIST space compactors

doi:10.1109/12.545969

Programmable BIST space compactors

1996-01-01

42

PRE

AI

DOI：10.1109/12.545969

Original

Original request for help

Save

Abstract

En 中文

We address test data compaction for built-in self-test (BIST). We propose a novel taxonomy useful for classifying and comparing BIST compactors. The taxonomy uses the following attributes: space, time, memory, linearity, and circuit (functional) specificity. The thrust of the work focuses on BIST space compaction, a process increasingly required when a large number of internal circuit nodes need to be monitored during test but where area limitations preclude the association of observation latches for all the monitored nodes. We introduce a general class of Space compactors denoted as programmable space compactors (PSCs). Programmability enables highly-effective space compactors to be designed for circuits under test (CUT) subjected to a specific set of test patterns. Circuit-specific information such as the fault-free and expected faulty behavior of a circuit are used to choose PSCs that have better fault coverage and/or lower area costs than the commonly-used parity function. Finding optimal PSCs is a difficult task since the space of possible PSC functions is extremely large and grows exponentially with the number of lines (nodes) to be compacted. We describe an optimization search method based on genetic algorithms for finding combinational PSCs. The factors used to assess the effectiveness of a PSC are its fault coverage and implementation area. Results reveal that we can find PSCs with better fault coverage and cost characteristics than the parity function using modest computing resources, e.g., PSCs with equal or greater fault coverage than the parity function for as little as 20% of the cost (in terms of gate count) with an investment of only a few hours of workstation computing time.

Keywords:

testing

built-in self-test (BIST)

design for testability

BIST methodologies

BIST space compaction

genetic algorithms

parity tree

BIST compaction

Programmable BIST space compactors

Abstract

Journal

Organization