On a Method for Segmentation of Memory Instances with Row Redundancies

In this extended abstract, we proposed a method for “segmentation” of large memory instances with global redundant rows into memory segments with local redundant sub-rows allowing, thus, to split the memory into segments and the redundant rows - into local redundant sub-rows. A segment has its own local redundant sub-rows. Each redundant sub-row is a corresponding segment of a global redundant row. Thus, we increase significantly the number of redundant sub-rows and repair the faults/defects occurring in a memory segment with its local redundant sub-rows. For large memory instances, this approach will allow to increase the repair coverage of the memory instance with negligible hardware and time overheads. In general, a trade-off between fault/defect coverage and hardware/time overheads should be done.