A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network

The authors present a simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. Their algorithm is based on balanced matrices and does not require any backtracking. This property is useful when pipelining is used with a single stage network and recirculation of data.<>