New algorithms for the multidimensional discrete Fourier transform
From MaRDI portal
Publication:3678628
Recommendations
- A new efficient algorithm to compute the two-dimensional discrete Fourier transform
- scientific article; zbMATH DE number 11434
- scientific article; zbMATH DE number 4164117
- An efficient algorithm for the computation of the multidimensional discrete Fourier transform
- scientific article; zbMATH DE number 3915602
Cited in
(15)- Ring structures and the discrete Fourier transform
- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
- Fast computation of multidimensional DFT
- The inverse of an automorphism in polynomial time
- Multidimensional exploration of software implementations for DSP algorithms
- Multidimensional polynomial transform algorithm for multidimensional discrete W transform
- A new multidimensional FFT based on one-dimensional decompositions
- New algorithm for multidimensional type-III DCT
- The weighted redundancy transform
- A new efficient algorithm to compute the two-dimensional discrete Fourier transform
- scientific article; zbMATH DE number 11434 (Why is no real title available?)
- scientific article; zbMATH DE number 749495 (Why is no real title available?)
- A New Representation of FFT Algorithms Using Triangular Matrices
- Computational Science and Its Applications – ICCSA 2004
- Multidimensional Cooley-Tukey algorithms revisited
This page was built for publication: New algorithms for the multidimensional discrete Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678628)