A Built-in redundancy analysis with a minimized binary search tree

Hyungjun Cho, Wooheon Kang, Sungho Kang

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

With the growth of memory capacity and density, memory testing and repair with the goal of yield improvement have become more important. Therefore, the development of high efficiency redundancy analysis algorithms is essential to improve yield rate. In this letter, we propose an improved builtin redundancy analysis (BIRA) algorithm with a minimized binary search tree made by simple calculations. The tree is constructed until finding a solution from the most probable branch. This greatly reduces the search spaces for a solution. The proposed BIRA algorithm results in 100% repair efficiency and fast redundancy analysis.

Original languageEnglish
Pages (from-to)638-641
Number of pages4
JournalETRI Journal
Volume32
Issue number4
DOIs
Publication statusPublished - 2010 Aug 1

Fingerprint

Redundancy
Repair
Data storage equipment
Trees (mathematics)
Testing

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Cho, Hyungjun ; Kang, Wooheon ; Kang, Sungho. / A Built-in redundancy analysis with a minimized binary search tree. In: ETRI Journal. 2010 ; Vol. 32, No. 4. pp. 638-641.
@article{13e715f0801847a2b9d394df1a1ee7ae,
title = "A Built-in redundancy analysis with a minimized binary search tree",
abstract = "With the growth of memory capacity and density, memory testing and repair with the goal of yield improvement have become more important. Therefore, the development of high efficiency redundancy analysis algorithms is essential to improve yield rate. In this letter, we propose an improved builtin redundancy analysis (BIRA) algorithm with a minimized binary search tree made by simple calculations. The tree is constructed until finding a solution from the most probable branch. This greatly reduces the search spaces for a solution. The proposed BIRA algorithm results in 100{\%} repair efficiency and fast redundancy analysis.",
author = "Hyungjun Cho and Wooheon Kang and Sungho Kang",
year = "2010",
month = "8",
day = "1",
doi = "10.4218/etrij.10.0210.0032",
language = "English",
volume = "32",
pages = "638--641",
journal = "ETRI Journal",
issn = "1225-6463",
publisher = "ETRI",
number = "4",

}

A Built-in redundancy analysis with a minimized binary search tree. / Cho, Hyungjun; Kang, Wooheon; Kang, Sungho.

In: ETRI Journal, Vol. 32, No. 4, 01.08.2010, p. 638-641.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A Built-in redundancy analysis with a minimized binary search tree

AU - Cho, Hyungjun

AU - Kang, Wooheon

AU - Kang, Sungho

PY - 2010/8/1

Y1 - 2010/8/1

N2 - With the growth of memory capacity and density, memory testing and repair with the goal of yield improvement have become more important. Therefore, the development of high efficiency redundancy analysis algorithms is essential to improve yield rate. In this letter, we propose an improved builtin redundancy analysis (BIRA) algorithm with a minimized binary search tree made by simple calculations. The tree is constructed until finding a solution from the most probable branch. This greatly reduces the search spaces for a solution. The proposed BIRA algorithm results in 100% repair efficiency and fast redundancy analysis.

AB - With the growth of memory capacity and density, memory testing and repair with the goal of yield improvement have become more important. Therefore, the development of high efficiency redundancy analysis algorithms is essential to improve yield rate. In this letter, we propose an improved builtin redundancy analysis (BIRA) algorithm with a minimized binary search tree made by simple calculations. The tree is constructed until finding a solution from the most probable branch. This greatly reduces the search spaces for a solution. The proposed BIRA algorithm results in 100% repair efficiency and fast redundancy analysis.

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

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

U2 - 10.4218/etrij.10.0210.0032

DO - 10.4218/etrij.10.0210.0032

M3 - Article

AN - SCOPUS:77955436459

VL - 32

SP - 638

EP - 641

JO - ETRI Journal

JF - ETRI Journal

SN - 1225-6463

IS - 4

ER -