Paper
9 February 1993 Generalized Lambda time-slot permuters
Daeshik Lee, Kyungsook Y. Lee, Harry F. Jordan
Author Affiliations +
Abstract
We present a new self-routing time slot permuter, the generalized Lambda time slot permuter (Lambda) Nq for a frame of N time slots (N equals 2n, n equals pq), which generalizes the previously proposed Lambda time slot permuter. The generalized Lambda time slot permuter is obtained by combining the idea of the Lambda time slot permuter and Q-way bitonic decomposition (Q equals 2q). Each instance of a switch setting in (Lambda) Nq is determined on-the-fly by a q-bit comparison of input destination tags. The local control complexity of a generalized Lambda time slot permuter (Lambda) Nq varies from n-bit comparison (q equals n) to a single bit control of the Lambda time slot permuter (q equals 1), while the hardware complexity varies from O(n2 to O(n3). The complexity of the q-bit comparison is O(1) if the data is presented serially, but allows some trade-offs to be made if data packets and destination tags have some parallel nature.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Daeshik Lee, Kyungsook Y. Lee, and Harry F. Jordan "Generalized Lambda time-slot permuters", Proc. SPIE 1784, High-Speed Fiber Networks and Channels II, (9 February 1993); https://doi.org/10.1117/12.141080
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Switches

Switching

Chlorine

Chromium

Computer science

Mathematics

Optoelectronics

RELATED CONTENT

Pseudoframes for subspaces with applications
Proceedings of SPIE (October 19 1998)
Planar realization of all-optical 2D switching networks
Proceedings of SPIE (October 01 1999)
Time-slot sorter
Proceedings of SPIE (February 09 1993)
Low-power array multiplier design by topology optimization
Proceedings of SPIE (December 06 2002)

Back to Top