Effective implementations of multi-dimensional radix-2 FFT
From MaRDI portal
Recommendations
- Publication:3204015
- 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)- The structure of vector radix fast Fourier transforms
- Special-purpose computer for two-dimensional FFT
- scientific article; zbMATH DE number 4180760 (Why is no real title available?)
- Multiplierless implementation of rotators and FFTs
- Vector coding algorithms for multidimensional discrete Fourier transform
- Calculation of radix-2 discrete multiresolution Fourier transform
- Efficient 2D FFT implementation on mediaprocessors
- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
- An Implementation of Multiple and Multivariate Fourier Transforms on Vector Processors
- On the two-dimensional vector split-radix FFT algorithm
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)
