A self-routing permutation network
Journal of Parallel and Distributed Computing
Self-routing algorithms for strongly regular multistage interconnection networks
Journal of Parallel and Distributed Computing
Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network
IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A New Self-Routing Multicast Network
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A New Self-Routing Multicast Network
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Routing Permutations on Baseline Networks with Node-Disjoint Paths
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
In this paper, a self-routing permutation network based on a binary radix sorting network has been proposed. It has O(log2n) propagation delay and O(n log2n) hardware complexity with bit-parallel input. The hardware complexity can be reduced to O(n log n) with bit-serial input. The binary radix sorting network is recursively constructed by log n stages of bit sorting networks. The bit sorting network is then constructed by a proposed self-routing reverse banyan network. It has O(log n) propagation delay and O(n log n)hardware complexity. The proposed reverse banyan network has been fully verified by Verilog Hardware Description Language in logical level. The VLSI design of its switching elements is simple and regular.