A parallel sorting network without comparators: A neural network approach

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