A Reconfiguration Algorithm for Memory Arrays Containing Faulty Spares (Special Section of Papers Selected from ITC-CSCC'99)

スポンサーリンク

概要

• 論文の詳細を見る

• Reconfiguration of memory arrays using spare lines is known to be an NP-complete problem. In this paper, we present an algorithm that reconfigures a memory array without any faults by using spare lines effectively even if they contain faulty elements. First, the reconfiguration problem is transformed to an equivalent covering problem in which faulty elements are covered by imaginary fault-free spare lines. Next, the covering problem is heuristically solved by using the Dulmange-Mendelsohn decomposition. The experiments for recently designed memory arrays show that the proposed algotithm is fast and practical.

• 一般社団法人電子情報通信学会の論文
• 2000-06-25

著者

• Handa Keiichi

  The Authors Are With Corporate Research & Development Center Toshiba Corporation

• HARUKI Kazuhito

  The authors are with Corporate Research & Development Center, Toshiba Corporation

• Haruki Kazuhito

  The Authors Are With Corporate Research & Development Center Toshiba Corporation

関連論文

• A Reconfiguration Algorithm for Memory Arrays Containing Faulty Spares (Special Section of Papers Selected from ITC-CSCC'99)

スポンサーリンク