Minimal March-Based Fault Location Algorithm with Partial Diagnosis for All Static Faults in Random Access Memories

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