An efficient algorithm for reconfiguring shared spare RRAM
Resource
Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings. IEEE International Conference on
Journal
IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004
Pages
-
Date Issued
2004-10
Date
2004-10
Author(s)
DOI
1063-6404
Abstract
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.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
01347975.pdf
Size
370.22 KB
Format
Adobe PDF
Checksum
(MD5):4ebb9c6e2aa6ffc6207c043ba153adec