A March-based fault location algorithm for static random access memories

A March-based fault location algorithm is proposed for repair of word-oriented static RAMs. A March algorithm of complexity 12N, N is the number of memory words, is defined for fault detection and partial diagnosis. A 3N or 4N March-like algorithm is used for location of the aggressor words of inter-word state, idempotent, inversion, write-disturb coupling faults (CF). Then another March-like algorithm of complexity 9(1 + logB), B is the number of bits in the word, is applied to locate the aggressor bit in the aggressor word. Finally, a March algorithm of complexity 6(1 + logB)N is used to detect and locate intra-word stuck-at, transition faults, as well as CFs. The proposed algorithm has higher fault location ability and lower time complexity than other known algorithms developed for fault location in SRAMs.