Investigates the qualitative properties of a class of bidirectional associative memories. Networks are described by a system of first order ordinary difference equations which are defined on a closed hypercube of the state space with solutions extended to the boundary of the hypercube. For the present model, a systematic analysis method is developed to completely characterize a given network, i.e., the distribution of equilibria in the state space, and the stability properties of the equilibrium points. In addition, the authors establish a computationally efficient synthesis procedure utilizing the eigenstructure decomposition method. The applicability of the present results is demonstrated by means of a specific application in flexible structures.<>
Stability analysis and synthesis algorithm of bidirectional associative memory
1994-01-01
312332 byte
Conference paper
Electronic Resource
English
Stability Analysis and Synthesis Algorithm of Bidirectional Associative Memory
British Library Conference Proceedings | 1994
|Bidirectional Associative Memory Utilizing Maximum Likelihood
British Library Online Contents | 2008
|Complex Morphological Bidirectional Associative Memory Network and Its Performance Analysis
British Library Online Contents | 2015
|Two Iterative Encoding Schemes for Bidirectional Associative Memory
British Library Conference Proceedings | 1994
|