Discrete Hartley transform is an analogue of discrete Fourier transform for real data. The Hartley transform takes a real sequence as an input. The result is also a real sequence:
For some time it was considered that Hartley transform can be a faster alternative to the real Fourier transform, but later it was found out that there are FFT algorithms, which are a little more efficient than the corresponding FHT algorithms. Thus, at present the Hartley transform is rarely used in practice.
ALGLIB package does not contain a specialized code for fast Hartley transform. Instead, the Hartley transform is converted into a real FFT the results of which are processed in time O(N).
This article is licensed for personal use only.
ALGLIB Project offers you two editions of ALGLIB:
ALGLIB Free Edition:
+delivered for free
+offers full set of numerical functionality
+extensive algorithmic optimizations
-no multithreading
-non-commercial license
ALGLIB Commercial Edition:
+flexible pricing
+offers full set of numerical functionality
+extensive algorithmic optimizations
+high performance (SMP, SIMD)
+commercial license with support plan
Links to download sections for Free and Commercial editions can be found below: