Abstract
We define some important properties of the permutation matrices of t-shuffle type which can be used to synthesize omega and inverse omega multistage interconnection networks. We also address some features of these networks compared to other networks of delta type. Finally, we propose one modification of omega network which decreases the number of stages in the network.
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: Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics
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.
