Previously, a minimal algorithm of length 70N, N is the number of memory bits, was proposed for a subclass of dynamic faults. In this paper, a March-based fault location and full diagnosis algorithm of complexity 88N+29 is proposed for the same subclass of dynamic faults in bit-oriented SRAMs.
Index Terms:
fault, detection, diagnosis, localization, march test
Citation:
Gurgen Harutunyan, Valery Vardanian, Yervant Zorian, "An Efficient March-Based Three-Phase Fault Location and Full Diagnosis Algorithm for Realistic Two-Operation Dynamic Faults in Random Access Memories," vts, pp.95-100, 26th IEEE VLSI Test Symposium (vts 2008), 2008