%0 Journal Article %1 pei89 %A Pei, Soo-Chang %A Jaw, Sy-Been %D 1989 %J Circuits and Systems, IEEE Transactions on %K dft fourier hartley hilbert %N 9 %P 1251--1252 %R 10.1109/31.34675 %T Computation of Discrete Hilbert Transform through Fast Hartley transform %V 36 %X 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

@article{pei89, abstract = {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}, added-at = {2015-09-26T15:57:34.000+0200}, author = {Pei, Soo-Chang and Jaw, Sy-Been}, biburl = {https://www.bibsonomy.org/bibtex/265feb86f39ede44c3a8e00cd41792102/ytyoun}, doi = {10.1109/31.34675}, interhash = {e2edfd922a2588d950f7dcb0680f5bc9}, intrahash = {65feb86f39ede44c3a8e00cd41792102}, issn = {0098-4094}, journal = {Circuits and Systems, IEEE Transactions on}, keywords = {dft fourier hartley hilbert}, month = sep, number = 9, pages = {1251--1252}, timestamp = {2015-12-03T08:35:57.000+0100}, title = {Computation of Discrete {Hilbert} Transform through Fast {Hartley} transform}, volume = 36, year = 1989 }