A Parallel Sorting Network without Comparators: A Neural Network Approach

Taek M. Kwon; Michael Zervakis

doi:10.1109/IJCNN.1992.287105

A Parallel Sorting Network without Comparators: A Neural Network Approach

Taek M. Kwon, Michael Zervakis

Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

18 Scopus citations

Abstract

This paper describes the design of a parallel sorting network that does not use any comparators. The network consists of a two-dimensional array of neural nodes, representing the sorted result through the position of the on-state neuron in each column. The Kth column of the array finds the Kth largest value (Kth winner) and displays it by turning on the kth winner node. Thus, the sorted result can be read in the order of the on-state nodes from the first to the last column. Since the role of the Kth column of the network is to find the Kth winner, we refer to each column of the proposed sorting network as the Kth WTA network. A simple design technique of the Kth-WTA network, which can be readily implemented in hardware, is described.

Original language	English (US)
Title of host publication	Proceedings - 1992 International Joint Conference on Neural Networks, IJCNN 1992
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	701-706
Number of pages	6
ISBN (Electronic)	0780305590
DOIs	https://doi.org/10.1109/IJCNN.1992.287105
State	Published - 1992
Event	1992 International Joint Conference on Neural Networks, IJCNN 1992 - Baltimore, United States Duration: Jun 7 1992 → Jun 11 1992

Publication series

Name	Proceedings of the International Joint Conference on Neural Networks
Volume	1

Conference

Conference	1992 International Joint Conference on Neural Networks, IJCNN 1992
Country/Territory	United States
City	Baltimore
Period	6/7/92 → 6/11/92

Bibliographical note

Publisher Copyright:
© 1992 IEEE.

Publisher link

10.1109/IJCNN.1992.287105

Find It

Find It at U of M Libraries

Cite this

Kwon, T. M., & Zervakis, M. (1992). A Parallel Sorting Network without Comparators: A Neural Network Approach. In Proceedings - 1992 International Joint Conference on Neural Networks, IJCNN 1992 (pp. 701-706). (Proceedings of the International Joint Conference on Neural Networks; Vol. 1). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IJCNN.1992.287105

A Parallel Sorting Network without Comparators: A Neural Network Approach. / Kwon, Taek M.; Zervakis, Michael.
Proceedings - 1992 International Joint Conference on Neural Networks, IJCNN 1992. Institute of Electrical and Electronics Engineers Inc., 1992. p. 701-706 (Proceedings of the International Joint Conference on Neural Networks; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kwon, TM & Zervakis, M 1992, A Parallel Sorting Network without Comparators: A Neural Network Approach. in Proceedings - 1992 International Joint Conference on Neural Networks, IJCNN 1992. Proceedings of the International Joint Conference on Neural Networks, vol. 1, Institute of Electrical and Electronics Engineers Inc., pp. 701-706, 1992 International Joint Conference on Neural Networks, IJCNN 1992, Baltimore, United States, 6/7/92. https://doi.org/10.1109/IJCNN.1992.287105

@inproceedings{7dba7f3b05394b3a99c2c4bbaffc1a85,

title = "A Parallel Sorting Network without Comparators: A Neural Network Approach",

abstract = "This paper describes the design of a parallel sorting network that does not use any comparators. The network consists of a two-dimensional array of neural nodes, representing the sorted result through the position of the on-state neuron in each column. The Kth column of the array finds the Kth largest value (Kth winner) and displays it by turning on the kth winner node. Thus, the sorted result can be read in the order of the on-state nodes from the first to the last column. Since the role of the Kth column of the network is to find the Kth winner, we refer to each column of the proposed sorting network as the Kth WTA network. A simple design technique of the Kth-WTA network, which can be readily implemented in hardware, is described.",

author = "Kwon, \{Taek M.\} and Michael Zervakis",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 1992 International Joint Conference on Neural Networks, IJCNN 1992 ; Conference date: 07-06-1992 Through 11-06-1992",

year = "1992",

doi = "10.1109/IJCNN.1992.287105",

language = "English (US)",

series = "Proceedings of the International Joint Conference on Neural Networks",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "701--706",

booktitle = "Proceedings - 1992 International Joint Conference on Neural Networks, IJCNN 1992",

}

TY - GEN

T1 - A Parallel Sorting Network without Comparators

T2 - 1992 International Joint Conference on Neural Networks, IJCNN 1992

AU - Kwon, Taek M.

AU - Zervakis, Michael

PY - 1992

Y1 - 1992

N2 - This paper describes the design of a parallel sorting network that does not use any comparators. The network consists of a two-dimensional array of neural nodes, representing the sorted result through the position of the on-state neuron in each column. The Kth column of the array finds the Kth largest value (Kth winner) and displays it by turning on the kth winner node. Thus, the sorted result can be read in the order of the on-state nodes from the first to the last column. Since the role of the Kth column of the network is to find the Kth winner, we refer to each column of the proposed sorting network as the Kth WTA network. A simple design technique of the Kth-WTA network, which can be readily implemented in hardware, is described.

AB - This paper describes the design of a parallel sorting network that does not use any comparators. The network consists of a two-dimensional array of neural nodes, representing the sorted result through the position of the on-state neuron in each column. The Kth column of the array finds the Kth largest value (Kth winner) and displays it by turning on the kth winner node. Thus, the sorted result can be read in the order of the on-state nodes from the first to the last column. Since the role of the Kth column of the network is to find the Kth winner, we refer to each column of the proposed sorting network as the Kth WTA network. A simple design technique of the Kth-WTA network, which can be readily implemented in hardware, is described.

UR - https://www.scopus.com/pages/publications/85132036561

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

U2 - 10.1109/IJCNN.1992.287105

DO - 10.1109/IJCNN.1992.287105

M3 - Conference contribution

AN - SCOPUS:85132036561

T3 - Proceedings of the International Joint Conference on Neural Networks

SP - 701

EP - 706

BT - Proceedings - 1992 International Joint Conference on Neural Networks, IJCNN 1992

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 7 June 1992 through 11 June 1992

ER -

A Parallel Sorting Network without Comparators: A Neural Network Approach

Abstract

Publication series

Conference

Bibliographical note

Publisher link

Find It

Other files and links

Fingerprint

Cite this