A new efficient algorithm to compute the two-dimensional discrete Fourier transform
From MaRDI portal
Recommendations
- New algorithms for the multidimensional discrete Fourier transform
- Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
- New fast algorithm for two-dimensional discrete Fourier transform DFT(2n; 2)
- scientific article; zbMATH DE number 3885286
- Fast computation of multidimensional DFT
Cited in
(12)- Algorithm 991: The 2D tree sliding window discrete Fourier transform
- The development of the algorithm for estimating the spectral correlation function based on two-dimensional fast Fourier transform
- scientific article; zbMATH DE number 4216708 (Why is no real title available?)
- Shifted Fourier transform-based tensor algorithms for the 2-D DCT
- scientific article; zbMATH DE number 3885286 (Why is no real title available?)
- Computing discrete Fourier transform on a rectangular data array
- New algorithms for the multidimensional discrete Fourier transform
- scientific article; zbMATH DE number 817564 (Why is no real title available?)
- scientific article; zbMATH DE number 4149523 (Why is no real title available?)
- Fast computation of multidimensional DFT
- New Recursive Fast Radix-2 Algorithm for the Modulated Complex Lapped Transform
- Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution.
This page was built for publication: A new efficient algorithm to compute the two-dimensional discrete Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806772)