By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
V. A. Vardanian ; Yerevan Branch, Virage Logic Int., Yerevan, Armenia ; Y. Zorian

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.

Published in:

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

Date of Conference: