A comparison of the time involved in computing fast Hartley and fast Fourier transforms
Gary E. J. Bold · Proceedings of the IEEE · 1985
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.