DocumentCode
1664241
Title
An efficient algorithm for reconfiguring shared spare RRAM
Author
Lin, Hung-Yau ; Chou, Hong-Zu ; Yeh, Fu-Min ; Chen, Ing-Yi ; Kuo, Sy-Yen
Author_Institution
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fYear
2004
Firstpage
544
Lastpage
546
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.
Keywords
decision diagrams; random-access storage; shared memory systems; binary decision diagrams; redundant RAM; shared spare RRAM; shared spare memory arrays; Binary decision diagrams; Boolean functions; Computer science; Data structures; Fabrication; Heuristic algorithms; NP-complete problem; Random access memory; Read-write memory; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings. IEEE International Conference on
ISSN
1063-6404
Print_ISBN
0-7695-2231-9
Type
conf
DOI
10.1109/ICCD.2004.1347975
Filename
1347975
Link To Document