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.>
No takes yet. Share an insight, caveat, or question.
Pei et al. (1989) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: