On computing the Discrete Fourier Transform
From MaRDI portal
Publication:4086677
DOI10.1073/pnas.73.4.1005zbMath0323.65050OpenAlexW2005015931WikidataQ34995117 ScholiaQ34995117MaRDI QIDQ4086677
Publication date: 1976
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.73.4.1005
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40) Algorithms in computer science (68W99)
Related Items (18)
Tighter Fourier Transform Lower Bounds ⋮ Index transforms for N-dimensional DFT's ⋮ A Vector Implementation of the Fast Fourier Transform Algorithm ⋮ Fast generalized Fourier transforms ⋮ Non-parametric methods of system identification ⋮ The double determinant of Vandermonde's type over quaternion field ⋮ Morphological transform for image compression ⋮ Modified FFTs for Fused Multiply-Add Architectures ⋮ On multiplication in algebraic extension fields ⋮ On the number of active *-operations needed to compute the discrete Fourier transform ⋮ Accelerations of Zhao's methods for the numerical inversion of Laplace transform ⋮ Paraunitary matrices, entropy, algebraic condition number and Fourier computation ⋮ Group Convolutions and Matrix Transforms ⋮ An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model ⋮ Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations ⋮ Is computing with the finite Fourier transform pure or applied mathematics? ⋮ Gauss and the history of the fast Fourier transform ⋮ Improved upper complexity bounds for the discrete Fourier transform
This page was built for publication: On computing the Discrete Fourier Transform
