二维全混洗网络的特性、路由算法及光学实现

Characteristics, routing algorithm, and optical implementation of two-dimensional perfect-shuffle networks.

作者信息

Wu Y, Liu L, Wang Z

出版信息

Appl Opt. 1993 Dec 10;32(35):7210-6. doi: 10.1364/AO.32.007210.

DOI:10.1364/AO.32.007210

PMID:20861937

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.

摘要

一维全混洗网络被扩展到二维全混洗网络，并通过有限状态模型对这种扩展进行了分析。所提出的路由算法基于用于4×4交换机的四进制数，并简要讨论了其向k×k交换机的扩展。为了充分利用自由空间光学的三维互连能力和二维空间带宽积，我们将一维全混洗网络映射到二维全混洗网络，两者都具有4×4交换元件。最后，我们比较了二维全混洗网络和一维全混洗网络的置换能力。