Most memory test algorithms are optimized tests for a particular memory technology, and a particular set of fault models, under the assumption that the memory is bit-oriented; i.e., read and write operations affect only a single bit in the memory. Traditionally, word-oriented memories have been tested by repeated application of a test for bit-oriented memories whereby a different data background (which depends on the used intra-word fault model) is used during each iteration. This results in rime inefficiencies and limited fault coverage. A new approach for testing word-oriented memories is presented, distinguishing between inter-word and intra-word faults and allowing for a systematic way of converting tests for bit-oriented memories to rests for word-oriented memories. The conversion consists of concatenating the bit-oriented test for inter-word faults with a test for intra-word faults. This approach results in more efficient tests with complete coverage of the targeted faults. Because most memories have an external data path which is wider than one bit, word-oriented memory tests are very important.
[1]
Georgi Gaydadjiev,et al.
March LR: a test for realistic linked faults
,
1996,
Proceedings of 14th VLSI Test Symposium.
[2]
V. K. Agarwal,et al.
Fault Location Algorithms for Repairable Embedded
,
1993
.
[3]
Vinod K. Agarwal,et al.
Fault location algorithms for repairable embedded RAMs
,
1993,
Proceedings of IEEE International Test Conference - (ITC).
[4]
A. J. van de Goor,et al.
Testing Semiconductor Memories: Theory and Practice
,
1998
.
[5]
Frans P. M. Beenker,et al.
A realistic fault model and test algorithms for static random access memories
,
1990,
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..