N-stage planar optical permutation network

Publisher Website
Google Scholar
Abstract
This paper describes the construction of a permutation network which is advantageous for optical switching. The switching architecture is planar and does not require optical path crossovers between crosspoints. The network can be partitioned if necessary to ease fabrication difficulties. An algorithm is given to set the binary cells in the network to achieve any specified permutation, and it is shown that no planar N × N network can achieve such rearrangeability with fewer than the N(N − 1)/2 crosspoints used here.