A Simple Algorithm for the Control of Rearrangeable Switching Networks
Andrzej Jajszczyk · IEEE Transactions on Communications · 1985
A simple algorithm for the control of rearrangeable switching networks u(n, n, r)is given. This algorithm makes it possible to compute the switch settings that implement a given Permutation. The algorithm takes serial timeO(nr^{2})and consists of one phase, i.e., it does not require iterations. The version of the algorithm which can be used for group switching is also presented.