Abstract
A comprehensive strategy for bidirectional associative memories (BAMs) is presented, which enhances storage capacity greatly. The design strategy combines the dummy augmentation encoding method with optimal gradient descent algorithm. The proposed method increases the storage capacity performance of BAM to its upper limit compared with original Kosko method and optimal gradient descent algorithm. Computer simulations and comparison are given based on three methods to demonstrate the performance improvement of the proposed strategy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kosko, B.: Bidirectional Associative Memories. IEEE Trans. Syst., Man, Cybern. 18, 49–60 (1988)
Haines, K., Hecht-Nielson, R.: A BAM with Increased Information Storage Capacity. In: Proc. IJCNN 1988, vol. 1, pp. 181–190 (1988)
Wang, Y.F., Cruz, J.B., Mulligan, J.H.: Two coding Strategies for Bidirectional Associative Memory. IEEE Trans. Neural Network 1, 81–92 (1990)
Wang, W.J., Lee, D.L.: A Modified Bidirectional Decoding Strategy Based on the BAM Structure. IEEE Trans. Neural Network 4, 710–717 (1993)
Perfetti, R.: Optimal Gradient Descent Learning for Bidirectional Associative Memories. Electron. Lett. 29, 1556–1557 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, G., Givigi, S.N., Zheng, W. (2005). A New Strategy for Designing Bidirectional Associative Memories. In: Wang, J., Liao, X., Yi, Z. (eds) Advances in Neural Networks – ISNN 2005. ISNN 2005. Lecture Notes in Computer Science, vol 3496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427391_63
Download citation
DOI: https://doi.org/10.1007/11427391_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25912-1
Online ISBN: 978-3-540-32065-4
eBook Packages: Computer ScienceComputer Science (R0)