Pages that link to "Item:Q1307712"
From MaRDI portal
The following pages link to An efficient algorithm for the computation of the multidimensional discrete Fourier transform (Q1307712):
Displaying 13 items.
- Estimation of horizontal and vertical translations of large images based on columns and rows mean energy matching (Q481840) (← links)
- Effective implementations of multi-dimensional radix-2 FFT (Q1973543) (← links)
- Multidimensional analytic signals and the Bedrosian identity (Q2445444) (← links)
- Vector coding algorithms for multidimensional discrete Fourier transform (Q2475397) (← links)
- Multidimensional polynomial transform algorithm for multidimensional discrete \(W\) transform (Q2723640) (← links)
- A new multidimensional FFT based on one-dimensional decompositions (Q2732962) (← links)
- (Q3362105) (← links)
- Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms (Q3468596) (← links)
- The design of optimal DFT algorithms using dynamic programming (Q3678627) (← links)
- (Q3974366) (← links)
- (Q4864906) (← links)
- A new proposed algorithm of arbitrary radix for the computation of the 2D DFT (Q4935718) (← links)
- (Q5209956) (← links)
