An effective BIST scheme for datapaths
Authors:
- A. PaschalisAPA. Paschalis
- Y. ZorinYZY. Zorin
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10893539,p. 76-85
Abstract
Datapath architectures are widely used in today's complex integrated circuits, such as commercial microprocessors or specialized digital signal processors. A very effective BIST scheme for general datapaths is introduced in this paper. This scheme requires the register transfer (RT) level description of a datapath design, since it is independent of specific implementations of the functional modules. The novel BIST scheme is generic, i.e. independent of the datapath width. Hence, it is well suited for fixed-width datapaths that suffer from testability problems due to the truncation of the low order half part of multiplications. A simplified version of the scheme can also be applied to non fixed-width datapaths. The deterministic BIST patterns applied, always guarantee more than 99% fault coverage, for the entire datapath, within few hundreds of clock cycles. This result is achieved by exploiting the inherent operational parallelism of datapaths. The scheme imposes small area overhead and near-zero delay overhead.Keywords
This publication has 19 references indexed in Scilit:
- An effective BIST scheme for ring-address type FIFOs2002
- On testable multipliers for fixed-width data path architectures2002
- Arithmetic built-in self test for high-level synthesis2002
- Test synthesis in the behavioral domain2002
- An effective BIST scheme for Booth multipliers2002
- An effective BIST scheme for ROM'sIEEE Transactions on Computers, 1992
- Serial interfacing for embedded-memory testingIEEE Design & Test of Computers, 1990
- A Proof of the Modified Booth's Algorithm for MultiplicationIEEE Transactions on Computers, 1975
- Testing for faults in combinational cellular logic arrays1967
- A SIGNED BINARY MULTIPLICATION TECHNIQUEQuarterly Journal of Mechanics and Applied Mathematics, 1951