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

  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},
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… CONTINUE READING
Highly Cited
This paper has 99 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 11 extracted citations

100 Citations

Citations per Year
Semantic Scholar estimates that this publication has 100 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 14 references

A super-parallel sorting algorithm based on neural networks,

  • Y. Takefuji, K.-C. Lee
  • IEEE Trans. Circuits Syst.,
  • 1990
Highly Influential
4 Excerpts

Analog VLSI for neural networks,

  • R. W. Newcomb, J. D. Lohn
  • The Handbook of Brain Theory and Neural Networks
  • 1998
1 Excerpt

A note on neural sorting networks with O(1) time complexity,

  • X. Yao
  • Info. Processing Lett., vol. 56,
  • 1995
1 Excerpt

Analysis and design of an analog sorting network,

  • J. Wang
  • IEEE Trans. Neural Networks,
  • 1995
1 Excerpt

Parallel Computing: Theory and Practice

  • M. J. Quinn
  • New York: McGraw Hill
  • 1994
2 Excerpts

Solving sorting and related problems by quadratic perceptrons,

  • Y.-H. Tseng, J.-L. Wu
  • Electron. Lett., vol. 28,
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…