A new neural network parallel algorithm for sorting problems is presented in this paper. The proposed algorithm using O(n2) processors requires two and only two steps, not depending on the size of the problem, while the conventional parallel sorting algorithm using O(n) processors proposed by Leighton needs the computation time Oog/i). A set of simulation results substantiates the proposed algorithm. The hardware system based on the proposed parallel algorithm is also presented in this paper.
ASJC Scopus subject areas