Computation of Discrete Hilbert Transform Through Fast Hartley Transform
Journal
Transaction on Circuits & Systems
Journal Volume
36
Journal Issue
9
Pages
1251-1252
Date Issued
1989-09
Date
1989-09
Author(s)
Jaw, Sy-Been
Abstract
A new 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 many efficient fast algorithms exist for computing the discrete Hartley transform, the computation complexity can be greatly reduced from 2 complex FFTs into 2 real FHT's. © 1989 IEEE
Other Subjects
Signal Processing; Discrete Hilbert Transform; Fast Hartley Transform; Mathematical Transformations
Publisher
Taipei:National Taiwan University Dept Phys
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
10768.pdf
Size
143.45 KB
Format
Adobe PDF
Checksum
(MD5):65613fee619d52d1cabe1ebe39e4b8be