Back to Search
Start Over
Characteristics, routing algorithm, and optical implementation of two-dimensional perfect-shuffle networks
- Source :
- Applied Optics. 32:7210
- Publication Year :
- 1993
- Publisher :
- The Optical Society, 1993.
-
Abstract
- One-dimensional perfect-shuffle networks are extended to two-dimensional perfect-shuffle networks, and this extension is analyzed by means of the finite-state model. The routing algorithm presented is based on quaternary numbers for 4 × 4 switches, and its extension to k × k switches is briefly discussed. In order to take full advantage of the three-dimensional interconnection capability and two-dimensional space-bandwidth product of free-space optics, we map one-dimensional perfect-shuffle networks into two-dimensional perfect-shuffle networks, with both having 4 × 4 switching elements. Finally we compare the permutation capability of two-dimensional perfect-shuffle networks with one-dimensional perfect-shuffle networks.
Details
- ISSN :
- 15394522 and 00036935
- Volume :
- 32
- Database :
- OpenAIRE
- Journal :
- Applied Optics
- Accession number :
- edsair.doi.dedup.....529f76ac11cdcc243b114e4d12823d11