Hartley transform


Also found in: Wikipedia.

Hartley transform

[ ]
(mathematics)
An analog of the Fourier transform for finite, real-valued data sets; for a function ƒ defined at N data values, 0, 1, 2, …, N - 1, the Hartley transform is a function, F, also defined on the set (0, 1, 2, …, N - 1), whose value at n is the sum over the variable r, from 0 through N - 1, of the quantity N -1 f (r) cas (2π nr / N), where cas θ=cosθ+sinθ.
References in periodicals archive ?
14] Hartley Transform and its Applications Saied Hosseini Khayat_ Electrical Engineering Department Ferdowsi University of Mashhad, Iran.
The energy from the preprocessed EEG epoch was extracted using a combination of Fast Hartley transform and Chebyshev filter.
In this paper we propose to measure energy of specific motor imageries in the brain signal using Fast Hartley transform along with the Chebyshev filter and selecting the ideal channels for the classification problem using the proposed support vector machine.
Hartley transform compared to Fourier transforms is a real function.
A very important property of Hartley Transform is its symmetry
Another important feature is that the transform pairs are both real which provides good computational advantages for Hartley Transform (HT) over the Fourier transform (FT).
The GDD0300 DSP Vector library provides a set of functions that perform commonly used DSP operations like Fast Fourier Transform, Fast Hartley Transform, Discrete Cosine Transform, FIR/IIR filters, coordinate transformations, vector operations, complex number arithmetic operations, pseudo-random numbers generation and data conditioning (spectral windows) operations.