By Topic

A March-Based Fault Location Algorithm with Partial and Full Diagnosis for All Simple 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.

In this paper, we propose a multiphase March-like algorithm for partial and full diagnosis of all simple static faults in static random access memories, as well as location of the position of the failed bit. In phase 1, a march-like algorithm of complexity 2N is proposed for partial diagnosis to differentiate between single-cell and two-cell faults. In phase 2, for two-cell faults, we propose a march-like algorithm of complexity 41N for location of the position of the failed bit. In Phase 3, we used a march-like algorithm of a constant complexity for full diagnosis of all simple static faults.

Published in:

Design and Diagnostics of Electronic Circuits and Systems, 2007. DDECS '07. IEEE

Date of Conference:

11-13 April 2007