Abstract
AbstractNumerous routing algorithms have been proposed for the overall network on the traditional Benes permutation networks. to achieve efficient system communication, a study of routing through a small number of information paths is needed from a practical viewpoint. In other words, it is desired that the requirement of permutation by a system should be realized so that for networks currently used, only a small part of the switch settings is affected. In this paper in the forementioned principle, a dynamic routing algorithm (basic design) based on permutation is proposed. Given a permutation t as a control input, a new permutation P̄ = P · t can be realized through currently realized permutation by resetting only a part of the information paths in a network, which does not affect any other information path. Moreover, as an element of a permutation network, we propose a d‐transposition block which performs a transposition operation efficiently, and show examples of d‐transposition blocks for d = 3, 4.
Sign-in/Register to access full text options 
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 callMore From: Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Disclaimer: 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.
