A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network (Q1071518)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network |
scientific article; zbMATH DE number 3940740
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network |
scientific article; zbMATH DE number 3940740 |
Statements
A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network (English)
0 references
1985
0 references
An algorithm is given for routing the bit-reversal permutation on a shuffle-exchange interconnection network. The algorithm requires 2(log N)-1 stages for N inputs (N is a power of two). The routing scheme is given by an explicit control matrix. Also, an adaptation of the bit- reversal algorithm is presented which computes the control bits 'on-line' during the execution of the algorithm.
0 references
parallel computations
0 references
interconnection network
0 references
control matrix
0 references
0 references
