Premium
Characterizing bit permutation networks
Author(s) -
Chang Gerard J.,
Hwang Frank K.,
Tong LiDa
Publication year - 1999
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199907)33:4<261::aid-net3>3.0.co;2-q
Subject(s) - banyan , multistage interconnection networks , computer science , permutation (music) , equivalence (formal languages) , generalization , interconnection , theoretical computer science , class (philosophy) , sequence (biology) , topology (electrical circuits) , computer network , combinatorics , discrete mathematics , mathematics , artificial intelligence , physics , acoustics , mathematical analysis , biology , genetics
In recent years, many multistage interconnection networks using 2 × 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 Δ ⊕ Δ′ 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. © 1999 John Wiley & Sons, Inc. Networks 33: 261–267, 1999