The Relationship Between Two Fast Fourier Transforms

DOI10.1109/T-C.1971.223236zbMath0214.42801OpenAlexW1987741783MaRDI QIDQ5617297

Irving John Good

Publication date: 1971

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1971.223236

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38)

Related Items

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, EFFICIENT OVERLAPPED FFT ALGORITHMS FOR HYPERCUBE-CONNECTED MULTICOMPUTERS∗, The enumeration of arrays and a generalization related to contingency tables, Unitarily inequivalent local and global Fourier transforms in multipartite quantum systems, An analytic function approach to weak mutually unbiased bases, Matrix identities of the fast Fourier transform, Mutually unbiased projectors and duality between lines and bases in finite quantum systems, Construction of Binary Bent Functions by FFT-Like Permutation Algorithms, Algebraic complexities and algebraic curves over finite fields, Realization of discrete Fourier transforms using a nesting algorithm, Quantum mechanics on ${\mathbb Q}/{\mathbb Z}$Q/Z