McEliece, Robert J. and Posner, Edward C. and Rodemich, Eugene R. and Venkatesh, Santosh S. (1987) The capacity of the Hopfield associative memory. IEEE Transactions on Information Theory, 33 (4). pp. 461-482. ISSN 0018-9448. http://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit87
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit87
Techniques from coding theory are applied to study rigorously the capacity of the Hopfield associative memory. Such a memory stores n-tuple of ±1's. The components change depending on a hard-limited version of linear functions of all other components. With symmetric connections between components, a stable state is ultimately reached. By building up the connection matrix as a sum-of-outer products of m fundamental memories, one hopes to be able to recover a certain one of the m memories by using an initial n-tuple probe vector less than a Hamming distance n/2 away from the fundamental memory. If m fundamental memories are chosen at random, the maximum asymptotic value of min order that most of the m original memories are exactly recoverable is n/(2 log n). With the added restriction that every one of the m fundamental memories be recoverable exactly, m can be no more than n/(4 log n)asymptotically as n approaches infinity. Extensions are also considered, in particular to capacity under quantization of the outer-product connection matrix. This quantized memory capacity problem is closely related to the capacity of the quantized Gaussian channel.
|Additional Information:||© Copyright 1987 IEEE. Reprinted with permission. Manuscript deceived February 3, 1986; revised October 28, 1986. This work was supported in part by the National Aeronautics and Space Administration through the Jet Propulsion Laboratory of the California Institute of Technology and in part by the Defense Advanced Research Projects Agency. This work was partially presented at ISIT 85, Brighton, England, June 1985. We thank A. Dembo for pointing out an error in a previous version of this paper.|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||03 Jan 2007|
|Last Modified:||26 Dec 2012 09:26|
Repository Staff Only: item control page