Issue No. 09 - September (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.713324
<p><b>Abstract</b>—In this paper, we present a new implementation of the fast VLSI-efficient self-routing N × N permutation network proposed by Cam and Fortes, which requires only about half as much hardware and has a lower latency. Cam and Fortes' implementation uses Cormen and Leiserson's hyperconcentrators, which can route only active inputs. The reduction in hardware is achieved by modifying Cormen and Leiserson's hyperconcentrator to route active, as well as inactive, inputs to the output. This modification allows us to reduce the number of hyperconcentrators needed in the permutation network by 50 percent and eliminate the interstage interconnection networks, making the permutation network faster by log<sub>2</sub>N bits.</p>
Self-routing, permutation network, concentrator, radix-sorting, VLSI implementation.
J. Agrawal and Y. Zhang, "A Fast and Low Cost Self-Routing Permutation Network," in IEEE Transactions on Computers, vol. 47, no. , pp. 1033-1036, 1998.