Realization of K-Nearest-Matches Search Capability in Fully-Parallel Associative Memories

• ABEDIN Md. Anwarul

  Research Center for Nanodevices and Systems, Hiroshima University

• TANAKA Yuki

  Research Center for Nanodevices and Systems, Hiroshima University

• AHMADI Ali

  Research Center for Nanodevices and Systems, Hiroshima University

• SAKAKIBARA Shogo

  Research Center for Nanodevices and Systems, Hiroshima University

• KOIDE Tetsushi

  Research Center for Nanodevices and Systems, Hiroshima University

• MATTAUSCH Hans Jurgen

  Research Center for Nanodevices and Systems, Hiroshima University

抄録

The realization of k-nearest-matches search capability in fully-parallel mixed digital-analog associative memories by a sequential autonomous search mode is reported. The proposed concept and circuit implementation can be applied with all types of distance measures such as Hamming, Manhattan or Euclidean distance search, and the k value can be freely selected during operation. A test chip for concept verification has been designed in 0.35μm CMOS technology with two-poly, three-metal layers, realizes k-nearest-matches Euclidean distance search and consumes 5.12mm^2 of the chip area for 64 reference patterns each with 16 units of 5-bit.

収録刊行物

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

  IEICE transactions on fundamentals of electronics, communications and computer sciences 90 (6), 1240-1243, 2007-06-01

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

キーワード

• associative memory
• pattern matching
• fully-parallel search
• k-nearest-matches

詳細情報

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