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

Hyungjun Cho, Wooheon Kang, Sungho Kang

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


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
Issue number4
Publication statusPublished - 2010 Aug

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'A Built-in redundancy analysis with a minimized binary search tree'. Together they form a unique fingerprint.

Cite this