Abstract
Fault-tolerant design for memory production is getting to play an important role in increasing the yield rate of manufacturing. To improve the reliability of memory manufacturing, there are many methods that have been proposed. One of the most used technologies is replacing the faulty cells with spare memory interleaved in the memory. Nowadays, the laser cutting technology improves the yield of memories because of the enhancement of the use of spare lines. However, the issue of choosing a cutting location significantly affects the utilization of spare lines. A bad cutting location can even render it useless. This thesis presents two algorithms to solve this problem. The first one is designed to seek out a good cutting location. It corrects some defects of previous algorithms and provides a better approach to find cutting candidates. In addition, because most heuristic solution-finding algorithms do not work properly under the condition of cutting memory, the second algorithm, called Modification of Most-Repair (MMR) is proposed to help make the decision as to whether or not a solution exists for the faulty pattern. The experimental results show that our proposed algorithms improve the reliability of memory manufacturing and the flexibility of spare lines.