2007
DOI: 10.1109/lsp.2006.879983
|View full text |Cite
|
Sign up to set email alerts
|

FFT-Based Computation of Shift Invariant Analytic Wavelet Transform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…Displacement time history results analysis. The approximate center line of displacement data is rebuilt by the fast Fourier transform -based algorithm (Olkkonen et al, 2007;Zheng et al, 2019). According to a previous study Liu et al (2019a), dynamic responses at the center point are the most significant and typical.…”
Section: Experimental Results Analysismentioning
confidence: 99%
“…Displacement time history results analysis. The approximate center line of displacement data is rebuilt by the fast Fourier transform -based algorithm (Olkkonen et al, 2007;Zheng et al, 2019). According to a previous study Liu et al (2019a), dynamic responses at the center point are the most significant and typical.…”
Section: Experimental Results Analysismentioning
confidence: 99%
“…The CHT has a plenty of applications such as computation of the envelope and instantaneous frequency and the construction of the digital quadrature encoders and amplitude modulators. The FFT-based Hilbert transform algorithms [5,7] can be directly replaced by the CHT prefilter in the shift-invariant multi-scale analysis. We demonstrated the feasibility of the CHT filter in reconstruction of the sign modulated CMOS logic pulses traverling through a fibre optic link.…”
Section: Discussionmentioning
confidence: 99%
“…Hilbert transform has an essential role in constructing analytical signals for a variety of signal processing applications, for example in envelope and instantaneous frequency analysis and in design of amplitude modulators and digital quadrature encoders. The recent applications include Hilbert-Huang decomposition [1], the shift-invariant wavelet transform algorithms [2][3][4][5], geophysical [6], seismic, ultrasonic radar and biomedical signal analyses [7][8][9][10][11]. The Hilbert transform theory is well established, but the computational methods are still under development.…”
Section: Introductionmentioning
confidence: 99%
“…Owing to its high computation complexity, the DFT is replaced by fast Fourier transform (FFT) algorithm. In [1], FFT‐based computation is performed to derive decimated wavelet coefficient which is time invariant and free from aliasing. Similarly, FFT computation is used in OFDM system and highly Doppler distorted OFDM systems [2] which have more than one FFT operation.…”
Section: Introductionmentioning
confidence: 99%