The Relationship Between Two Fast Fourier Transforms
From MaRDI portal
Publication:5617297
DOI10.1109/T-C.1971.223236zbMath0214.42801MaRDI QIDQ5617297
Publication date: 1971
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
42A38: Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type
Related Items
EFFICIENT OVERLAPPED FFT ALGORITHMS FOR HYPERCUBE-CONNECTED MULTICOMPUTERS∗, Algebraic complexities and algebraic curves over finite fields, Realization of discrete Fourier transforms using a nesting algorithm, The enumeration of arrays and a generalization related to contingency tables, Implementation of a self-sorting in-place prime factor FFT algorithm, Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms, Matrix identities of the fast Fourier transform