By Topic

Fully Parallel Associative Memory Architecture with Mixed Digital-Analog Match Circuit for Nearest Euclidean Distance Search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Md. Anwarul Abedin ; Research Center for Nanodevices and Systems, Hiroshima University, 1-4-2 Kagamiyama, Higashi-Hiroshima, 739-8527 Japan. Phone: +81-82-424-6265, Fax: +81-82-424-3499 Email: abedin@sxsys.hiroshima-u.ac.jp ; Yuki Tanaka ; Ali Ahmadi ; Tetsushi Koide
more authors

In this paper, associative memory architecture for a fully parallel nearest Euclidean distance search is proposed. It uses digital circuitry up to subtraction and absolute value calculation in the vector-component comparator part. Analog processing is then applied up to completion of the winner-take-all function. From HSPICE simulation in 0.35 mum CMOS technology the authors confirmed that the winner is detected in less than 135 nsec and the average power dissipation is less than 220 mW among 64 reference patterns each representing a 16-dimensional vector with 5 bit components. A test chip is also designed in 0.35 mum CMOS technology and the chip size is 5.12 mm with 2-poly and 3-metal layers for nearest Euclidean distance search

Published in:

APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems

Date of Conference:

4-7 Dec. 2006