p.4734
p.4742
p.4746
p.4750
p.4755
p.4759
p.4765
p.4770
p.4774
Fast Algorithm for Adaptive Gaussian Chirplet Signal Decomposition
Abstract:
It is well known that adaptive Gaussian chirplet signal decomposition algorithm has the best time frequency resolution in all signal decomposition algorithms. It is widely used in non linear and non stationary signal decomposition, especially for the signal which is superposition of chirplet functions decomposition. But it has a large amount of computation. In this paper, we propose a fast algorithm based on short time Fourier transform (STFT) method and we change parameters’ domain. Using this fast algorithm to decompose a four atoms non-linear signal computes very fast and it can also avoid the cross term’s interferer of the Wigner-Ville distribution.
Info:
Periodical:
Pages:
4755-4758
Citation:
Online since:
May 2014
Authors:
Price:
Сopyright:
© 2014 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: