A new self-routing permutation network
Authors:
- Wang-Jiunn ChengWCWang-Jiunn Cheng
- Wen-Tsuen ChenWCWen-Tsuen Chen
- 1 May 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 45 (5) , 630-636
Abstract
In this paper, a self-routing permutation network based on a binary radix sorting network has been proposed. It has O(log2 n) propagation delay and O(n log2 n) 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 regularKeywords
This publication has 7 references indexed in Scilit:
- On the Bit-Level Complexity of Bitonic Sorting Networks1993
- Architectures for ATM switching systemsIEEE Communications Magazine, 1993
- Fast self-routing permutation switching on an asymptotically minimum cost networkIEEE Transactions on Computers, 1993
- Self-routing algorithms for strongly regular multistage interconnection networksJournal of Parallel and Distributed Computing, 1992
- A self-routing permutation networkJournal of Parallel and Distributed Computing, 1990
- The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet SwitchingIEEE Journal on Selected Areas in Communications, 1987
- A Sampler of Circuit Switching NetworksComputer, 1979