Open AccessA Built‐In Redundancy Analysis with a Minimized Binary Search Tree
Author(s) -
Cho Hyungjun,
Kang Wooheon,
Kang Sungho
Publication year - 2010
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.10.0210.0032
Subject(s) - redundancy (engineering) , computer science , binary tree , binary number , ternary search tree , tree (set theory) , binary search tree , algorithm , theoretical computer science , tree structure , mathematics , interval tree , arithmetic , mathematical analysis , operating system
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 built‐in 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.