The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1972 vol.21)
pp: 472-479
K. Harada , Kamakura Works, Mitsubishi Electric Corporation
ABSTRACT
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<sup>?</sup>-n) switching elements each of which permutes its input pai
INDEX TERMS
Combinatorial algebra, permutation networks, sequential circuits, special-purpose digital circuits, switching networks.
CITATION
K. Harada, "Sequential Permutation Networks", IEEE Transactions on Computers, vol.21, no. 5, pp. 472-479, May 1972, doi:10.1109/T-C.1972.223543
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool