Answers are grounded in this paper and cite their sources.
It is shown that the DFT of a real sequence, formed via the Fast Hartley Transform, can be computed at most only 2 times faster than by using a complex Fast Fourier Transform. However, more sophisticated FFT algorithms exist which give the same speedup factor. A simple FHT subroutine is presented to illustrate the similarity of the FHT and FFT butterflies in their simplest forms.
No takes yet. Share an insight, caveat, or question.
Gary E. J. Bold (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: