Test response compaction using multiplexed parity trees
Authors:
- J.P. HayesJHJ.P. Hayes
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 15 (11) , 1399-1408
Abstract
Built-in self-testing requires test response streams from many observation points to be merged (space compaction) and compressed (time compaction) into a short signature. The compaction circuits should be transparent to error propagation in order to minimize aliasing, which occurs when a faulty response maps to the fault-free signature. We investigate the use of multiplexed parity trees (MPTs) for zero-aliasing space compaction. MPTs combine the error propagation properties of multiplexers and parity trees, and ensure zero aliasing via multistep compaction. We present two design techniques based on MPTs-output selection and fanout insertion-that eliminate aliasing for both deterministic and pseudorandom test sets. Our experiments with the ISCAS benchmark circuits show that zero aliasing can be achieved with small test sets and moderate hardware overhead. We also demonstrate that a very high percentage of single stuck-line faults in the compaction circuit are detected by the test patterns applied to the circuit under testKeywords
This publication has 7 references indexed in Scilit:
- Multiple fault detection in parity checkersIEEE Transactions on Computers, 1994
- Parity-scan design to reduce the cost of test applicationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Implementation of VLSI self-testing by regularizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- A data compression technique for built-in self-testIEEE Transactions on Computers, 1988
- Space Compression Methods With Output Data ModificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of TestsIEEE Transactions on Computers, 1971
- Testing for faults in combinational cellular logic arrays1967