By Topic

An optimal algorithm for permutation admissibility to multistage interconnection networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaojun Shen ; Comput. Sci. Telecommun. Program, Missouri Univ., Kansas City, MO, USA ; Mao Xu ; Xiangzu Wang

This paper introduces a simple O(NlogN) sequential algorithm that determines the admissibility of an arbitrary permutation to an N×N Multistage Cube-Type Network (MCTN) implemented by 2×2 switching elements (SEs) in contrast to previous O(Nlog2N) algorithms. It is proven that the new algorithm is optimal in the sense that any algorithm, based on bit-operations, has to examine at least (N/4)logN different bits among the total NlogN bits in the binary representations of the destinations numbered from 0 through N-1

Published in:

IEEE Transactions on Computers  (Volume:44 ,  Issue: 4 )