Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Realization of K-Nearest-Matches Search Capability in Fully-Parallel Associative Memories Md. Anwarul ABEDIN Yuki TANAKA Ali AHMADI Shogo SAKAKIBARA Tetsushi KOIDE Hans Jurgen MATTAUSCH Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E90-A No.6 pp.1240-1243 Publication Date: 2007/06/01 Online ISSN: 1745-1337 DOI: 10.1093/ietfec/e90-a.6.1240 Print ISSN: 0916-8508 Type of Manuscript: LETTER Category: VLSI Design Technology and CAD Keyword: associative memory, pattern matching, fully-parallel search, k-nearest-matches, Full Text: PDF(393KB)>>
Summary: 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. | ||||||||||
| ||||||||||
