Guaranteed recall of all training pairs for bidirectional associative memory.
Necessary and sufficient conditions are derived for the weights of a generalized correlation matrix of a bidirectional associative memory (BAM) which guarantee the recall of all training pairs. A linear programming/multiple training (LP/MT) method that determines weights which satisfy the conditions when a solution is feasible is presented. The sequential multiple training (SMT) method is shown to yield integers for the weights, which are multiplicities of the training pairs. Computer simulation results, including capacity comparisons of BAM, LP/MT BAM, and SMT BAM, are presented.
Wang
Y F
YF
Dept. of Electr. and Comput. Eng., California Univ., Irvine, CA.
Cruz
J R
JR
Mulligan
J R
JR