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.

© 1987 Optical Society of America

Modified gamma network and its optical implementation

Yaming Wu, Liren Liu, and Zhijiang Wang
Appl. Opt. 32(35) 7194-7199 (1993)

Two-bounce optical arbitrary permutation network

Marc P. Christensen and Michael W. Haney
Appl. Opt. 37(14) 2879-2885 (1998)

All-optical stage of an Omega network

Dan M. Marom, Naim Konforti, and David Mendlovic
Appl. Opt. 37(29) 6946-6950 (1998)

Permutation-network-based optoelectronic path-history units for Viterbi decoders

Ming-Bo Lin
Appl. Opt. 39(26) 4829-4833 (2000)

Properties of nonblocking single-substrate optical space switching networks constructed from directional couplers

S. J. Madden
Appl. Opt. 33(36) 8375-8386 (1994)