A new look at the comparison of the fast Hartley and Fourier transforms

In the correspondence, a fair comparative analysis of algorithms for the fast Hartley transform (FHT) and the real valued fast Fourier transform (RVFFT) is presented. The complexity analysis and run-time comparisons are conducted and explained simultaneously. The complexity analysis shows great similarity between RVFFT and FHT. The run-time comparisons also show negligible differences, with some small advantages to RVFFT. The influence of the compiler on the execution time may be more significant than the choice of the algorithm. Also, a new and more accurate model for the prediction of execution time of the algorithm is proposed. >

[1]  Hsieh S. Hou,et al.  The Fast Hartley Transform Algorithm , 1987, IEEE Transactions on Computers.

[2]  R. Bracewell.  The fast Hartley transform , 1984, Proceedings of the IEEE.

[3]  Douglas L. Jones,et al.  On computing the discrete Hartley transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[4]  Martin Vetterli,et al.  Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data , 1987, IEEE Trans. Acoust. Speech Signal Process..

[5]  A. J. van der Steen.  Timing of some fast DFT-algorithms , 1983 .

[6]  Ronald N. Bracewell.  Assessing the Hartley transform , 1990, IEEE Trans. Acoust. Speech Signal Process..

[7]  Douglas L. Jones,et al.  Real-valued fast Fourier transform algorithms , 1987, IEEE Trans. Acoust. Speech Signal Process..

[8]  Ronald N. Bracewell.  The Hartley transform , 1986 .

[9]  Pedro L. Rustan,et al.  Effects of architecture implementation on DFT algorithm performance , 1985, IEEE Trans. Acoust. Speech Signal Process..