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

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.

[1]  Pinaki Mazumder,et al.  A new built-in self-repair approach to VLSI memory yield enhancement by using neural-type circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Hyeong-Seok Lim,et al.  Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements , 2006, IEEE Transactions on Parallel and Distributed Systems.

[3]  Jin-Fu Li,et al.  Built-in redundancy analysis for memory yield improvement , 2003, IEEE Trans. Reliab..

[4]  Hans-Joachim Wunderlich,et al.  An Integrated Built-In Test and Repair Approach for Memories with 2D Redundancy , 2007, 12th IEEE European Test Symposium (ETS'07).

[5]  Shuo-Yen Robert Li,et al.  A unified algebraic theory of sorting, routing, multicasting, and concentration networks , 2012, 2012 3rd IEEE International Conference on Network Infrastructure and Digital Content.

[6]  Jehoshua Bruck,et al.  Fault-tolerant cube graphs and coding theory , 1996, IEEE Trans. Inf. Theory.

[7]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[8]  Yervant Zorian,et al.  Embedded-memory test and repair: infrastructure IP for SoC yield , 2003, IEEE Design & Test of Computers.

[9]  Hideto Hidaka,et al.  A built-in self-repair analyzer (CRESTA) for embedded DRAMs , 2000, Proceedings International Test Conference 2000 (IEEE Cat. No.00CH37159).

[10]  Tsung-Chu Huang,et al.  HYPERA: High-Yield Performance-Efficient Redundancy Analysis , 2010, 2010 19th IEEE Asian Test Symposium.

[11]  Shyue-Kung Lu,et al.  Efficient BISR Techniques for Embedded Memories Considering Cluster Faults , 2010, 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007).

[12]  Hyeong-Seok Lim,et al.  Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements , 2006, IEEE Trans. Parallel Distributed Syst..

[13]  Said Hamdioui,et al.  Efficient Tests for Realistic Faults in Dual-Port SRAMs , 2002, IEEE Trans. Computers.

[14]  Sungho Kang,et al.  An Advanced BIRA using parallel sub-analyzers for embedded memories , 2009, 2009 International SoC Design Conference (ISOCC).

[15]  Mike Paterson,et al.  Improved sorting networks withO(logN) depth , 1990, Algorithmica.

[16]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[17]  Xiaoqing Wen,et al.  VLSI Test Principles and Architectures: Design for Testability (Systems on Silicon) , 2006 .

[18]  Fabrizio Lombardi,et al.  Spare cutting approaches for repairing memories , 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.

[19]  Miroslaw Malek,et al.  Topological testing , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.