Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
