Answers are grounded in this paper and cite their sources.
The fast Hartley transform algorithm introduced in 1984 offers an alternative to the fast Fourier transform, with the advantages of not requiring complex arithmetic or a sign change of i to distinguish inverse transformation from direct. A two-dimensional extension is described that speeds up Fourier transformation of real digital images.
No takes yet. Share an insight, caveat, or question.
Bracewell et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: