New Recording Algorithm For Hopfield Model Associative Memories

M H Hassoun; A M. Youssef

doi:10.1117/12.944101

3 May 1988 New Recording Algorithm For Hopfield Model Associative Memories

M H Hassoun, A M. Youssef

Proceedings Volume 0882, Neural Network Models for Optical Computing; (1988) https://doi.org/10.1117/12.944101
Event: 1988 Los Angeles Symposium: O-E/LASE '88, 1988, Los Angeles, CA, United States

Abstract

A new recording technique for Hopfield-type associative/content address-able memories is proposed. The new technique is based on the finite and exponentially convergent algorithm of Ho and Kashyap[1] for the solution of a system of linear inequalities. Associative neural memories recorded with the proposed algorithm are shown to be superior to those recorded with the Hopfield's outer product and Kohonen's generalized inverse techniques. High capacity, high convergence rates to stored memories, and low convergence rates to false and oscillatory states are characteristics of this new recording algorithm. The issue of stable false and oscillatory states is raised, and it is shown that such states have a direct Boolean logic relationship with the stored memories.

Citation Download Citation

M H Hassoun and A M. Youssef "New Recording Algorithm For Hopfield Model Associative Memories", Proc. SPIE 0882, Neural Network Models for Optical Computing, (3 May 1988); https://doi.org/10.1117/12.944101

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available