A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network
From MaRDI portal
Publication:1071518
DOI10.1016/0020-0190(85)90095-XzbMath0586.68055OpenAlexW2063430752MaRDI QIDQ1071518
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(85)90095-x
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Notes on Shuffle/Exchange-Type Switching Networks
- The Reverse-Exchange Interconnection Network
- The Universality of the Shuffle-Exchange Network
- A Shuffle-Exchange Network with Simplified Control
- Implementation of Permutation Functions in Illiac IV-Type Computers
- Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Parallel Processing with the Perfect Shuffle
- On Generating Multipliers for a Cellular Fast Fourier Transform Processor
This page was built for publication: A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network