DocumentCode :
1817316
Title :
A parallel sorting network without comparators: A neural network approach
Author :
Kwon, Taek M. ; Zervakis, Michael
Author_Institution :
Dept. of Comput. Eng., Minnesota Univ., Duluth, MN, USA
Volume :
1
fYear :
1992
fDate :
7-11 Jun 1992
Firstpage :
701
Abstract :
The design of a parallel sorting network that does not use any comparators is described. 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 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, each column of the proposed sorting network is referred to as the Kth WTA network. A simple design technique of the Kth WTA network, which can be readily implemented in hardware, is described
Keywords :
neural nets; sorting; neural network approach; neural nodes; on-state neuron; parallel sorting network; sorting network; two-dimensional array; winner-take-all networks; Biomedical signal processing; Computer networks; Concurrent computing; Design engineering; Hardware; Neural networks; Neurons; Signal processing algorithms; Sorting; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1992. IJCNN., International Joint Conference on
Conference_Location :
Baltimore, MD
Print_ISBN :
0-7803-0559-0
Type :
conf
DOI :
10.1109/IJCNN.1992.287105
Filename :
287105
Link To Document :
بازگشت