Characteristics, routing algorithm, and optical implementation of two-dimensional perfect-shuffle networks
- PMID: 20861937
- DOI: 10.1364/AO.32.007210
Characteristics, routing algorithm, and optical implementation of two-dimensional perfect-shuffle networks
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.
Similar articles
-
Shuffle-equivalent interconnection topologies based on computer-generated binary-phase gratings.Appl Opt. 1994 Mar 10;33(8):1405-30. doi: 10.1364/AO.33.001405. Appl Opt. 1994. PMID: 20862167
-
Basic building blocks for the switch-preserving transformation of shuffle interconnections.Appl Opt. 1993 Sep 10;32(26):4992-5001. doi: 10.1364/AO.32.004992. Appl Opt. 1993. PMID: 20856303
-
Crossover networks and their optical implementation.Appl Opt. 1988 Aug 1;27(15):3155-60. doi: 10.1364/AO.27.003155. Appl Opt. 1988. PMID: 20531909
-
Grain-size considerations for optoelectronic multistage interconnection networks.Appl Opt. 1992 Sep 10;31(26):5480-507. doi: 10.1364/AO.31.005480. Appl Opt. 1992. PMID: 20733733
-
Optical perfect-shuffle interconnection using a computer-generated hologram.Appl Opt. 1993 Sep 10;32(26):5022-5. doi: 10.1364/AO.32.005022. Appl Opt. 1993. PMID: 20856306