Abstract
Benes networks are known to be nonblocking rearrangeable networks which can realize arbitrary permutations. Topological equivalence extends the nonblocking rearrangeability to a class of multistage interconnection networks (MIN), which has the same topology as Benes networks. There is another class of well-known multistage interconnection networks, which is not yet known as either nonblocking rearrangeable networks or blocking networks, such as omega+omega networks. In this paper we extend the labeling scheme used in Benes-equivalent networks to a class of concatenated omega networks with modified central stage connection. The class of concatenated omega networks are proved to be nonblocking rearrangeable. A looping algorithm is proposed to routing through the networks to realize arbitrary permutation for the whole class of 2log/sub 2/N stage networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
