Computation of discrete Hilbert transform through fast Hartley transform
Soo‐Chang Pei, Sy-Been Jaw · IEEE Transactions on Circuits and Systems · 1989
A fast algorithm is proposed to compute the discrete Hilbert transform via the fast Hartley transform (FHT). Instead of the conventional fast Fourier transform (FFT) approach, the processing is carried out entirely in the real domain. Also, since many efficient FHT algorithms exist, the computation complexity can be greatly reduced from two complex FFTs into two real FHTs.>