By Topic

Analysis of radix searching of exponential bidirectional associative memory

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
$33 $33
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)
C. -C. Wang ; Dept. of Electr. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan ; C. -F. Tsai ; J. -P. Lee

The exponential bidirectional associative memory (eBAM) is a high-capacity associative memory. However, in the hardware realisation of eBAM, increasing efforts have been made to obtain an optimally small radix of exponential circuit for the fixed dynamic range of the VLSI circuit transistor, thereby allowing the dimension of the stored patterns to reach maximum. In this paper, the authors prove the stability of eBAM. The absolute lower bound of the radix of the eBAM is also obtained. In addition, an algorithm is presented to compute the optimal radix of an exponential circuit. To preserve the optimality of the radix, an algorithm capable of updating the radix when new pattern pairs are to be installed is proposed. Moreover, a deterministic method is presented to train and install pattern pairs with a predetermined fault tolerance ability

Published in:

IEE Proceedings - Computers and Digital Techniques  (Volume:145 ,  Issue: 4 )