Fast Fourier Transforms on Finite Non-Abelian Groups
IEEE Transactions on Computers
Interconnection networks: a survey and assessment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
| Hi-index | 14.98 |
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 pai