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 language | English |
|---|---|
| Pages | 793-798 |
| Number of pages | 6 |
| Publication status | Published - 1990 |
| Externally published | Yes |
| Event | 1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3) - San Diego, CA, USA Duration: 1990 Jun 17 → 1990 Jun 21 |
Other
| Other | 1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3) |
|---|---|
| City | San Diego, CA, USA |
| Period | 90/6/17 → 90/6/21 |
ASJC Scopus subject areas
- Engineering(all)