An effective built-in self-test scheme for parallel multipliers

Citation
D. Gizopoulos et al., An effective built-in self-test scheme for parallel multipliers, IEEE COMPUT, 48(9), 1999, pp. 936-950
Citations number
30
Categorie Soggetti
Computer Science & Engineering
Journal title
IEEE TRANSACTIONS ON COMPUTERS
ISSN journal
00189340 → ACNP
Volume
48
Issue
9
Year of publication
1999
Pages
936 - 950
Database
ISI
SICI code
0018-9340(199909)48:9<936:AEBSSF>2.0.ZU;2-4
Abstract
In this paper, an effective Built-in Self-Test (BIST) scheme for parallel m ultipliers (array and tree) is proposed. The new scheme combines the advant ages of deterministic and pseudorandom testing and avoids their drawbacks. No modifications to the multiplier structure are required. A guaranteed ver y high fault coverage of a comprehensive cellular fault model is achieved. The results do not depend either on the gate-level implementation of the mu ltiplier cells or the architecture of the multiplier (carry-propagate or ca rry-save array multiplier or tree multiplier) or on the multiplier size. A small deterministic test set of highly regular test vectors is used which e xploits the inherent regularity of the multiplier architecture. The regular ity of the test vectors allows for their on-chip generation with very small hardware overhead equivalent to the hardware overhead of pseudorandom test ing.