Abstract
A novel memory repair architecture based on redundant hypercube is proposed, which mainly consists of a modified ternary CAM with an address bubble-shifter. Generally for an acceptable repair rate about 3% of spare subcubes and no more than 5% of hardware overhead are required. A modified Quine-McCluskey algorithm and the Essential Cube Pivoting algorithm are also developed for redundancy analysis. Almost 100% of repair rate can be obtained using only 32 equivalent rows under reasonable situations. Under less spare memory the repair rates of proposed approaches can be much higher than most results of previous work.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2010 19th IEEE Asian Test Symposium, ATS 2010 |
| Pages | 231-236 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 2010 Dec 1 |
| Event | 2010 19th IEEE Asian Test Symposium, ATS 2010 - Shanghai, China Duration: 2010 Dec 1 → 2010 Dec 4 |
Publication series
| Name | Proceedings of the Asian Test Symposium |
|---|---|
| ISSN (Print) | 1081-7735 |
Other
| Other | 2010 19th IEEE Asian Test Symposium, ATS 2010 |
|---|---|
| Country | China |
| City | Shanghai |
| Period | 10-12-01 → 10-12-04 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
Cite this
}
HYPERA : High-yield performance-efficient redundancy analysis. / Huang, Tsung Chu; Lu, Kuei Yeh; Huang, Yen Chieh.
Proceedings - 2010 19th IEEE Asian Test Symposium, ATS 2010. 2010. p. 231-236 5692252 (Proceedings of the Asian Test Symposium).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - HYPERA
T2 - High-yield performance-efficient redundancy analysis
AU - Huang, Tsung Chu
AU - Lu, Kuei Yeh
AU - Huang, Yen Chieh
PY - 2010/12/1
Y1 - 2010/12/1
N2 - A novel memory repair architecture based on redundant hypercube is proposed, which mainly consists of a modified ternary CAM with an address bubble-shifter. Generally for an acceptable repair rate about 3% of spare subcubes and no more than 5% of hardware overhead are required. A modified Quine-McCluskey algorithm and the Essential Cube Pivoting algorithm are also developed for redundancy analysis. Almost 100% of repair rate can be obtained using only 32 equivalent rows under reasonable situations. Under less spare memory the repair rates of proposed approaches can be much higher than most results of previous work.
AB - A novel memory repair architecture based on redundant hypercube is proposed, which mainly consists of a modified ternary CAM with an address bubble-shifter. Generally for an acceptable repair rate about 3% of spare subcubes and no more than 5% of hardware overhead are required. A modified Quine-McCluskey algorithm and the Essential Cube Pivoting algorithm are also developed for redundancy analysis. Almost 100% of repair rate can be obtained using only 32 equivalent rows under reasonable situations. Under less spare memory the repair rates of proposed approaches can be much higher than most results of previous work.
UR - http://www.scopus.com/inward/record.url?scp=79951646506&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79951646506&partnerID=8YFLogxK
U2 - 10.1109/ATS.2010.48
DO - 10.1109/ATS.2010.48
M3 - Conference contribution
AN - SCOPUS:79951646506
SN - 9780769542485
T3 - Proceedings of the Asian Test Symposium
SP - 231
EP - 236
BT - Proceedings - 2010 19th IEEE Asian Test Symposium, ATS 2010
ER -