Associative search based test algorithms for test acceleration in FAST-RAMs
- 31 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
To accelerate deterministic functional memory chip testing, the authors propose modifying a memory chip using circuit structures known from flag-oriented associative memories. Based on these modifications new test algorithms have been developed. Compared with existing test algorithms the complexity of algorithms developed for fault detection is one or two orders lower. For fault localization it is approximately one order lower and depends additionally on the number of faulty cells in a memory chip. It is shown that this complexity can be reduced further using contents-oriented processing of the information stored in a memory with corresponding circuit structures. In this contribution the basics of the new test approach, the structure of the newly developed test algorithms, the hardware requirements and the achievable test acceleration are discussed.Keywords
This publication has 10 references indexed in Scilit:
- AN ADDRESS MASKABLE PARALLEL TESTING FOR ULTRA HIGH DENSITY DRAMSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A new array architecture for parallel testing in VLSI memoriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- RTRAM: reconfigurable and testable multi-bit RAM designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Using march tests to test SRAMsIEEE Design & Test of Computers, 1993
- A new testing acceleration chip for low-cost memory testsIEEE Design & Test of Computers, 1993
- Acceleration of RAM-Tests with Associative Pattern Recognition MethodsPublished by Springer Nature ,1991
- Parallel testing for pattern-sensitive faults in semiconductor random-access memoriesIEEE Transactions on Computers, 1989
- Flag-algebra: a new concept for the realisation of fully parallel associative architecturesIEE Proceedings E Computers and Digital Techniques, 1989
- A Graph Model for Pattern-Sensitive Faults in Random Access MemoriesIEEE Transactions on Computers, 1981
- Comments on "An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories"IEEE Transactions on Computers, 1979