Answers are grounded in this paper and cite their sources.
Fast Fourier analysis (FFA) and fast Fourier synthesis (FFS) algorithms are developed for computing the discrete Fourier transform of a real series, and for synthesizing a real series from its complex Fourier coefficients. A FORTRAN program implementing both algorithms is given in the Appendix.
No takes yet. Share an insight, caveat, or question.
G. D. Bergland (1969) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: