By Topic

A March-based algorithm for location and full diagnosis of all unlinked static faults

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

3 Author(s)

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

Published in:

Memory Technology, Design, and Testing, 2006. MTDT '06. 2006 IEEE International Workshop on

Date of Conference:

2-4 Aug. 2006