Share Email Print
cover

Proceedings Paper

Generalized Lambda time-slot permuters
Author(s): Daeshik Lee; Kyungsook Y. Lee; Harry F. Jordan
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 9 February 1993
PDF: 8 pages
Proc. SPIE 1784, High-Speed Fiber Networks and Channels II, (9 February 1993); doi: 10.1117/12.141080
Show Author Affiliations
Daeshik Lee, Univ. of Denver (United States)
Kyungsook Y. 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