Encoding strategy for maximum noise tolerance bidirectional associative memory.
In this paper, the basic bidirectional associative memory (BAM) is extended by choosing weights in the correlation matrix, for a given set of training pairs, which result in a maximum noise tolerance set for BAM. We prove that for a given set of training pairs, the maximum noise tolerance set is the largest, in the sense that this optimized BAM will recall the correct training pair if any input pattern is within the maximum noise tolerance set and at least one pattern outside the maximum noise tolerance set by one Hamming distance will not converge to the correct training pair. This maximum tolerance set is the union of the maximum basins of attraction. A standard genetic algorithm (GA) is used to calculate the weights to maximize the objective function which generates a maximum tolerance set for BAM. Computer simulations are presented to illustrate the error correction and fault tolerance properties of the optimized BAM.
Shen
Dan
D
Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH 43210, USA. shen.100@osu.edu
Cruz
Jose B
JB
D004560:Electricity; D008568:Memory; D008959:Models, Neurological; D015233:Models, Statistical; D016571:Neural Networks, Computer