Title :
A comparison of the time involved in computing fast Hartley and fast Fourier transforms
Author_Institution :
University of Auckland, Auckland, New Zealand
Abstract :
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.
Keywords :
Algorithms; Arithmetic; Costs; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Kernel; Optimized production technology; Physics; Silicon compounds;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/PROC.1985.13381
