Cumulative balance testing of logic circuits

Authors:
Krishnendu Chakrabarty;John P. Hayes
Affiliations:
-;-
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
1995

Citing 0
Cited 3

Designs, Intersecting Families, and Weight of Boolean Functions

Proceedings of the 7th IMA International Conference on Cryptography and Coding
Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights

Quantum Information Processing
A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new test response compression method called cumulative balance testing (CBT) that extends both balance testing and accumulator compression testing. CBT uses an accumulated balance signature, and it guarantees very high error coverage (over 99%) for various error models. We demonstrate that the single stuck-line (SSL) fault coverage of CBT for many of the ISCAS 85 combinational benchmark circuits is 100%, and for all but one circuit, the fault coverage is over 99.5%. To make processor circuits self-testing, any existing accumulators and counters can be exploited to implement CBT. Its ease of implementation, provably high error coverage, and exceptionally high SSL fault coverage, even with reduced (nonexhaustive) test sets, make CBT suitable for the built-in self testing of processor circuits that require a guaranteed level of test confidence.