Fast Algorithm for Adaptive Gaussian Chirplet Signal Decomposition
2014 ◽
Vol 556-562
◽
pp. 4755-4758
Keyword(s):
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.
2011 ◽
Vol 48-49
◽
pp. 555-560
◽
2011 ◽
Vol 214
◽
pp. 122-127
◽
2008 ◽
Vol 2008
◽
pp. 1-5
◽
2020 ◽
Vol 19
(01)
◽
pp. 71-105
◽
2015 ◽
Vol 12
(03)
◽
pp. 1550021
◽