Abstract: A layout for the shuffle-exchange network with O(N2/log3/2N) area is described. The layout combines ideas proposed by Thompson, Hoey, and Leiseron ...
A Layout for the Shuffle-Exchange Network with O(N2/log3/2N) Area. 1981, IEEE Transactions on Computers. On sabbatical from IBM Israel Scientific Center ...
A layout for the shuffle-exchange network with O(N2/log3/2N) area is described. The layout combines ideas proposed by Thompson, Hoey, and Leiseron, ...
A layout for the shuffle-exchange network with O(N2/log3/2N) area is described and an interesting feature of the layout is that both the shuffle and the ...
Jan 1, 1981 · Abstract. A layout for the shuffle-exchange network with O(N2/log3/2N) area is described. The layout combines ideas proposed by Thompson, ...
In this paper, we prove that all but one of the components of the transfer digraph D? m needed for the enumeration of 2-factors in the rectangular, thick ...
A LAYOUT FOR THE SHUFFLE-EXCHANGE NETWORK WITH O(N2-LOG3-2N) AREA. Dalia Steinberg and M RODEH Show details for 2 authors. IEEE Transactions on Computers, ...
Feb 22, 2016 · This paper describes a technique for producing a VLSI layout of the shuffle-exchange graph. It is based on the layout procedure which lays ...
A technique for producing a VLSI layout of the shuffle-exchange graph based on the layout procedure which lays out a graph by bisecting the graph, ...
layout requires only O(n2/log3/2n) area. There are other orderings which produce layouts with similar area bounds. For example, if the necklaces are ordered.