INDIRECT ROTATOR GRAPH NETWORK

摘要

PURPOSE: An indirect rotator graph network is provided to obtain an inherent characteristic of a rotator graph which is a static network based on a direct method. CONSTITUTION: An indirect n-dimension rotator graph network includes an N-number of input ports and an N-number of output ports. N is n1 and represents the total number of nodes. Assuming that the diameter of the network of the RG is Kn, Kn is (n-1), and IRGN is formed of (Kn+1) switch stages. A first stage switch module is connected with the nodes through the input port and includes a n1 number of demultiplexers each having the same identifier as the connected node. An n-stage switch module is connected with the node through the output ports and includes a n1 number of multiplexors each having the same identifier as the connected node. The dimension of the IRGN is above three-dimension, another stage switch module formed of a (nxn) crossbar switch may be connected between the first stage switch module and the n=stage switch module. The (nxn) crossbar switches or demultiplexers which form a switch module of the first stage through (n-1) stage each include an n-number of the output links.