关于双向联想存储器(BAM)全部可存储性的判据

A CRITERION FOR THEALL-STORANBILITY OF BIDIRECTIONALASSOCIATIVE MEMORY

对双向联想存储器（ＢＡＭ）是否可全部记忆一组训练模式对的问题进行讨论。联结权重矩阵的存在性对于设计有限步内结束的学习算法起决定作用。提出了关于全存储性的一个几何判据。

In designing a bidirecdonal associative memory (BAM) for a finite set of tinning pattem pairs, a reasonable question is to ask whether or not all the training pattem pairs can be simultaneously stored by the same wcight matrix of connection. This is the all-storability problem addressed in this paper. The existence of the connection weight matrix is essential for designing finite-step leaming algorithms. A geometrical condition for all-storability is proposed based on theoretical derivations.