|
|
||||||||
Letter |
Department of Control and Instrumentation Engineering, Korea University, Chochiwon, Chungnam, 339-800, Korea
Department of Computer Science, Korea University, Chochiwon, Chungnam, 339-800, Korea
Department of Computer Science, Korea University, Chochiwon, Chungnam, 339-800, Korea
This article is concerned with the reliable search for optimally performing BSB (brain state in a box) neural associative memories given a set of prototype patterns to be stored as stable equilibrium points. By converting and/or modifying the nonlinear constraints of a known formulation for the synthesis of BSB-based associative memories into linear matrix inequalities, we recast the synthesis into semidefinite programming problems and solve them by recently developed interior point methods. The validity of this approach is illustrated by a design example.
This article has been cited by other articles:
![]() |
Z. Zeng and J. Wang Analysis and design of associative memories based on recurrent neural networks with linear saturation activation functions and time-varying delays. Neural Comput., August 1, 2007; 19(8): 2149 - 2182. [Abstract] [Full Text] [PDF] |
||||
![]() |
J. Síma, P. Orponen, and T. Antti-Poika On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets Neural Comput., December 1, 2000; 12(12): 2965 - 2989. [Abstract] [Full Text] |
||||
![]() |
J. Park and Y. Park An Optimization Approach to Design of Generalized BSB Neural Associative Memories Neural Comput., June 1, 2000; 12(6): 1449 - 1462. [Abstract] [Full Text] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |