Conversion of FFT’s to Fast Hartley Transforms
Oscar Buneman · SIAM Journal on Scientific and Statistical Computing · 1986
The complex Fourier transform of a real function and its real Hartley transform are expressed in terms of each other, allowing translation of theorems and computer programs between the two versions.Any FFT can thus be converted, by a few indexing changes, into a Fast Hartley Transform which is equally efficient, in terms of floating point operations per real datum transformed. The FHT can therefore transform one real array of length N in half the time that it takes the FFT to process a complex array of length N Several tricks to speed up both FHT and FFT are presented and a Fortran version of the FHT is supplied which delivers the result in $.75\log _2 N$ multiplications and $1.75\log _2 N$ additions.