Share Email Print
cover

Proceedings Paper

Time-slot sorter
Author(s): Kyungsook Y. Lee; Daeshik Lee; Harry F. Jordan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We present a time slot sorter which can sort N destination time slot numbers in N time slots of a frame in a system which uses time division multiplexing. The time slot sorter, SN, is obtained from the spatial sorting network, the Batcher network, and consists of a series of 1/2n(n + 1 exchange switches with associated delay elements, N equals 2n. The individual switch settings of SN are determined on-the-fly by pairwise comparison of destination time slot numbers included in the time slots entering each switch. A time slot sorter is more powerful than a time slot permuter in that it can sort N arbitrary destination time slot numbers whereas a time slot permuter can sort a permutation of N integers 0 through N -1. A time slot sorter has an important application in a general switching problem known as the time-space-time domain permutation in telecommunications. Obviously a time slot sorter can also be used as a time slot permuter.

Paper Details

Date Published: 9 February 1993
PDF: 10 pages
Proc. SPIE 1784, High-Speed Fiber Networks and Channels II, (9 February 1993); doi: 10.1117/12.141078
Show Author Affiliations
Kyungsook Y. Lee, Univ. of Denver (United States)
Daeshik Lee, Univ. of Denver (United States)
Harry F. Jordan, Univ. of Colorado/Boulder (United States)


Published in SPIE Proceedings Vol. 1784:
High-Speed Fiber Networks and Channels II
Kadiresan Annamalai, Editor(s)

© SPIE. Terms of Use
Back to Top