The following pages link to (Q3974366):
Displaying 10 items.
- Fast computation of multidimensional DFT (Q1177501) (← links)
- An efficient algorithm for the computation of the multidimensional discrete Fourier transform (Q1307712) (← links)
- A version of the discrete Fourier transform with nodes on parallelepipedal lattices (Q1395319) (← links)
- Vector coding algorithms for multidimensional discrete Fourier transform (Q2475397) (← links)
- A new multidimensional FFT based on one-dimensional decompositions (Q2732962) (← links)
- The six-step algorithm for two-dimensional FFTs (Q2738598) (← links)
- On computing the discrete Fourier and cosine transforms (Q3757261) (← links)
- Vector computation of the discrete Fourier transform (Q4220994) (← links)
- (Q4226724) (← links)
- On the odd-DFT and its applications to DCT/IDCT computation (Q4587860) (← links)