By Topic

Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network

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

1 Author(s)
Steinberg, D. ; Israel Aircraft Industries

Let Ω denote the set of permutations performable by a pass through the Omega network (an n-stage shuffle-exchange network), and let π denote an arbitrary permutation of N = 2n elements. In this paper we characterize the sets {π|πΩ = Ω} (called left invariants) and {π|Ωπ = Ω} (called right invariants). This characterization provides a useful criterion for determining whether or not the composition of two permutations belongs to Ω; it also allows a number of known results to be generalized and their derivations simplified.

Published in:

Computers, IEEE Transactions on  (Volume:C-32 ,  Issue: 5 )