Related Experiment Video
Updated: Jul 7, 2026

The Double-H Maze: A Robust Behavioral Test for Learning and Memory in Rodents
Published on: July 8, 2015
Guaranteed recall of all training pairs for bidirectional associative memory
Y F Wang1, J R Cruz, J R Mulligan
1Dept. of Electr. and Comput. Eng., California Univ., Irvine, CA.
Abstract:
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.
Related Concept Videos
Associative Learning
Classical conditioning, also known...
Long-Term Memory
Long-term memory can be categorized into two primary types: explicit and implicit memory. Explicit memory, also known as declarative memory, involves the conscious recollection of information that we deliberately try to remember, recall, and articulate. This type of memory encompasses specific facts, events, and...
Implicit Memories
One key aspect of implicit...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
System of Memory
Understanding Memory
