Abstract
Given a set of memory array faults the problem of computing a compact March test that detects all specified memory array faults is addressed. In this paper, we propose a novel approach in which every memory array fault is modeled by a set of primitive memory faults. A primitive March test is defined for each primitive memory fault. We show that March tests that detect the specified memory array faults are composed of primitive March tests. A method to compact the March tests for the specified memory array faults is described. A set of examples to illustrate the approach is presented. Experimental results demonstrate the productivity gained using the proposed framework.
| Original language | English |
|---|---|
| Pages (from-to) | 845-857 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Very Large Scale Integration (VLSI) Systems |
| Volume | 9 |
| Issue number | 6 |
| DOIs | |
| State | Published - Dec 2001 |
Keywords
- Automatic test generation
- March tests
- Memory faults
- Transition sequence
Fingerprint
Dive into the research topics of 'Automatic generation and compaction of March tests for memory arrays'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver