By Topic

Sequential Permutation 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

1 Author(s)
Harada, K. ; Kamakura Works, Mitsubishi Electric Corporation

Two sequential permutation networks which generate all nǃ permutations without duplication are presented. Each permutation can be derived from its predecessor autonomously in one clock step. Based on the principle of recursive execution of a product of transpositions, the first network is constructed in multiple cascades of ½(n²-n) switching elements each of which permutes its input pair to its output pair according to its internal state, and is controlled sequentially by the same principle. Next, the network whose structure and control sequence are complementary to those of the first is presented. The first is named a cyclic permutation network and is an explicit representation of a mapping function The second is named a lexicographic permutation network and is an explicit representation of a factorial counting function where ah is a h-nary factorial digit 0 ≤ ah ≤ (n-1). The characteristics of the networks are investigated by establishing a one-to-one correspondence among nI integers, n! permutations, and n! states of the networks. For the lexicographic permutation network which can generate all permutations in lexicographic order, three examples of applications are given.

Published in:

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