Characterizing bit permutation networks

✍ Scribed by Chang, Gerard J.; Hwang, Frank K.; Tong, Li-Da

• Book ID: 101225769
• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 129 KB
• Volume: 33
• Category: Article
• ISSN: 0028-3045
• DOI: 10.1002/(sici)1097-0037(199907)33:4<261::aid-net3>3.0.co;2-q

✦ Synopsis

In recent years, many multistage interconnection networks using 2 1 2 switching elements have been proposed for parallel architectures. Typical examples are baseline networks, banyan networks, shuffle-exchange networks, and their inverses. As these networks are blocking, such networks with extra stages have also been studied extensively. These include Benes networks and D ᮍ D networks. Recently, Hwang et al. studied k-extra-stage networks, which are a generalization of the above networks. They also investigated the equivalence issue among some of these networks. In this paper, we studied a more general class of networks, which we call ( m / 1)-stage d-nary bit permutation networks. We characterize the equivalence of such networks by sequence of positive integers.