By Topic

Designing bidirectional associative memories with optimal stability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tao Wang ; Dept. of Comput. Sci. & Eng., Zhejiang Univ., Hangzhou, China ; Zhuang, S. ; Xiaoliang Xing

In this paper, a learning algorithm for bidirectional associative memories (BAM's) with optimal stability is presented. According to an objective function that measures the stability and attraction of the BAM, the authors cast the learning procedure into a global minimization problem, solved by a gradient descent technique. This learning rule guarantees the storage of training patterns with basins of attraction as large as possible. The authors also investigate the storage capacity of the BAR/L, the convergence of the learning method, the asymptotic stability of each training pattern and its basin of attraction. To evaluate the performance of the authors' learning strategy, a large number of simulations have been carried out

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:24 ,  Issue: 5 )