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

Author

Vardanian, V.A. ; Zorian, Y.

Author_Institution

Yerevan Branch, Virage Logic Int., Yerevan, Armenia

fYear

2002

fDate

2002

Firstpage

256

Lastpage

261

Abstract

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.

Keywords

SRAM chips; automatic testing; computational complexity; fault location; integrated circuit testing; logic testing; March-based fault location algorithm; aggressor bit; aggressor words; fault detection; inter-word state; intra-word transition faults; partial diagnosis; static RAMs; stuck-at transition faults; time complexity; word-oriented SRAMs; write-disturb coupling faults; Fault detection; Fault diagnosis; Fault location; Logic; Manufacturing; Random access memory; Read-write memory; Redundancy; SRAM chips; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

On-Line Testing Workshop, 2002. Proceedings of the Eighth IEEE International

Print_ISBN

0-7695-1641-6

Type

conf

DOI

10.1109/OLT.2002.1030228

Filename

1030228