摘要
介绍N×N多级互连网络级间交换的位置换概念，通过定义网络可访问序列和自路由标记序列，系统地解决这一类网络的完全可访问特性判定和自路由问题．
By modeling the N×N multistage interconnection networks (MIN) with bit permutation in abstract algebra, the concepts of network accessibility sequences and self-route label sequences are defined. The full accessibility criterion of Ω-equivalence networks is proposed and proved, and the self-route problem in such class of network is resolved systematically.
出处
《深圳大学学报（理工版）》
EI
CAS
1998年第4期28-36,共9页
Journal of Shenzhen University(Science and Engineering)
