Back to Search
Start Over
Design of a modern fast Fourier transform and cache effective bit-reversal algorithm.
- Source :
-
International Journal of Parallel, Emergent & Distributed Systems . May2023, Vol. 38 Issue 3, p229-248. 20p. - Publication Year :
- 2023
-
Abstract
- This article deals with efficient vectorization of the fast Fourier transform algorithm while focusing on Cooley–Tukey versions with power-of-two radixes. Aside from examples of optimizations for 256 and 512-bit vectors, this work also discusses relations between individual radix-based versions, vectorization and OpenMP threading. Ideas are progressing into a timeless design of the FFT algorithm, which can work with any vector size and radix version through conversion into radix-2 output permutation. Furthermore, the implementation of the Cache Optimized Bit-Reversal algorithm, which doubles the performance of its predecessor, is introduced. [ABSTRACT FROM AUTHOR]
- Subjects :
- *FAST Fourier transforms
*CACHE memory
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 17445760
- Volume :
- 38
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- International Journal of Parallel, Emergent & Distributed Systems
- Publication Type :
- Academic Journal
- Accession number :
- 163249379
- Full Text :
- https://doi.org/10.1080/17445760.2023.2179049