Article

Minimum fault coverage in memory arrays: a fast algorithm and probabilistic analysis

Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (Impact Factor: 1.09). 07/1996; DOI: 10.1109/43.503937
Source: IEEE Xplore

ABSTRACT The problem of reconfiguring memory arrays using spare rows and
spare columns is known to be NP-complete and has received a great deal
of attention in recent years. For reason of cost effectiveness, it is
desirable in practice to find minimum reconfiguration solutions. While
numerous algorithms have been proposed to find minimum reconfiguration
solutions, they all run in worst case exponential time complexities. On
the other hand, existing heuristic algorithms with fast polynomial
running time cannot guarantee minimum solutions. This paper presents a
provably good heuristic algorithm for finding minimum reconfiguration
solution. Using random bipartite graphs, we prove that the
reconfiguration problem is almost always optimally solvable with our new
algorithm in polynomial time for all practical purposes. We also show
that our algorithm can be used to estimate the number of spare rows and
columns that are required to achieve a given percentage of yield for
RRAM's with known defect probabilities

0 Bookmarks
 · 
40 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper introduces a novel procedure of identifying better representatives of faulty cells in a memory map to help judge unrepairability and provide economic repair recommendation. These representative faulty cells, called leading elements (LE), are classified into four primary types based on their characteristics. Three specific pairs of initially identified LE are extracted for further operations, which are replacing certain LE with other better representatives and assigning the cross point faults between two certain LE as new LE. All steps of the procedure are analyzed in sequence with verifi-cation, clearly indicating that the identified LE represent both the more exact thresholds for judging unrepairability and usually the most economic repair solutions. Experi-ments on many example maps show that the procedure can be fast in searching 7% more LE and be applicable to accumulate data for redundancy planning afterwards.
    Journal of Advanced Chemical Engineering 2:49-54.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents an efficient algorithm for the reconfiguration of a two-dimensional degradable VLSI/WSI array with faulty processing elements (PEs). Unlike previous work, the proposed algorithm does not limit the number the physical rows related to the logical row to be constructed, in order to utilize as many fault-free PEs as possible to compensate faulty ones. Also, the row-exclusion process of the state-of-the-art is removed and thus the selection of the row for including into the target array is successfully avoided. The proposed flexible rerouting approach makes the state-of-the-art simplified and improved. Experimental results show that the proposed algorithm is able to generate a larger logical array with the harvest increasing up to 10%. Meanwhile, it runs faster up to 10 times than the existing algorithms cited in this paper.
    Physical and Failure Analysis of Integrated Circuits (IPFA), 2010 17th IEEE International Symposium on the; 01/2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper introduces a novel procedure of identifying better representatives of faulty cells in a memory map to help judge unrepairability and provide economic repair recommendation. These representative faulty cells, called leading elements (LE), are classified into four primary types based on their characteristics. Three specific pairs of initially identified LE are extracted for further operations, which are replacing certain LE with other better representatives and assigning the cross point faults between two certain LE as new LE. All steps of the procedure are analyzed in sequence with verifi- cation, clearly indicating that the identified LE represent both the more exact thresholds for judging unrepairability and usually the most economic repair solutions. Experi- ments on many example maps show that the procedure can be fast in searching 7% more LE and be applicable to accumulate data for redundancy planning afterwards.