Searching algorithms of the optimal radix of exponential bidirectional associative memory

Author

Wang, Chua-Chin ; Lee, Jyh-Ping

Author_Institution

Dept. of Electr. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan

Volume

2

fYear

1994

fDate

27 Jun-2 Jul 1994

Firstpage

1137

Abstract

Due to the limitation of the dynamic range of VLSI circuits in the implementation of the exponential bidirectional associative memory (eBAM), the optimal radix must be found in order to get the maximal dimension for the eBAM. It is also necessary to update the radix when new pattern pairs are to be stored. An optimal updating algorithm for the radix is also present. Besides, a pattern pair training algorithm is proposed to ensure every trained pair stored in the eBAM will be recalled when an input pair is located in its basin with radius r

Keywords

VLSI; content-addressable storage; digital arithmetic; integrated memory circuits; learning (artificial intelligence); search problems; VLSI circuits; exponential bidirectional associative memory; optimal radix; searching algorithms; Associative memory; Autocorrelation; Circuits; Dynamic range; Equations; Hardware; Learning systems; Magnesium compounds; Very large scale integration; Voltage;

fLanguage

English

Publisher

ieee

Conference_Titel

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on

Conference_Location

Orlando, FL

Print_ISBN

0-7803-1901-X

Type

conf

DOI

10.1109/ICNN.1994.374343

Filename

374343