By Topic

Minimal March-Based Fault Location Algorithm with Partial Diagnosis for All Static Faults in 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
$31 $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)
Harutunyan, G. ; Virage Logic, Yerevan ; Vardanian, V.A. ; Zorian, Y.

A March-based fault location algorithm of minimum length is proposed for bit-oriented static RAMs. A minimal March algorithm of complexity 18N, N is the number of memory words (bits), is defined in phase 1 for detection of all unlinked static faults and partial diagnosis. March-like algorithms of complexity N+O(1) are proposed in phase 2 to split the groups of faults with the same syndrome defined after phase 1 into smaller subgroups. March-like algorithms of complexity 2N to 5N are used in phase 3 for location of the aggressor bits of coupling faults (CF). The proposed minimal algorithm has 100% fault location ability with the least time complexity in static RAMs

Published in:

Design and Diagnostics of Electronic Circuits and systems, 2006 IEEE

Date of Conference:

18-21 April 2006