By Topic

Fully-parallel pattern-matching engine with dynamic adaptability to Hamming or Manhattan distance

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)
H. J. Mattausch ; Res. Center for Nanodevices & Syst., Hiroshima Univ., Japan ; N. Omori ; S. Fukae ; T. Koide
more authors

The proposed pattern-matching engine achieves distance-measure adaptability through pattern encoding and can therefore cover a wide range of high-performance real-time applications. Key to short nearest-match times is a compact fully-parallel associative-memory core. The performance of a 9.75 mm/sup 2/ test-circuit in 0.6 /spl mu/m CMOS technology is about equivalent to a 32 bit computer with ITOPS. The test-circuit suggests possible pattern length /spl ges/768 equivalent bit, >10/sup 7/ pattern/sec throughput, <1.13% winner-input-distance error and <1.35 mW power dissipation per reference pattern.

Published in:

VLSI Circuits Digest of Technical Papers, 2002. Symposium on

Date of Conference:

13-15 June 2002