Self-routing in 2-D shuffle networks with dimension-independent switches of size ≥8x8

We may (1) design a 1-D shuffle network and map it into its topologically equivalent 2-D shuffle network according to a transformation path (TP) or (2) define a 2-D shuffle network directly and route the data through the network by operations on pairs of mixed radix numbers (MRN). In many cases, a TP does not exist and thus the routing information has to be deduced from the pairs of MRN dependent on the interstage interconnections and the size, geometry and arrangement of greater than or equal to 8x8-switches.