By Topic

Construction of high-order correlation associative memory with novel retrieval cost performance

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

4 Author(s)
Y. Kumagai ; Muroran Inst. of Technol., Hokkaido, Japan ; J. Kamruzzaman ; Y. Maruyama ; H. Hikita

Crosstalk due to superposition, which is an essential concept of associative memory based on the outer product algorithm, is explicitly formulated in terms of Hamming distance between the memorized keys and input key. Some noticeable properties of crosstalk, such as symmetricity, linear independency, and cancellation characteristics, are derived by using the Krawtchouk polynomial. These properties are highly useful for reducing crosstalk and make it possible to propose a new architecture of associative memory with fewer high-order correlation cross products than the conventional architecture. The architecture proposed completely removes crosstalk due to the memorized keys having odd number Hamming distance from the input key. In order to remove relatively large parts of the residual crosstalk due to even number Hamming distance from the input key, a coding technique which constructs a simple error correcting Hamming code including relatively little redundancy is introduced

Published in:

Circuits and Systems, 1992., Proceedings of the 35th Midwest Symposium on

Date of Conference:

9-12 Aug 1992