A two step sorting algorithm

Yoshiyasu Takefuji, Kuo Chun Lee, Toshimitsu Tanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationIJCNN. International Joint Conference on Neural Networks
PublisherPubl by IEEE
Pages793-798
Number of pages6
Publication statusPublished - 1990
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

Fingerprint

Sorting
Parallel algorithms
Computer hardware
Neurons
Computer systems
Neural networks
Processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Takefuji, Y., Lee, K. C., & Tanaka, T. (1990). A two step sorting algorithm. In IJCNN. International Joint Conference on Neural Networks (pp. 793-798). Publ by IEEE.

A two step sorting algorithm. / Takefuji, Yoshiyasu; Lee, Kuo Chun; Tanaka, Toshimitsu.

IJCNN. International Joint Conference on Neural Networks. Publ by IEEE, 1990. p. 793-798.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Takefuji, Y, Lee, KC & Tanaka, T 1990, A two step sorting algorithm. in IJCNN. International Joint Conference on Neural Networks. Publ by IEEE, pp. 793-798, 1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3), San Diego, CA, USA, 90/6/17.
Takefuji Y, Lee KC, Tanaka T. A two step sorting algorithm. In IJCNN. International Joint Conference on Neural Networks. Publ by IEEE. 1990. p. 793-798
Takefuji, Yoshiyasu ; Lee, Kuo Chun ; Tanaka, Toshimitsu. / A two step sorting algorithm. IJCNN. International Joint Conference on Neural Networks. Publ by IEEE, 1990. pp. 793-798
@inproceedings{5b602449b59a4a98b2c0d02b08c6b469,
title = "A two step sorting algorithm",
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.",
author = "Yoshiyasu Takefuji and Lee, {Kuo Chun} and Toshimitsu Tanaka",
year = "1990",
language = "English",
pages = "793--798",
booktitle = "IJCNN. International Joint Conference on Neural Networks",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - A two step sorting algorithm

AU - Takefuji, Yoshiyasu

AU - Lee, Kuo Chun

AU - Tanaka, Toshimitsu

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025536109&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025536109&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025536109

SP - 793

EP - 798

BT - IJCNN. International Joint Conference on Neural Networks

PB - Publ by IEEE

ER -