Fast Hartley transform algorithm

The discrete Hartley transform is a new tool for the analysis, design and implementation of digital signal processing algorithms and systems. It is strictly symmetrical concerning the transformation and its inverse. A new fast Hartley transform algorithm has been developed. Applied to real signals, it is faster than a real fast Fourier transform, especially in the case of the inverse transformation. The speed of operation for a fast convolution can thus be increased.