Identify unrepairability to speed-up spare allocation for repairing memories

In this paper, we discuss some strategies for identifying unrepairable memories, and from that to introduce a novel theorem that can make more precise identification. A new algorithm for searching repair solutions is also proposed, which characterizes the rows, and columns of defective memory cells with revised effective coefficients. We have simulated it on many generated example maps, and compared it with the previous algorithms to verify its efficiency. It's combined with those arranged strategies of judging unrepairability to generate a complete flow. The complete algorithm has also been run on many examples with various memory sizes, defect numbers, and distribution types. The simulation results further show that identifying unrepairability in advance can help the reconfiguration procedure run much faster than searching solutions directly.