The discrete Hartley transform (DHT) resembles the discrete Fourier transform (DFT) but is free from two characteristics of the DFT that are sometimes computationally undesirable. The inverse DHT is identical with the direct transform, and so it is not necessary to keep track of the +<i>i</i> and −<i>i</i> versions as with the DFT. Also, the DHT has real rather than complex values and thus does not require provision for complex arithmetic or separately managed storage for real and imaginary parts. Nevertheless, the DFT is directly obtainable from the DHT by a simple additive operation. In most iniage-processing applications the convolution of two data sequences <i>f</i><sub>1</sub> and <i>f</i><sub>2</sub> is given by DHT of [(DHT of <i>f</i><sub>l</sub>) times; (DHT of <i>f</i><sub>2</sub>)], which is a rather simpler algorithm than the DFT permits, especially if images are. to be manipulated in two dimensions. It permits faster computing. Since the speed of the fast Fourier transform depends on the number of multiplications, and since one complex multiplication equals four real multiplications, a fast Hartley transform also promises to speed up Fourier-transform calculations. The name discrete Hartley transform is proposed because the DHT bears the same relation to an integral transform described by Hartley [R. V. L. Hartley, Proc. IRE 30,144 (1942)] as the DFT bears to the Fourier transform.
© 1983 Optical Society of America
R. N. Bracewell, "Discrete Hartley transform," J. Opt. Soc. Am. 73, 1832-1835 (1983)