An efficient algorithm for reconfiguring shared spare RRAM

Redundant rows and columns have been used for years to improve the yield of DRAM fabrication. However, finding a memory repair solution has been proved to be an NP-complete problem. This paper presents an efficient algorithm, which is able to find a repair solution for shared spare memory arrays if a solution exists. The remarkable performance of the algorithm can be demonstrated by experimental results.

[1]  W. Kent Fuchs,et al.  Efficient Spare Allocation for Reconfigurable Arrays , 1987 .

[2]  Hon Wai Leong,et al.  Minimum fault coverage in memory arrays: a fast algorithm and probabilistic analysis , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  W. Kent Fuchs,et al.  Efficient Spare Allocation in Reconfigurable Arrays , 1986, 23rd ACM/IEEE Design Automation Conference.

[4]  Timothy S. Newman,et al.  Performance Comparison , 2021, Satellite Formation Flying.

[5]  Hon Wai Leong,et al.  A New Class of Efficient Algorithms for Reconfiguration of Memory Arrays , 1996, IEEE Trans. Computers.

[6]  W. Kent Fuchs,et al.  Probabilistic analysis and algorithms for reconfiguration of memory arrays , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  John R. Day.  A Fault-Driven, Comprehensive Redundancy Algorithm for Repair of Dynamic RAMs , 1984, ITC.

[8]  John Day.  A Fault-Driven, Comprehensive Redundancy Algorithm , 1985, IEEE Design & Test of Computers.

[9]  Fabrizio Lombardi,et al.  New approaches for the repairs of memories with redundancy by row/column deletion for yield enhancement , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[11]  Andrzej Pelc,et al.  A Clustered Failure Model for the Memory Array Reconfiguration Problem , 1993, IEEE Trans. Computers.

[12]  Fabrizio Lombardi,et al.  Spare cutting approaches for repairing memories , 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.

[13]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[14]  Nany Hasan,et al.  Minimum fault coverage in reconfigurable arrays , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[15]  D. M. Blough.  Performance evaluation of a reconfiguration-algorithm for memory arrays containing clustered faults , 1996, IEEE Trans. Reliab..