Novel algorithm for complex bit reversal: Employing vector permutation and branch reduction methods
From MaRDI portal
Publication:1049845
DOI10.1631/jzus.A0920290zbMath1183.68736MaRDI QIDQ1049845
Ze-Ke Wang, Rui-Feng Ge, Feng Yu
Publication date: 13 January 2010
Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)
fast Fourier transformbit reversalbranch reductionsingle instruction multiple datavector permutation
Parallel algorithms in computer science (68W10) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- Permutation algorithms on optical multi-trees
- A second improved digit-reversal permutation algorithm for fast transforms
- A new bit reversal algorithm
- Permuting streaming data using RAMs
- Unscrambling for fast DFT algorithms
- Efficient Bit and Digital Reversal Algorithm Using Vector Calculation
- A new efficient computational algorithm for bit reversal mapping
This page was built for publication: Novel algorithm for complex bit reversal: Employing vector permutation and branch reduction methods