Realization of K-Nearest-Matches search capability in fully-parallel associative memories
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 mu m CMOS technology with two-poly, three-metal layers, realizes k-nearest-matches Euclidean distance search and consumes 5.12 mm(2) of the chip area for 64 reference patterns each with 16 units of 5-bit.
k-nearest-matches associative memory pattern matching fully-parallel search