Abstract

The neural-network-like scheme of data storage and processing of N-bit sequences of information needs a memory of about N² elements (interconnections). In digital auto-associative memories /1/ the useful data is presented usually as a set of S different words, v^(s)(s= 1,…, S), each word being a sequence of N bits. Simple mathematical rule /2/, given originally by Hopfield /3/, can serve as an algorithm to calculate the values of the N² elements of the memory matrix, T. Recall of the memory gives an output word, v^(out), which results from a thresholded inner product between the interrogating input word, v⁽ⁱⁿ⁾ and the memory matrix.

© 1991 Optical Society of America