2006 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'06) A March-Based Algorithm for Location and Full Diagnosis of All Unlinked Static Faults Taipei, Taiwan August 02-August 04 ISBN: 0-7695-2572-5
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MTDT.2006.5
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.
Citation:
T.A. Gyonjyan, G. Harutunyan, V.A. Vardanian, "A March-Based Algorithm for Location and Full Diagnosis of All Unlinked Static Faults," mtdt, pp.9-14, 2006 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb