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.© (1993) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
