DocumentCode
3092723
Title
Efficient BISR Techniques for Embedded Memories Considering Cluster Faults
Author
Yang, Chun-Lin ; Hsiao, Yuang-Cheng ; Lu, Shyue-Kung
Author_Institution
FuJen Catholic Univ., Taipei
fYear
2007
fDate
17-19 Dec. 2007
Firstpage
224
Lastpage
231
Abstract
Instead of the traditional spare row/column redundancy architectures, block-based redundancy architectures are proposed in this paper. The redundant rows/columns are divided into row/column blocks. Therefore, the repair of faulty memory cells can be performed at the row/column block level. Moreover, the redundant row/column blocks can be used to replace faulty cells anywhere in the memory array. This global characteristic is helpful for repairing cluster faults. The proposed redundancy architecture can be easily integrated with the embedded memory cores. Based on the proposed global redundancy architecture, a heuristic MESP (modified essential spare pivoting) algorithm suitable for built-in implementation is also proposed. According to experimental results, the area overhead for implementing the MESP algorithm is almost negligible. Due to the efficient usage of the redundancy, the manufacturing yield, repair rate, and reliability can all be improved significantly.
Keywords
memory architecture; block-based redundancy architectures; cluster faults; embedded memory cores; global redundancy architecture; memory array; modified essential spare pivoting algorithm; redundant row-columns; spare row-column redundancy architectures; Bipartite graph; Built-in self-test; Circuit faults; Clustering algorithms; Computer architecture; Embedded computing; Hardware; Manufacturing; Redundancy; System-on-a-chip;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Computing, 2007. PRDC 2007. 13th Pacific Rim International Symposium on
Conference_Location
Melbourne, Qld.
Print_ISBN
0-7695-3054-0
Type
conf
DOI
10.1109/PRDC.2007.58
Filename
4459663
Link To Document