107 search results - page 3 / 22 » On The Shuffle-Exchange Permutation Network |
ICCD
2000
IEEE
13 years 10 months ago
2000
IEEE
This paper proposes a new way of efficiently doing arbitrary ¢ -bit permutations in programmable processors modeled on the theory of omega and flip networks. The new omflip ins...
TIT
2010
13 years 10 days ago
2010
We review some recent results on the information-theoretic treatment of coordination in networks. In particular, we present some results from a recent paper by Cuff, Permuter and ...
NETWORKS
2002
13 years 5 months ago
2002
The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left ...
DAM
2010
13 years 4 months ago
2010
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
ICPP
1999
IEEE
13 years 10 months ago
1999
IEEE
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...