Serial Array Time Slot Interchangers and Optical Implementations

We consider time slot interchangers (TSIs) which are built from 2/spl times/2 exchange switches and delays and which are useful for time division multiplexed (TDM) systems in telecommunications and pipelined systems such as time multiplexed optical multiprocessors. We formulate a general method for constructing TSIs based on multistage interconnection networks in the space domain via space-to-time mapping. Two types of TSIs, time slot permuters and time slot sorters, are considered. We review the time slot permuter based on the Benes network, and obtain the /spl Lambdaspl tilde/ time slot permuter based on the bit-controlled, self-routing /spl Lambda/ permutation network. The time slot sorter, S/sub N/, is obtained from the Batcher spatial sorting network. The generalized Lambda time slot permuter /spl Lambdasub Nsup q/ is obtained, in an algorithmic approach, by combining the idea of the /spl Lambdaspl tilde/ time slot permuter and Q-way bitonic decomposition (Q=2/sup q/). The numbers of switches, control complexities, and frame delays of these architectures are compared, and the problem of crosstalk in optical implementation is discussed. It is shown that control complexity can be traded against the number of switches. >

[1]  Harry F. Jordan,et al.  Multichannel time-slot permuters , 1993, Other Conferences.

[2]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[3]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[4]  Richard A. Thompson,et al.  Experimental photonic time-slot interchanger using optical fibers as reentrant delay-line memories , 1986 .

[5]  Robert A. Boudreau,et al.  Low-Loss, Packaged, 2x2 Semiconductor Optical Amplifier Switch, , 1992 .

[6]  Harry F. Jordan,et al.  A new time domain, multistage permutation algorithm , 1990, IEEE Trans. Inf. Theory.

[7]  R. Alferness,et al.  Guided-wave optoelectronics , 1988 .

[8]  Shing-Tsaan Huang,et al.  K-Way Bitonic Sort , 1989, IEEE Trans. Computers.

[9]  Arun N. Netravali,et al.  Dilated Networks for Photonic Switching , 1987, IEEE Trans. Commun..

[10]  V P Heuring,et al.  Bit-serial architecture for optical computing. , 1992, Applied optics.

[11]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[12]  Harry F. Jordan,et al.  Photonic Architectures for Performing Perfect Shuffle on a Time-Division Multiplexed Signal , 1990, Other Conferences.

[13]  H.S. Hinton.  Photonic time-division switching systems , 1989, IEEE Circuits and Devices Magazine.

[14]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[15]  Daeshik Lee.  The Lambda Network: A New Permutation Network , 1987, ICPP.

[16]  H. F. Jordan,et al.  Fiber optic delay line memory. , 1990, Applied optics.

[17]  Tse-yun Feng,et al.  A Survey of Interconnection Networks , 1981, Computer.

[18]  Harry F. Jordan,et al.  Time multiplexed optical computers , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[19]  David K. Hunter,et al.  New architectures for optical TDM switching , 1993 .

[20]  Michel J. F. Digonnet.  Selected papers on rare-earth-doped fiber laser sources and amplifiers , 1992 .