A new time domain, multistage permutation algorithm (switching systems)
Srinivasan V. Ramanan, Harry F. Jordan, Jon R. Sauer · IEEE Transactions on Information Theory · 1990
It is shown that a frame of N time slots can be arbitrarily permuted with 2log/sub 2/N-1 controlled exchange switches with associated delay elements. This is an improvement over previously known interconnection networks that require O(N) exchange elements. The proof utilizes the recursive algorithm of V.E. Benes (1965) and the time interchange properties of a particular configuration of a single exchange element. The architecture is especially applicable in optical systems, since optical exchange switches are among the simplest optical logic devices to build, are inherently very fast, and are the best developed, although expensive.>