An advanced BIRA using parallel sub-analyzers for embedded memories

Woosik Jeong, Taewoo Han, Sungho Kang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Although many built-in redundancy analysis (BIRA) algorithms which use parallel sub-analyzers have optimal repair rate and a fast analysis speed, they suffer from a large area overhead. To reduce the area overhead, a new BIRA analyzer is proposed which reconstructs the content addressable memory (CAM) structure of the parallel sub-analyzers like a binary searching tree. Experimental results show that the proposed BIRA analyzer achieves 25% reduction of area overhead compared with previous BIRA using parallel sub-analyzers in case an embedded memory has 4 spares with optimal repair rate and zero analysis speed.

Original languageEnglish
Title of host publication2009 International SoC Design Conference, ISOCC 2009
Pages249-252
Number of pages4
DOIs
Publication statusPublished - 2009 Dec 1
Event2009 International SoC Design Conference, ISOCC 2009 - Busan, Korea, Republic of
Duration: 2009 Nov 222009 Nov 24

Other

Other2009 International SoC Design Conference, ISOCC 2009
CountryKorea, Republic of
CityBusan
Period09/11/2209/11/24

Fingerprint

Redundancy
Data storage equipment
Repair
Associative storage

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Jeong, W., Han, T., & Kang, S. (2009). An advanced BIRA using parallel sub-analyzers for embedded memories. In 2009 International SoC Design Conference, ISOCC 2009 (pp. 249-252). [5423810] https://doi.org/10.1109/SOCDC.2009.5423810
Jeong, Woosik ; Han, Taewoo ; Kang, Sungho. / An advanced BIRA using parallel sub-analyzers for embedded memories. 2009 International SoC Design Conference, ISOCC 2009. 2009. pp. 249-252
@inproceedings{d2e28b9f1081489faef167bfc0e0a9f1,
title = "An advanced BIRA using parallel sub-analyzers for embedded memories",
abstract = "Although many built-in redundancy analysis (BIRA) algorithms which use parallel sub-analyzers have optimal repair rate and a fast analysis speed, they suffer from a large area overhead. To reduce the area overhead, a new BIRA analyzer is proposed which reconstructs the content addressable memory (CAM) structure of the parallel sub-analyzers like a binary searching tree. Experimental results show that the proposed BIRA analyzer achieves 25{\%} reduction of area overhead compared with previous BIRA using parallel sub-analyzers in case an embedded memory has 4 spares with optimal repair rate and zero analysis speed.",
author = "Woosik Jeong and Taewoo Han and Sungho Kang",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/SOCDC.2009.5423810",
language = "English",
isbn = "9781424450343",
pages = "249--252",
booktitle = "2009 International SoC Design Conference, ISOCC 2009",

}

Jeong, W, Han, T & Kang, S 2009, An advanced BIRA using parallel sub-analyzers for embedded memories. in 2009 International SoC Design Conference, ISOCC 2009., 5423810, pp. 249-252, 2009 International SoC Design Conference, ISOCC 2009, Busan, Korea, Republic of, 09/11/22. https://doi.org/10.1109/SOCDC.2009.5423810

An advanced BIRA using parallel sub-analyzers for embedded memories. / Jeong, Woosik; Han, Taewoo; Kang, Sungho.

2009 International SoC Design Conference, ISOCC 2009. 2009. p. 249-252 5423810.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An advanced BIRA using parallel sub-analyzers for embedded memories

AU - Jeong, Woosik

AU - Han, Taewoo

AU - Kang, Sungho

PY - 2009/12/1

Y1 - 2009/12/1

N2 - Although many built-in redundancy analysis (BIRA) algorithms which use parallel sub-analyzers have optimal repair rate and a fast analysis speed, they suffer from a large area overhead. To reduce the area overhead, a new BIRA analyzer is proposed which reconstructs the content addressable memory (CAM) structure of the parallel sub-analyzers like a binary searching tree. Experimental results show that the proposed BIRA analyzer achieves 25% reduction of area overhead compared with previous BIRA using parallel sub-analyzers in case an embedded memory has 4 spares with optimal repair rate and zero analysis speed.

AB - Although many built-in redundancy analysis (BIRA) algorithms which use parallel sub-analyzers have optimal repair rate and a fast analysis speed, they suffer from a large area overhead. To reduce the area overhead, a new BIRA analyzer is proposed which reconstructs the content addressable memory (CAM) structure of the parallel sub-analyzers like a binary searching tree. Experimental results show that the proposed BIRA analyzer achieves 25% reduction of area overhead compared with previous BIRA using parallel sub-analyzers in case an embedded memory has 4 spares with optimal repair rate and zero analysis speed.

UR - http://www.scopus.com/inward/record.url?scp=77951431704&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951431704&partnerID=8YFLogxK

U2 - 10.1109/SOCDC.2009.5423810

DO - 10.1109/SOCDC.2009.5423810

M3 - Conference contribution

AN - SCOPUS:77951431704

SN - 9781424450343

SP - 249

EP - 252

BT - 2009 International SoC Design Conference, ISOCC 2009

ER -

Jeong W, Han T, Kang S. An advanced BIRA using parallel sub-analyzers for embedded memories. In 2009 International SoC Design Conference, ISOCC 2009. 2009. p. 249-252. 5423810 https://doi.org/10.1109/SOCDC.2009.5423810