The following pages link to On computing the 2-D FFT (Q2723624):
Displaying 12 items.
- Efficient 2D FFT implementation on mediaprocessors (Q436199) (← links)
- Subband DFT. I: Definition, interpretation and extensions (Q674029) (← links)
- Special-purpose computer for two-dimensional FFT (Q711121) (← links)
- Application of the fast Fourier transform to calculating pruned convolution (Q906117) (← links)
- A novel algorithm for computing the 2D split-vector-radix FFT (Q948432) (← links)
- Vector radix 2 \(\times\) 2 sliding fast Fourier transform (Q1792832) (← links)
- Fast unified computation of the multi-dimensional discrete sinusoidal transforms (Q1855852) (← links)
- 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 (Q2745489) (← links)
- On the two-dimensional vector split-radix FFT algorithm (Q3033287) (← links)
- 2D grid architectures for the DFT and the 2D DFT (Q4312806) (← links)
- A new proposed algorithm of arbitrary radix for the computation of the 2D DFT (Q4935718) (← links)
- Spectral transformations for two-dimensional filters via FFT (Q5349530) (← links)
