By Topic

The convergence properties of a clipped Hopfield network and its application in the design of keystream generator

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
$33 $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

2 Author(s)
Chi-Kwong Chan ; Dept. of Electron. Eng., City Univ. of Hong Kong, China ; L. M. Cheng

We first present a modified Hopfield network, the clipped Hopfield network, with synaptic weights assigned to three values {-1,0,+1}. We give the necessary conditions under which a set of 2n binary vectors can be stored as stable points of the network. We show that in the parallel updating mode, for most of the state vectors, the network will always converge to these 2n stable points. We further demonstrate that these 2n stable points can be divided into two groups, the α group and the β group, each with n stable points. It is shown that the basins of attraction of the stable points in the α group are evenly distributed, and the basins of attraction of the stable points in the β group are also evenly distributed. By ways of application, we show that this class of Hopfield network can be used to build a cryptographically secure keystream generator

Published in:

IEEE Transactions on Neural Networks  (Volume:12 ,  Issue: 2 )