107 search results - page 2 / 22 » On The Shuffle-Exchange Permutation Network |
ISCAS
2005
IEEE
13 years 10 months ago
2005
IEEE
- The inclusion of programmable logic cores in modern SoCs motivates the need for an access network to make full use of this resource. The programmable nature of these cores remove...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
The de Bruijn digraph B d;D is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmos...
JSA
2000
13 years 5 months ago
2000
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets...
NETWORKS
2010
13 years 3 months ago
2010
