DocumentCode
2343015
Title
The associative memory with optimal error-correcting performance
Author
Jiang Mingyan ; Daming, Zhu ; Peng, Lei
Author_Institution
Dept. of Electron. Eng., Shandong Univ., Jinan, China
Volume
2
fYear
2000
fDate
2000
Firstpage
790
Abstract
In this paper the character of the associative memory is discussed emphatically from the viewpoint of the storage capacity and the associative ability of the network. The associative memory function can all be realized by utilizing the feedback network on competition. The competing classifying (CC) algorithm is presented here. Compared with any other associative memories that already exist, the neural network determined by the algorithm has very good performances such as high error-correcting capability, large storage capacity, no “rejected-point” and no spurious attractive center. The obtained network exceeds the storage capacity of HAM and BP networks
Keywords
competitive algorithms; content-addressable storage; error correction; feedforward neural nets; optimisation; recurrent neural nets; CC algorithm; associative memory; associative memory function; competing classifying algorithm; feedback network; high error-correcting capability; optimal error-correcting performance; storage capacity; Algorithm design and analysis; Associative memory; Capacity planning; Feeds; Hamming distance; Joining processes; Neurofeedback; Neurons; Stability; Valves;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on
Conference_Location
Hefei
Print_ISBN
0-7803-5995-X
Type
conf
DOI
10.1109/WCICA.2000.863337
Filename
863337
Link To Document