Name
Title | ||
|---|---|---|
Minimal March-Based Fault Location Algorithm with Partial Diagnosis for All Static Faults in Random Access Memories |
Abstract | ||
|---|---|---|
A March-based fault location algorithm of minimum length is proposed for bit-oriented Static RAMs. A minimal March algorithm of complexity 18N, N is the number of memory words (bits), is defined in Phase 1 for detection of all unlinked static faults and partial diagnosis. March-like algorithms of complexity N+O(1) are proposed in Phase 2 to split the groups of faults with the same syndrome defined after Phase 1 into smaller subgroups. March-like algorithms of complexity 2N to 5N are used in Phase 3 for location of the aggressor bits of coupling faults (CF). The proposed minimal algorithm has 100% fault location ability with the least time complexity in Static RAMs. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/DDECS.2006.1649632 | DDECS |
Keywords | Field | DocType |
minimal march-based fault location,partial diagnosis,random access memories,static faults,fault detection,phase detection,time complexity,testing,circuit complexity,logic,system on a chip,redundancy | March algorithm,Coupling,Circuit complexity,Computer science,Logic testing,Parallel computing,Algorithm,Real-time computing,Time complexity,Random access | Conference |
ISSN | ISBN | Citations |
2334-3133 | 1-4244-0185-2 | 4 |
PageRank | References | Authors |
0.44 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Harutunyan | 1 | 37 | 4.42 |
| V. A. Vardanian | 2 | 38 | 4.54 |
| Y. Zorian | 3 | 499 | 47.97 |