On computing the 2-D FFT
From MaRDI portal
Recommendations
- In-place butterfly-style FFT of 2-D real sequences
- New fast algorithm for two-dimensional discrete Fourier transform DFT(2n; 2)
- A new two-dimensional fast cosine transform algorithm
- On the computation of two-dimensional DCT
- A new proposed algorithm of arbitrary radix for the computation of the 2D DFT
Cited in
(18)- Vector radix 2 2 sliding fast Fourier transform
- Fast unified computation of the multi-dimensional discrete sinusoidal transforms
- Some new explicit formulas for computing 2-D DFT of a real matrix and IDFT of 2-D DFT of another real matrix by a single 2-D DFT and their applications
- On the two-dimensional vector split-radix FFT algorithm
- Programming the WFTA for two-dimensional data
- In-place butterfly-style FFT of 2-D real sequences
- 2D grid architectures for the DFT and the 2D DFT
- Efficient 2D FFT implementation on mediaprocessors
- Two- and three-dimensional image rotation using the FFT
- A new proposed algorithm of arbitrary radix for the computation of the 2D DFT
- Spectral transformations for two-dimensional filters via FFT
- An efficient partitioning-based scheme for 2-D convolution and signal processing applications
- An exact FFT recovery theory: a nonsubtractive dither quantization approach with applications
- An exact FFT recovery theory: a nonsubtractive dither quantization approach with applications
- Subband DFT. I: Definition, interpretation and extensions
- Special-purpose computer for two-dimensional FFT
- Application of the fast Fourier transform to calculating pruned convolution
- A novel algorithm for computing the 2D split-vector-radix FFT
This page was built for publication: On computing the 2-D FFT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723624)
