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

Search this article

Abstract

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.

Journal

References(10)*help

See more

Details

  • CRID
    1570854177532552960
  • NII Article ID
    110007519195
  • NII Book ID
    AA10826239
  • ISSN
    09168508
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top