ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

A Built-In Redundancy Analysis with a Minimized Binary Search Tree

  • Cho, Hyung-Jun (Department of Electrical and Electronic Engineering, Yonsei University) ;
  • Kang, Woo-Heon (Department of Electrical and Electronic Engineering, Yonsei University) ;
  • Kang, Sung-Ho (Department of Electrical and Electronic Engineering, Yonsei University)
  • Received : 2010.01.29
  • Accepted : 2010.04.05
  • Published : 2010.08.30
Download PDF
⟨ Previous Next ⟩

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 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.

Keywords

References

  1. Y. Park et al., "An Effective Test and Diagnosis Algorithm for Dual-Port Memories," ETRI J., vol. 30, no. 4, Aug. 2008, pp. 555-564. https://doi.org/10.4218/etrij.08.0107.0348
  2. T. Kawagoe et al., "A Built-in Self-Repair Analyzer (CRESTA) for Embedded DRAMs," Proc. Int. Test Conf. (ITC), 2000, pp. 567-574.
  3. P. Ohler, S. Hellebrand, and H.J. Wunderlich, "An Integrated Built-In Test and Repair Approach for Memories with 2D Redundancy," Proc. European Test Symp. (ETS), May. 2007, pp. 91-96.
  4. C.T. Huang et al., "Built-In Redundancy Analysis for Memory Yield Improvement," IEEE Trans. Reliab., vol. 52, Dec. 2003, pp. 386-399. https://doi.org/10.1109/TR.2003.821925

Cited by

  1. Yield Enhancement Techniques for 3D Memories by Redundancy Sharing among All Layers vol.34, pp.3, 2010, https://doi.org/10.4218/etrij.12.0111.0643
  2. A Fast Redundancy Analysis Algorithm in ATE for Repairing Faulty Memories vol.34, pp.3, 2010, https://doi.org/10.4218/etrij.12.0211.0378
  3. 비트맵 메모리 공유를 통해 면적을 크게 줄인 효율적인 수리 방법 vol.49, pp.9, 2012, https://doi.org/10.5573/ieek.2012.49.9.237
  4. A Very Efficient Redundancy Analysis Method Using Fault Grouping vol.35, pp.3, 2010, https://doi.org/10.4218/etrij.13.0112.0467
  5. A BIRA for Memories With an Optimal Repair Rate Using Spare Memories for Area Reduction vol.22, pp.11, 2010, https://doi.org/10.1109/tvlsi.2013.2288637
  6. A Survey of Repair Analysis Algorithms for Memories vol.49, pp.3, 2010, https://doi.org/10.1145/2971481
  7. Hardware-Efficient Built-In Redundancy Analysis for Memory With Various Spares vol.25, pp.3, 2010, https://doi.org/10.1109/tvlsi.2016.2606499
  8. BIRA With Optimal Repair Rate Using Fault-Free Memory Region for Area Reduction vol.64, pp.12, 2010, https://doi.org/10.1109/tcsi.2017.2750702
  9. Fault Group Pattern Matching With Efficient Early Termination for High-Speed Redundancy Analysis vol.37, pp.7, 2010, https://doi.org/10.1109/tcad.2017.2760505
  10. CMOS true-time delay IC for wideband phased-array antenna vol.40, pp.6, 2018, https://doi.org/10.4218/etrij.2018-0113
  11. Optimized counting threshold Built-in redundancy analysis for memories vol.81, pp.None, 2021, https://doi.org/10.1016/j.micpro.2020.103682