Share Email Print

Proceedings Paper

New Recording Algorithm For Hopfield Model Associative Memories
Author(s): M H Hassoun; A M. Youssef
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 3 May 1988
PDF: 9 pages
Proc. SPIE 0882, Neural Network Models for Optical Computing, (3 May 1988); doi: 10.1117/12.944101
Show Author Affiliations
M H Hassoun, Wayne State University (United States)
A M. Youssef, Wayne State University (United States)

Published in SPIE Proceedings Vol. 0882:
Neural Network Models for Optical Computing
Ravindra A. Athale; Joel Davis, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?