Proceedings Paper
Self-routing in >2D shuffle networks by d-tuples| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper Abstract
Massive parallel optical interconnection systems in the 3-D physical space offer advantages but they also represent serious difficulties caused by the increase of the degree of freedom. These difficulties are mainly (1) packaging and precise mounting but also (2) problems of combinatorial nature. Throughout the paper, the presentation of routing information in greater than or equal to 2-D MINs is discussed and the results are aimed to avoid delay and additional hardware. The results apply to distributed switching and processing under the optical interconnection regime.
Paper Details
Date Published: 9 October 1998
PDF: 16 pages
Proc. SPIE 3466, Algorithms, Devices, and Systems for Optical Information Processing II, (9 October 1998); doi: 10.1117/12.326784
Published in SPIE Proceedings Vol. 3466:
Algorithms, Devices, and Systems for Optical Information Processing II
Bahram Javidi; Demetri Psaltis, Editor(s)
PDF: 16 pages
Proc. SPIE 3466, Algorithms, Devices, and Systems for Optical Information Processing II, (9 October 1998); doi: 10.1117/12.326784
Show Author Affiliations
Josef Giglmayr, none (Germany)
Published in SPIE Proceedings Vol. 3466:
Algorithms, Devices, and Systems for Optical Information Processing II
Bahram Javidi; Demetri Psaltis, Editor(s)
© SPIE. Terms of Use
