Effective implementations of multi-dimensional radix-2 FFT
From MaRDI portal
If the fast Fourier transform (FFT) is implemented with no care for the structure of the target machine, then the calculation time of FFT can be very large. The author proposes effective implementations of multidimensional radix-2 FFT for the RISC workstation and the vector-type supercomputer, respectively.
Recommendations
- scientific article; zbMATH DE number 4180760
- Efficient 2D FFT implementation on mediaprocessors
- A novel algorithm for computing the 2D split-vector-radix FFT
- On the two-dimensional vector split-radix FFT algorithm
- Very fast computation of the radix-2 discrete Fourier transform
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
- An efficient algorithm for the computation of the multidimensional discrete Fourier transform
- A New Radix-<tex>$2/8$</tex>FFT Algorithm for Length-<tex>$qtimes 2^m$</tex>DFTs
- Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFT
- scientific article; zbMATH DE number 3864463
Cited in
(10)- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
- Vector coding algorithms for multidimensional discrete Fourier transform
- Multiplierless implementation of rotators and FFTs
- On the two-dimensional vector split-radix FFT algorithm
- The structure of vector radix fast Fourier transforms
- scientific article; zbMATH DE number 4180760 (Why is no real title available?)
- Efficient 2D FFT implementation on mediaprocessors
- An Implementation of Multiple and Multivariate Fourier Transforms on Vector Processors
- Special-purpose computer for two-dimensional FFT
- Calculation of radix-2 discrete multiresolution Fourier transform
This page was built for publication: Effective implementations of multi-dimensional radix-2 FFT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1973543)