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

Abstract

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… (More)
DOI: 10.1109/TCSI.2004.835665

Topics

5 Figures and Tables

Statistics

02040'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

87 Citations

Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Jayadeva2004ANN, title={A neural network with O(N) neurons for ranking N numbers in O(1/N) time}, author={Jayadeva and S. A. Rahman}, journal={IEEE Transactions on Circuits and Systems I: Regular Papers}, year={2004}, volume={51}, pages={2044-2051} }