A cost-effective self-routing permutation network

A cost-effective self routing permutation network that is able to connect any input set of permutations assuming one-to-one connection is discussed. The network resembles the baseline network topology, and thus has log N stages. However, a re-circulation scheme is adopted in each stage of the network as in a single-stage shuffle-exchange (S/E) network. The inputs are re-circulated in each stage of the network before they are passed to the subsequent stage. The routing scheme is a binary radix routing. The hardware complexity of the network is O(N log N). The complexity is much less than O(N log/sup 2/ N) of the Batcher network which can be used as a self-routing permutation network when a banyan network is attached to it. The propagation delay of the network is O(log/sup 2/ N) stages. The hardware overhead to implement the self-routing is small, and the implementation has a good regularity.< >