Guaranteed recall of all training pairs for exponential bidirectional associative memory

Several methods of guaranteeing the recall of all training pairs for exponential bidirectional associative memory are presented. If the minimum Hamming distance between patterns is known, the radix can be determined to provide a certain basin of attraction. Otherwise the statistical minimum distance can be applied. A weight learning algorithm based on a pseudo-relaxation algorithm is also developed to make all training pairs recallable with a small radix.
Publisher
IEE-INST ELEC ENG
Issue Date
2001-02
Language
ENG
Citation

ELECTRONICS LETTERS, v.37, no.3, pp.153 - 154

ISSN
0013-5194
URI
http://hdl.handle.net/10203/8280
Appears in Collection
EE-Journal Papers(저널논문)
  • Hit : 301
  • Download : 16
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 3 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0