Pages that link to "Item:Q3031888"
From MaRDI portal
The following pages link to New fast algorithm for two-dimensional discrete Fourier transform DFT(2<sup>n</sup>; 2) (Q3031888):
Displaying 11 items.
- A fast algorithm for the \(n\)-D discrete cosine transform (Q1129829) (← links)
- Two dimensional fast Fourier transform for large data matrices (Q1330618) (← links)
- Algorithms of two-dimensional discrete orthogonal transforms realized in Hamilton-Eisenstein codes (Q1814648) (← links)
- On computing the 2-D FFT (Q2723624) (← links)
- A refined fast 2-D discrete cosine transform algorithm (Q2732816) (← 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)
- Theory and algorithms for two-dimensional warped discrete Fourier transform (Q3181335) (← links)
- Fast discrete Radon transform and 2-D discrete Fourier transform (Q3361853) (← links)
- (Q3362105) (← links)
- A new proposed algorithm of arbitrary radix for the computation of the 2D DFT (Q4935718) (← links)
- Numerical inversion of 2-D Laplace transforms by fast Hartley transform computations (Q5926835) (← links)
