Abstract

Hilbert transform (HT) is an important tool in constructing analytic signals for various purposes, such as envelope and instantaneous frequency analysis, amplitude modulation, shift invariant wavelet analysis and Hilbert-Huang decomposition. In this work we introduce a method for computation of HT based on the discrete cosine transform (DCT). We show that the Hilbert transformed signal can be obtained by replacing the cosine kernel in inverse DCT by the sine kernel. We describe a FFT-based method for the computation of HT and the analytic signal. We show the usefulness of the proposed method in mechanical vibration and ultrasonic echo and transmission measurements.

Highlights

  • Hilbert transform (HT) plays an essential role in constructing analytic signals for a variety of signal and image processing applications

  • In this work we introduce a method for computation of HT based on the discrete cosine transform (DCT)

  • In this work we introduce a new method for computation of HT, which is based on the discrete cosine transform (DCT) [17,18,19,20,21]

Read more

Summary

Introduction

Hilbert transform (HT) plays an essential role in constructing analytic signals for a variety of signal and image processing applications. In this work we introduce a new method for computation of HT, which is based on the discrete cosine transform (DCT) [17,18,19,20,21]. The DCT has become the industry standard in signal processing society (digital filtering, data compression, image coding, HDTV etc.). The properties of the DCT are very close to the statistically optimal Karhunen-Loeve transform (KLT) for a large number of signal families. We review the FFT-based method for computation of the analytic signal. We introduce the DCT based method for computation of HT and describe some experimental results

Hilbert Transform
FFT Based Computation of the Analytic Signal
The Discrete Cosine Transform
Computation of HT Via the DCT
Experimental Results
Discussion and Conclusions
Hilbert Transform of the Cosine Function
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.