Abstract
This paper presents a self-routing algorithm for a class of permutations that can be represented as linear transportations and complementations. This class includes bit-permute-complement (BPC) [6] and several of other frequently used permutations. The same problem for a Benes̃ or a shuffle-exchange network was considered earlier by Boppana and Raghavendra. This paper considers a more general problem by considering a broader class of multistage interconnection networks that includes these networks along with variety of others. For this class of interconnection networks, Nassimi presented a routing algorithm for BPC class. In effect, this paper considers the problem of routing a larger class of permutations than that considered by Nassimi for a broader class of networks than that considered by Boppana and Raghavendra.
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.
