DocumentCode
2694443
Title
Ho-Kashyap content-addressable associative processors
Author
Telfer, Brian ; Casasent, David
fYear
1990
fDate
17-21 June 1990
Firstpage
751
Abstract
The authors compare the storage capacity and other properties of various neural associative processors (APs) and find that the Ho-Kashyap (H-K) AP has the largest storage capacity and can handle linearly dependent keys. General memory (random keys) and distortion-invariant pattern-recognition APs are considered. A discussion is presented of a content-addressable structure that further improves recall accuracy and noise performance and decreases the size of the memory matrix. Results from the new H-K content-addressable AP are given. In all cases, the APs use only one pass (no iterations) in recall
Keywords
content-addressable storage; neural nets; pattern recognition; Ho-Kashyap content-addressable associative processors; content-addressable structure; distortion-invariant pattern-recognition; linearly dependent keys; memory matrix size; neural associative processors; noise performance; one pass recall; random keys; recall accuracy; storage capacity;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1990., 1990 IJCNN International Joint Conference on
Conference_Location
San Diego, CA, USA
Type
conf
DOI
10.1109/IJCNN.1990.137658
Filename
5726618
Link To Document