高级检索

    互连网络拓扑等价的图分析法

    Graph Analysis Method for Topological Equivalence of Multistage Interconnection Networks

    • 摘要: 提出了描述互连网络拓扑等价的图分析法。获得了全交叉网络与基准、逆基准、Omega、fliP、S=F=2SW榕树,简化数据变换等多级互连网络拓扑等价的逻辑名结构。阐明了用光学全交叉网络模拟实现上述网络的互连函数的原理及其在多处理机、电信交换等领域的潜在应用.

       

      Abstract: A new method,the so-called graph analysis method (GAM),is proposed for study of topological equivalence of multistage interconnection netxvorks (MIN’s).Logical name structures of crossover networks topologically equivalent with a class of MIN’s such as baseline,reverse baseline,Omega,flip,S=F=2 SW banyan,and modified data manipulator are obtained by GAM.Simulation realizations of various interconnection functions of these class of MIN’s by free-space digital optics implementaion of crossover network have been explained,which have potential applications in the fields of multiprocessor system and telecommunication switching system,etc.

       

    /

    返回文章
    返回