A two step sorting algorithm

Yoshiyasu Takefuji, Kuo Chun Lee, Toshimitsu Tanaka

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

A parallel algorithm based on neural networks for solving sorting problems is presented. The proposed algorithm uses O(n2) processing elements called binary neurons, where n is the number of unsorted elements. It requires two and only two iteration steps, while the conventional parallel sorting algorithm using (On) processors proposed by F. T. Leighton (1984) requires the computation time O(log n). A set of simulation results substantiates the proposed algorithm. The hardware system based on the proposed parallel algorithm is also presented.

Original languageEnglish
Pages793-798
Number of pages6
Publication statusPublished - 1990 Dec 1
Externally publishedYes
Event1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3) - San Diego, CA, USA
Duration: 1990 Jun 171990 Jun 21

Other

Other1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3)
CitySan Diego, CA, USA
Period90/6/1790/6/21

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A two step sorting algorithm'. Together they form a unique fingerprint.

  • Cite this

    Takefuji, Y., Lee, K. C., & Tanaka, T. (1990). A two step sorting algorithm. 793-798. Paper presented at 1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3), San Diego, CA, USA, .