A Reconfiguration Algorithm for Memory Arrays Containing Faulty Spares

• HANDA Keiichi

  Corporate Research & Development Center, Toshiba Corporation

• HARUKI Kazuhito

  Corporate Research & Development Center, Toshiba Corporation

抄録

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.

収録刊行物

• IEICE transactions on fundamentals of electronics, communications and computer sciences

  IEICE transactions on fundamentals of electronics, communications and computer sciences 83 (6), 1123-1130, 2000-06-25

  一般社団法人電子情報通信学会

キーワード

• memory reconfiguration
• redundant memory
• fault covering
• vertex cover
• Dulmage-Mendelsohn decomposition

詳細情報

• CRID: 1570291227426551680
• NII論文ID: 110003208633
• NII書誌ID: AA10826239
• ISSN: 09168508
• 本文言語コード: en
• データソース種別:
  • CiNii Articles