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 μm CMOS technology with two-poly, three-metal layers, realizes k-nearest-matches Euclidean distance search and consumes 5.12 mm2 of the chip area for 64 reference patterns each with 16 units of 5-bit.

[1]  M. Ikeda,et al.  Time–domain minimum–distance detector and its application to low power coding scheme on chip interface , 1998, Proceedings of the 24th European Solid-State Circuits Conference.

[2]  Hans Jurgen Mattausch,et al.  Fully Parallel Nearest Manhattan-Distance-Search Memory With Large Reference-Pattern Number , 2002 .

[3]  T. Morimoto,et al.  A fully-parallel vector quantization processor for real-time motion picture compression , 1997, 1997 IEEE International Solids-State Circuits Conference. Digest of Technical Papers.

[4]  Hans Jurgen Mattausch,et al.  Compact associative-memory architecture with fully parallel search capability for the minimum Hamming distance , 2002, IEEE J. Solid State Circuits.

[5]  S. Nakahara,et al.  A digital circuit for a minimum distance search using an asynchronous bubble shift memory , 2004, 2004 IEEE International Solid-State Circuits Conference (IEEE Cat. No.04CH37519).

[6]  Tadashi Shibata,et al.  An image representation algorithm compatible with neural-associative-processor-based hardware recognition systems , 2003, IEEE Trans. Neural Networks.

[7]  Makoto Ikeda,et al.  A word-parallel digital associative engine with wide search range based on Manhattan distance , 2004, Proceedings of the IEEE 2004 Custom Integrated Circuits Conference (IEEE Cat. No.04CH37571).

[8]  H.J. Mattausch,et al.  Fully-parallel pattern-matching engine with dynamic adaptability to Hamming or Manhattan distance , 2002, 2002 Symposium on VLSI Circuits. Digest of Technical Papers (Cat. No.02CH37302).

[9]  Hans Jurgen Mattausch,et al.  Nearest-Euclidean-Distance Search Associative Memory with Fully Parallel Mixed Digital-Analog Match Circuitry , 2006 .