In mathematics, the Hartley transform is an integral transform closely related to the Fourier transform, but which transforms real-valued functions to real-valued functions. It was proposed as an alternative to the Fourier transform by Ralph Vinton Lyon Hartley in 1942, and is one of many known Fourier-related transforms. Compared to the Fourier transform, the Hartley transform has the advantages of transforming real functions to real functions (as opposed to requiring complex numbers) and of being its own inverse.

The discrete version of the transform, the Discrete Hartley transform, was introduced by R. N. Bracewell in 1983.

Definition

The Hartley transform of a function f(t) is defined by:

where ω can in applications be an angular frequency and

cas(t) = cos(t) + sin(t)

is the cosine-and-sine or Hartley kernel. In engineering terms, this transform takes a signal (function) from the time-domain to the Hartley spectral domain (frequency domain).

Inverse transform

The Hartley transform has the convenient property of being its own inverse:

Conventions

The above is in accord with Hartley's original definition, but (as with the Fourier transform) various minor details are matters of convention and can be changed without altering the essential properties:

• Instead of using the same transform for forward and inverse, one can remove the from the forward transform and use 1 / 2π for the inverse—or, indeed, any pair of normalizations whose product is 1 / 2π. (Such asymmetrical normalizations are sometimes found in both purely mathematical and engineering contexts.)
• One can also use 2πνt instead of ωt (i.e., frequency instead of angular frequency), in which case the coefficient is omitted entirely.
• One can use cos−sin instead of cos+sin as the kernel.

Relation to Fourier transform

This transform differs from the classic Fourier transform in the choice of the kernel. In the Fourier transform, we have the exponential kernel: where i is the imaginary unit.

The two transforms are closely related, however, and the Fourier transform (assuming it uses the same normalization convention) can be computed from the Hartley transform via:

where even and odd are the even and odd parts of f; that is,

and

Conversely, for real-valued functions f(t), the Hartley transform is given from the Fourier transform's real and imaginary parts:

where and denote the real and imaginary parts of the complex Fourier transform.

Properties

Once can see immediately from the definition that the Hartley transform is a real linear operator, and is symmetric (and Hermitian). From the symmetric and self-inverse properties, it follows that the transform is a unitary operator (indeed, orthogonal).

There is also an analogue of the convolution theorem for the Hartley transform.

The cas function itself has some interesting properties; for example, it has an angle-addition identity of:

2cas(a + b) = cas(a)cas(b) + cas( - a)cas(b) + cas(a)cas( - b) - cas( - a)cas( - b)

and its derivative is given by:

References

• Hartley, R. V. L., "A more symmetrical Fourier analysis applied to transmission problems," Proc. IRE 30, 144–150 (1942).

• Bracewell, R. N., The Fourier Transform and Its Applications (McGraw-Hill, 1965, 2nd ed. 1978, revised 1986) (also translated into Japanese and Polish)

• Bracewell, R. N., The Hartley Transform (Oxford University Press, 1986) (also translated into German and Russian)