The Algorithm for Rearrangements in the Log2 (N, 0, p) Fabrics with an Odd Number of Stages

This paper presents a new way of representing the internal states of the log₂((N; 0; p) switching fabrics. Basing on this representation a new algorithm for rearrangements in such fabric was developed and is presented here. Also, the maximal number of rearrangements in the log₂((N; 0; p) switching fabrics with odd number of stages is presented.