Transforming real-valued sequences: fast Fourier versus fast Hartley transform algorithms

Five programs for efficient computation of DFT of real-valued data are analyzed with respect to their operation counts vis-a-vis run times on weak and powerful floating-point processors. The results help dispose of the claims of superiority of FHT over corresponding real-valued FFT. The Bruun (1978) algorithm turns out to be a "best" performer.<
>