By Topic

A neural network with O(N) neurons for ranking N numbers in O(1/N) time

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

2 Author(s)
Jayadeva ; Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, India ; Rahman, S.A.

In this paper, we propose a neural network for ranking a given set of N numbers in O(1/N) time. The ordering of a set of numbers based on their relative magnitudes, which is analogous to sorting, is a fundamental operation in many algorithms. In comparison with other sorting networks reported in the literature, the proposed network requires fewer neurons, and fewer interconnections between neurons. The interconnections use nonlinear synapses which are composed of comparators, and do not require any weighted interconnections between neurons, as used in conventional neural networks. The proposed network has many applications, including as a component of self-organizing feature maps and other systems where sorting is a frequent operation.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:51 ,  Issue: 10 )