Optical TDM sorting networks for high-speed switching |
| |
Authors: | Kannan R. Daeshik Lee Lee K.Y. Jordan H.F. |
| |
Affiliation: | Dept. of Comput. & Inf. Sci., Michigan Univ., Dearborn, MI; |
| |
Abstract: | The general time-space-time switching problem in telecommunications requires the use of multichannel time slot interchangers. We propose two multichannel time slot sorters which sort N2 time-division multiplexed (TDM) optical inputs, arranged as N frames with N time slots per frame using O(Nlog2N) optical switch elements. The TDM optical inputs are sorted in place without expanding the space-time fabric into a space-division switch. The hardware components used are 2×2 optical switches (LiNbO3 directional couplers) and optical delay lines connected in a feedforward fashion. Two space-time variants of the spatial odd-even merge algorithm are used to design the sorters. By maintaining the number of shift-exchange operations invariant at each stage, the proposed sorters use fewer switches than previously proposed sorters using switches with feedback line delays. The use of local control at each 2×2 switch makes the proposed sorters more practical for high-speed optical inputs than Benes-based time slot permuters with global control and high latency, which affects interframe distance. Both time slot sorters support pipelining of input frames and sorted outputs are available at each time slot after an initial frame delay. The proposed sorters find practical application in the time-domain equivalents of space-division, nonblocking, self-routing packet switches using the sort-banyan architecture, such as the Starlite switch, Sunshine switch, etc |
| |
Keywords: | |
|
|