By Topic

The universality of a class of modified single-stage shuffle/exchange 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

2 Author(s)
S. Thanawastien ; Univ. of Southwestern Louisiana, Lafayette, LA, USA ; P. K. Srimani

A class of modified single-state shuffle/exchange (S/E) networks with reconfigurable connections is described. The capability of these modified networks to simulate every arbitrary permutation and other multistage S/E networks is studied. In particular, the upper bounds on simulating six multistage S/E networks are given. It is also shown that C.L. Wu and T.Y. Feng's (1981) modified single-stage S/E network is optimal in terms of its universality and cost for the networks with one reconfigurable connection. However, some of the modified networks with two reconfigurable connections have better capability although they are slightly more expensive than Wu and Feng's network. Also proposed is a link folding scheme that can be used to reduce the connection complexity of implementing the connection selection mechanism

Published in:

IEEE Transactions on Computers  (Volume:37 ,  Issue: 3 )