Skip to main content
SpringerLink
Log in

High-yield performance-efficient redundancy analysis for 2D memory

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

High-yield performance-efficient remapping architecture, repairing algorithms and redundancy analysis (HYPERA) are proposed for 2D memory. The proposed hypercube-based memory repair architecture consists of spare row-like subcubes with a modified ternary CAM with an address concentrator and a parallel sorter-like address concentrator. Generally, for an acceptable repair rate about 3% of spare subcubes and no more than 5% of hardware overhead are required. A modified Quine-McCluskey algorithm and the Essential Cube Pivoting algorithm are also developed for redundancy analysis. Almost 100% of repair rate can be obtained using only 32 equivalent rows under reasonable situations. Under less spare memory the repair rates of proposed approaches can be much higher than most results of previous work.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allan A, Barth R, Bennett H, et al. Test and test equipment. In: Technology Roadmap for Semiconductors—Executive Summary. 2009

  2. Zorian Y, Shoukourian S. Embedded-memory test and repair: infrastructure IP for SoC yield. IEEE Des Test Comput, 2003, 20: 58–66

    Article  Google Scholar 

  3. Huang C T, Wu C F, Li J F, et al. Built-in redundancy analysis for memory yield improvement. IEEE Trans Reliab, 2003, 52: 386–399

    Article  Google Scholar 

  4. Wang L T, Wu C W, Wen X. VLSI Test Principles and Architectures. New York: Elsevier, 2006

    Google Scholar 

  5. Mazumder P, Jih Y S. A new built-in self-repair approach to VLSI memory yield enhancement by using neural-type circuits. IEEE Trans CAD Integr Circ Syst, 1993, 12: 24–36

    Google Scholar 

  6. Kawagoe T, Ohtani J, Niiro M, et al. A built-in self-repair analyzer (CRESTA) for embedded DRAMs. In: Proceedings of IEEE International Test Conference, Atlantic City, USA, 2000. 567–574

  7. Jeong W, Han T, Kang S. An advanced BIRA using parallel sub-analyzers for embedded memories. In: Proceedings of IEEE International SoC Design Conference, Busan, Republic of Korea, 2009. 249–252

  8. Hamdioui S, van de Goor A J. Efficient tests for realistic faults in dual-port SRAMs. IEEE Trans Comput, 2002, 51: 460–473

    Article  Google Scholar 

  9. Shen Y N, Park N, Lombardi F. Spare cutting approaches for repairing memories. In: Proceedings of IEEE International Conference on Computer Design: VLSI in Computers and Processors, Austin, Texas, USA, 1996. 106–111

  10. Lu S K, Yang C L, Hsiao Y C, et al. Efficient BISR techniques for embedded memories considering cluster faults. IEEE Trans VLSI, 2010, 18: 184–193

    Article  Google Scholar 

  11. Lee M, Wu C W. Method for Repairing Memory and System Thereof. ROC Patent, 200921690, 2009-05-16

  12. Ohler P, Hellebrand S, Wunderlich H J. An integrated built-in test and repair approach for memories with 2D redundancy. In: Proceedings of 12th IEEE European Test Symposium, Convention Center, Freiburg, Germany, 2007. 91–96

  13. Huang T C. Memory Address Remapping Architecture and Repairing Method Thereof. ROC Patent, 099141225, 2010-11-30

  14. Huang T C, Lu K Y, Huang Y C. HYPERA: High-yield performance-efficient redundancy analysis. In: Proceedings of IEEE 19th Asian Test Symposium, Shanghai, China, 2010. 231–235

  15. Malek M, Mourad A, Pandya M. Topological testing. In: Proceedings of International Test Conference, Washington DC, USA, 1989. 103–110

  16. Park J H, Kim H C, Lim H S. Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. IEEE Trans Parallel Distr Syst, 2006, 17: 227–240

    Article  Google Scholar 

  17. Bruck J, Ho C T. Fault-tolerant cube graphs and coding theory. IEEE Trans Inf Theory, 1996, 42: 2217–2221

    Article  MATH  Google Scholar 

  18. Li S Y R. Unified algebraic theory of sorting, routing, multicasting, and concentration networks. IEEE Trans Commun, 2010, 58: 247–256

    Article  Google Scholar 

  19. Batcher K E. Sorting networks and their applications. In: Proceedings of AFIPS Spring Joint Computer Conference, Atlantic City, USA, 1968. 307–314

  20. Paterson M S. Improved sorting networks with O(logN) depth. Algorithmica, 1990, 5: 75–92

    Article  MathSciNet  MATH  Google Scholar 

  21. McCluskey J. Minimization of Boolean functions. J Bell Syst Tech, 1956, 35: 1417–1444

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics Engineering, National Changhua University of Education, Changhua, 50007, Taiwan, China

    Tsung-Chu Huang

Authors
  1. Tsung-Chu Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tsung-Chu Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, TC. High-yield performance-efficient redundancy analysis for 2D memory. Sci. China Inf. Sci. 54, 1663–1676 (2011). https://doi.org/10.1007/s11432-011-4357-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4357-x

Keywords

Search

Navigation