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 log’ n) hardware complexity with bit-parallel input. The hardware complexity can be reduced to O(n log n) with bitserial 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… CONTINUE READING