Title :
Minimal March-Based Fault Location Algorithm with Partial Diagnosis for All Static Faults in Random Access Memories
Author :
Harutunyan, G. ; Vardanian, V.A. ; Zorian, Y.
Author_Institution :
Virage Logic, Yerevan
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
Keywords :
SRAM chips; circuit complexity; fault simulation; logic testing; March-based algorithm; bit-oriented static RAM; circuit complexity; coupling faults; memory words; minimal fault location algorithm; random access memories; unlinked static faults; Fault detection; Fault diagnosis; Fault location; Logic; Phase detection; Random access memory; Read-write memory; Redundancy; System-on-a-chip; Testing;
Conference_Titel :
Design and Diagnostics of Electronic Circuits and systems, 2006 IEEE
Conference_Location :
Prague
Print_ISBN :
1-4244-0185-2
DOI :
10.1109/DDECS.2006.1649632
