DocumentCode
1226513
Title
Computation of discrete Hilbert transform through fast Hartley transform
Author
Pei, Soo-Chang ; Jaw, Sy-been
Author_Institution
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
Volume
36
Issue
9
fYear
1989
fDate
9/1/1989 12:00:00 AM
Firstpage
1251
Lastpage
1252
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
Keywords
circuit theory; signal processing; transforms; computation complexity; discrete Hilbert transform; fast Hartley transform; fast algorithm; network theory; real domain processing; signal processing; Convolution; DH-HEMTs; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Signal analysis; Signal processing; Signal processing algorithms; Spectral analysis;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/31.34675
Filename
34675
Link To Document