Fast Hartley transform algorithm
- 11 April 1985
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 21 (8) , 341-343
- https://doi.org/10.1049/el:19850241
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: