Rearrangeability of 2 log N-1 shuffle/exchange network
A.Y. Al-Hallaq · 2003
It is proved that the 2 log N-1 S/E (shuffle/exchange) network is rearrangeable for all N. This proof combines the concept of functional equivalence and K.Y. Lee's (1985) proof of rearrangeability. A routing algorithm emerges as a natural result for passing any arbitrary permutation.>