Random pattern testing versus deterministic testing of RAMs
- 1 May 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (5) , 637-650
- https://doi.org/10.1109/12.24267
Abstract
The number of (random) patterns required for random testing of RAMs (random-access memories), when classical fault models including pattern-sensitive faults are considered is determined. Markov chains are a powerful tool for this purpose. Single faults are considered first, and the influence of different parameters is analyzed. Double faults are then considered and arguments are presented to extend the results to all multiple-coupling faults. Those results are compared to the optimal or best-known number of test patterns required when deterministic testing is considered, for the same fault models.Keywords
This publication has 12 references indexed in Scilit:
- Fault diagnosis of RAMs from random testing experimentsIEEE Transactions on Computers, 1990
- A March Test for Functional Faults in Semiconductor Random Access MemoriesIEEE Transactions on Computers, 1981
- Test Procedures for a Class of Pattern-Sensitive Faults in Semiconductor Random-Access MemoriesIEEE Transactions on Computers, 1980
- Comments on "An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories"IEEE Transactions on Computers, 1979
- Efficient Algorithms for Testing Semiconductor Random-Access MemoriesIEEE Transactions on Computers, 1978
- API Tests for RAM ChipsComputer, 1977
- An Algorithm for Testing Random Access MemoriesIEEE Transactions on Computers, 1977
- Random Testing of MemoriesPublished by Springer Nature ,1977
- The Error Latency of a Fault in a Sequential Digital CircuitIEEE Transactions on Computers, 1976
- Detection oF Pattern-Sensitive Faults in Random-Access MemoriesIEEE Transactions on Computers, 1975