By Topic

On a class of rearrangeable 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
$31 $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

2 Author(s)
Yao-Ming Yeh ; Dept. of Inf. & Comput. Educ., Nat. Taiwan Normal Univ., Taipei, Taiwan ; Tse-Yun Feng

Benes networks are nonblocking rearrangeable networks that can realize arbitrary permutations without conflict. A class of 2 logb N stage networks which are equivalent to the Benes networks is introduced. Networks in this class can be either symmetric or asymmetric in their structure, regular or irregular in their interstage connections, and even, 2 logb N or 2 log b N-1 stages. All networks in this class are nonblocking rearrangeable. A switch labeling scheme is proposed to provide testing of the topological and functional equivalency for this class of networks. This switch labeling scheme can also provide a novel matrix representation for network configuration. This representation introduces a portability concept for the routing scheme on this class of networks. With this representation, a general routing scheme is also developed. This routing scheme can realize arbitrary permutation for the whole class of 2 logb N stage networks

Published in:

Computers, IEEE Transactions on  (Volume:41 ,  Issue: 11 )