Minimal March Test Algorithm for Detection of Linked Static Faults in Random Access Memories

Abstract

In this paper, a new notion of 2-composite static faults covering all unlinked and (realistic) linked static faults is introduced. We have introduced 120 new linked fault primitives missing in the paper by Hamdioui et al (IEEE TCAD 2004), thus extending the universe of linked fault primitives known before by 25%. A march test algorithm of length 23N (N - number of memory words) for detection of linked static faults in random access memories is proposed. It reduces the length of a previously known algorithm (Hamdioui et al., IEEE TCAD 2004) by 18N. We proved the proposed test is of minimum length.