Dependable Embedded Memory for Intelligent Systems

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 234)


Contiguity along Gray codes and neighborhood among cluster faults are naturally connected by a novel hypercube-based address remapping unit. A novel memory repair architecture based on redundant hypercube is proposed, which mainly consists of a modified ternary CAM with an address concentrator. A modified ESPRESSO tool is developed for redundancy analysis on clustered-fault repairing optimization. Based on the redundancy analysis for a two-dimensional Gray-code-ordered memory array, every clustered fault with a width of no more than w and a length of no more than l can be repaired by a single hypercube-based spare row with a degree of \( \left( {\lceil \log 2(w - 1)\rceil +1} \right)\;\left( {\lceil \log 2(l - 1)\rceil + 1} \right) \). Finally 100% of repair rate can be obtained using only a few equivalent rows.


Memory repairing Redundancy analysis Remapping architecture Hypercube Cluster faults Fault tolerant 


  1. 1.
    Allan A et al (2009) Test and test equipment. In: 2009 technology roadmap for semiconductors, p 29, TST-6, 2009Google Scholar
  2. 2.
    Zorian Y, Shoukourian S (2003) Embedded-memory test and repair: infrastructure IP for SoC yield. IEEE De Test Comput 20(3):58–66CrossRefGoogle Scholar
  3. 3.
    Huang C-T, Wu C-F, Li J-F, Wu C-W (2003) Built-in redundancy analysis for memory yield improvement. IEEE Trans Reliab 52(4):386–399CrossRefGoogle Scholar
  4. 4.
    Wang L-T, Wu C-W, Wen X (2006) VLSI test principles and architectures. Elsevier, New York. ISBN 10:0-12-370597-5Google Scholar
  5. 5.
    Kawagoe T, Ohtani J, Niiro M. Ooishi T, Hamada M, Hidaka H (2000) A built-in self-repair analyzer (CRESTA) for embedded DRAMs. In: Proceedings of the IEEE international test conference, Atlantic City, Oct 2000, pp 567–574Google Scholar
  6. 6.
    Hamdioui S, van de Goor AJ (2002) Efficient tests for realistic faults in dual-port SRAMs. IEEE Trans Comput 51(5):460–473CrossRefGoogle Scholar
  7. 7.
    Lu S-K, Yang C-L, Hsiao Y-C, Wu C-W (2010) Efficient BISR techniques for embedded memories considering cluster faults. IEEE Trans VLSI 17(2):174–193Google Scholar
  8. 8.
    Shen YN, Park N, Lombardi F (1996) Spare cutting approaches for repairing memories.In: Proceedings of the IEEE international conference on computer design: VLSI in computers and processors, Austin, Oct 1996, pp 106–111Google Scholar
  9. 9.
    Lee M, Wu CW (2009) Method for repairing memory and system thereof.ROC Patent No. 200921690, disclosed on 16 May, 2009Google Scholar
  10. 10.
    Huang TC, Lu KY, Huang YC (2010) HYPERA: high-yield performance-efficient redundancy analysis. In: Proceedings of the IEEE 19th Asian test symposium, Shanghai, 1–4 Dec 2010, pp 231–235Google Scholar
  11. 11.
    Batcher KE (1968) Sorting networks and their applications. In: Proceedings of the AFIPS spring joint computer conference, Atlantic City, 1968, vol 32, pp 307–314Google Scholar
  12. 12.
    McCluskey EJ (1956) Minimization of Boolean functions. J Bell Syst Tech 35(5):1417–1444MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Graduate Institute of Integrated Circuit DesignNational Changhua University of EducationChanghuaTaiwan

Personalised recommendations