A March-based algorithm for location and full diagnosis of all unlinked static faults

Abstract

A new March-based fault location and full diagnosis algorithm is proposed for word-oriented static RAMs. A March algorithm of complexity 31N, N is the number of memory words, is defined for fault detection and partial diagnosis. Then March-like algorithms of complexity 3N to 5N are used to locate the aggressor words of coupling faults (CF) and achieve full diagnosis for all unlinked static CFs. Another March-like algorithm of complexity 16logB+18, B is the number of bits in the word, is applied to locate the aggressor bit in the aggressor word. A software tool is developed for automated generation of fault syndromes for detection, partial and full diagnosis of all static unlinked faults