### A Permutation NetworkA Permutation Network

Access Restriction
Subscribed

 Author Waksman, Abraham Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1968 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract In this paper the construction of a switching network capable of $\textit{n}!-permutation$ of its $\textit{n}$ input terminals to its $\textit{n}$ output terminals is described. The building blocks for this network are binary cells capable of permuting their two input terminals to their two output terminals.The number of cells used by the network is $<\textit{n}$ · log2 $\textit{n}$ - $\textit{n}$ + 1> = $∑\textit{n}$ $\textit{k}=1$ .$It could be argued that for such a network this number of cells is a lower bound, by noting that binary decision trees in the network can resolve individual terminal assignments only and not the partitioning of the permutation set itself which requires only$ = $<∑\textit{n}$ $\textit{k}=1$ log2 $\textit{k}>$ binary decisions.An algorithm is also given for the setting of the binary cells in the network according to any specified permutation. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1968-01-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 15 Issue Number 1 Page Count 5 Starting Page 159 Ending Page 163

#### Open content in new tab

Source: ACM Digital Library