An efficient algorithm for reconfiguring shared spare RRAM

Hung Yau Lin; Hong Zu Chou; Fu Min Yeh; Ing Yi Chen; Sy Yen Kuo

doi:10.1109/ICCD.2004.1347975

An efficient algorithm for reconfiguring shared spare RRAM

Hung Yau Lin^*, Hong Zu Chou, Fu Min Yeh, Ing Yi Chen, Sy Yen Kuo

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English
Title of host publication	Proceedings - IEEE International Conference on Computer Design
Subtitle of host publication	VLSI in Computers and Processors, ICCD 2004
Pages	544-546
Number of pages	3
DOIs	https://doi.org/10.1109/ICCD.2004.1347975
State	Published - 2004
Externally published	Yes
Event	Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004 - San Jose, CA, United States Duration: 11 10 2004 → 13 10 2004

Publication series

Name	Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors
ISSN (Print)	1063-6404

Conference

Conference	Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004
Country/Territory	United States
City	San Jose, CA
Period	11/10/04 → 13/10/04

Access to Document

10.1109/ICCD.2004.1347975

Cite this

Lin, H. Y., Chou, H. Z., Yeh, F. M., Chen, I. Y., & Kuo, S. Y. (2004). An efficient algorithm for reconfiguring shared spare RRAM. In Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004 (pp. 544-546). (Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors). https://doi.org/10.1109/ICCD.2004.1347975

@inproceedings{185748e551bc404aa2068025718ae7fd,

title = "An efficient algorithm for reconfiguring shared spare RRAM",

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.",

author = "Lin, \{Hung Yau\} and Chou, \{Hong Zu\} and Yeh, \{Fu Min\} and Chen, \{Ing Yi\} and Kuo, \{Sy Yen\}",

year = "2004",

doi = "10.1109/ICCD.2004.1347975",

language = "英语",

isbn = "0769522319",

series = "Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors",

pages = "544--546",

booktitle = "Proceedings - IEEE International Conference on Computer Design",

note = "Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004 ; Conference date: 11-10-2004 Through 13-10-2004",

}

Lin, HY, Chou, HZ, Yeh, FM, Chen, IY & Kuo, SY 2004, An efficient algorithm for reconfiguring shared spare RRAM. in Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004. Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 544-546, Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004, San Jose, CA, United States, 11/10/04. https://doi.org/10.1109/ICCD.2004.1347975

An efficient algorithm for reconfiguring shared spare RRAM. / Lin, Hung Yau; Chou, Hong Zu; Yeh, Fu Min et al.
Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004. 2004. p. 544-546 (Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An efficient algorithm for reconfiguring shared spare RRAM

AU - Lin, Hung Yau

AU - Chou, Hong Zu

AU - Yeh, Fu Min

AU - Chen, Ing Yi

AU - Kuo, Sy Yen

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/17644402506

U2 - 10.1109/ICCD.2004.1347975

DO - 10.1109/ICCD.2004.1347975

M3 - 会议稿件

AN - SCOPUS:17644402506

SN - 0769522319

T3 - Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

SP - 544

EP - 546

BT - Proceedings - IEEE International Conference on Computer Design

T2 - Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004

Y2 - 11 October 2004 through 13 October 2004

ER -

An efficient algorithm for reconfiguring shared spare RRAM

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this