고장소자 집단화를 이용한 배열구조 메모리의 재구성 알고리듬

초록

Reconfiguration of a memory array using spare rows and columns has ben shown to be a useful technique to improve yield. But, when the spare rows and columns are restricted the repair problem is known to be NP-complet. In this paper, we propose the reconfiguration algorithm with the faulty-cell clustering, which removes rows and columns without any fault and condenses overlapped faulty cells into a cluster. The proposed algorithm provides an optimal solution in almost all cases and has a low time complextity compare to other algorithms. We show, through simulation, that the running time is smaller and the repair rate is higher than other algorithms.