Abstract
The testability problem of word-oriented memories (WOMs) for pattern sensitive faults is addressed. A novel design for testability (DFT) strategy allows efficient built-in self-testing (BIST) of WOMs. By proper selection of the memory array tiling scheme, it is possible to implement O(V/i) BIST algorithms which test WOMs for various types of neighbourhood pattern sensitive faults (NPSFs). The inputs of the column decoders are modified to allow parallel writing into multiple words, and coincidence comparators are added to allow parallel verification of row data with minimal effect on chip area and performance.
Original language | English |
---|---|
Pages (from-to) | 199-202 |
Number of pages | 4 |
Journal | IEE Proceedings: Computers and Digital Techniques |
Volume | 143 |
Issue number | 3 |
DOIs | |
State | Published - 1996 |
Keywords
- Algorithms
- Computers
- Logic circuits
- Neighbourhood pattern sensitive faults
ASJC Scopus subject areas
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics