论文部分内容阅读
Some useful layered cross product decompositons are derived both for general bit permutation networks and for(2n-1)-stage multistage interconnection networks. Several issues in related works are clarified and the rearrangeability of some interesting networks are considered. In particular, the rearrangeability of one class of networks is formulated as a new type of combinatorial design problmes.