The search functionality is under construction.
The search functionality is under construction.

A Reconfiguration Algorithm for Memory Arrays Containing Faulty Spares

Keiichi HANDA, Kazuhito HARUKI

  • Full Text Views

    0

  • Cite this

Summary :

Reconfiguration of memory arrays using spare lines is known to be an NP-complete problem. In this paper, we present an algorithm that reconfigures a memory array without any faults by using spare lines effectively even if they contain faulty elements. First, the reconfiguration problem is transformed to an equivalent covering problem in which faulty elements are covered by imaginary fault-free spare lines. Next, the covering problem is heuristically solved by using the Dulmange-Mendelsohn decomposition. The experiments for recently designed memory arrays show that the proposed algorithm is fast and practical.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E83-A No.6 pp.1123-1130
Publication Date
2000/06/25
Publicized
Online ISSN
DOI
Type of Manuscript
Special Section PAPER (Special Section of Papers Selected from 1999 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC'99))
Category

Authors

Keyword