By Topic

Nonpositive Hopfield Networks in Error Correcting Coding Applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shrivastava, Y. ; Department of Electrical and Computer Engineering, University of Iowa, Iowa City, IA 52242; Center for Industrial Control Systems, Newcastle, NSW 2308, Australia. ; Dasgupta, S. ; Reddy, S.M.

We consider a class of symmetric Hopfield Networks, with nonpositive synapses and zero thresholds and address a variety of design and analysis issues conected with Unidirectional Error Correcting Coding applications of this class. We show that this class is naturally suited to work in a unidirectional error environment We give a necessary and sufficient condition for a set of vectors to be storable in a Nonpositive Network. We propose a simple word storage algorithm, which is amenable to on line implementation, and guarantees storage of all storage compatible words. We show that the storage algorithm creates a maximally fault tolerant network which is free from spurious stationary points, whenever that freedom is possible. We also give a word forgetting algorithm; a tight, deterministic bound on the storage capacity, and give conditions under which the network created by our storage scheme tolerates a given number of arbitrary physical faults.

Published in:

American Control Conference, 1993

Date of Conference:

2-4 June 1993