A New Benes Network Control Algorithm
A New Benes Network Control Algorithm
复制标题
DOI：
10.1109/tc.1987.1676970
复制
发表时间：
1987-06
期刊：
影响因子：
--
通讯作者：
Kyungsook Y. Lee
中科院分区：
文献类型：
--
作者：
Kyungsook Y. Lee
提出了一种新的Benes网络控制算法。与原来的循环算法不同，新算法不是递归的。在该算法中，（N × N）Benes网络被视为两个子网SN 1和SN 2的级联。Benes网络的第一（log N - 1）级对应于SN 1，其余log N级对应于SN 2。SN 1由集合划分函数的完整二叉树控制，称为完整剩余划分树，而SN 2由位控制。新的控制算法一次一级地设置开关。
A new Benes network control algorithm is presented. Unlike the original looping algorithm, the new algorithm is not recursive. In this algorithm (N x N) Benes network is viewed as a concatenation of two subnetworks SN1 and SN2. The first (log N - 1) stages of a Benes network correspond to SN1, and the remaining log N stages correspond to SN2. SN1 is controlled by a full binary tree of set partitioning functions, called a Complete Residue Partition Tree, and SN2 is bit controlled. The new control algorithm sets switches one stage at a time, stage by stage.