A Sharable Built-in Self-repair for Semiconductor Memories with 2-D Redundancy Scheme

Newer technologies like 90 nm and 65 nm bring with them new challenges: longer time to process maturity, higher defect densities and poorer yields. The quality of test and repair determines the design's final yield and profitability. With increasing amount of memory on the chip, the need for an efficient and fast converging perfect algorithm for memory repair is increasing becoming important. In this paper, a perfect algorithm is presented for standalone repairable memories as well as for situations where redundancy is shared between different memories. The proposed BISR is composed of Built-in self-test (BIST) and built-in redundancy analysis (BIRA) module. The BISR module has a low overhead - about 5.05 % of memories area for a typical automotive chip. The proper redundancy scheme and the proposed BIRA algorithm ensure a high repair rate for the SOC and shorter test times as well as optimized area and maximum performance.

[1]  Fabrizio Lombardi,et al.  New approaches for the repairs of memories with redundancy by row/column deletion for yield enhancement , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[3]  Yervant Zorian,et al.  An approach for evaluation of redundancy analysis algorithms , 2001, Proceedings 2001 IEEE International Workshop on Memory Technology, Design and Testing.

[4]  Nany Hasan,et al.  Minimum fault coverage in reconfigurable arrays , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[5]  Balwant Singh,et al.  A novel method for silicon configurable test flow and algorithms for testing, debugging and characterizing different types of embedded memories through a shared controller , 2004 .

[6]  Jin-Young Park,et al.  A BISR (built-in self-repair) circuit for embedded memory with multiple redundancies , 1999, ICVC '99. 6th International Conference on VLSI and CAD (Cat. No.99EX361).

[7]  Dilip K. Bhavsar.  An algorithm for row-column self-repair of RAMs and its implementation in the Alpha 21264 , 1999, International Test Conference 1999. Proceedings (IEEE Cat. No.99CH37034).

[8]  Oscar H. Ibarra,et al.  On Mapping Systolic Algorithms onto the Hypercube , 1990, IEEE Trans. Parallel Distributed Syst..

[9]  Chin-Long Wey,et al.  On the Repair of Redundant RAM's , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Sy-yen Kuo,et al.  Efficient Spare Allocation for Reconfigurable Arrays , 1987, IEEE Design & Test of Computers.

[11]  Sy-Yen Kuo,et al.  An efficient perfect algorithm for memory repair problems , 2004 .

[12]  Yervant Zorian,et al.  A methodology for design and evaluation of redundancy allocation algorithms , 2004, 22nd IEEE VLSI Test Symposium, 2004. Proceedings..

[13]  Junichi Hirase.  Yield increase of VLSI after redundancy-repairing , 2001, Proceedings 10th Asian Test Symposium.

[14]  W. Kent Fuchs,et al.  Efficient Spare Allocation for Reconfigurable Arrays , 1987 .