In recent years, time-frequency analysis (TFA) methods have received widespread attention and undergone rapid development. However, traditional TFA methods cannot achieve the desired effect when dealing with nonstationary signals. Therefore, this study proposes a new TFA method called the local maximum synchrosqueezing scaling-basis chirplet transform (LMSBCT), which is a further improvement of the scaling-basis chirplet transform (SBCT) with energy rearrangement in frequency and can be viewed as a good combination of SBCT and local maximum synchrosqueezing transform. A better concentration in terms of the time-frequency energy and a more accurate instantaneous frequency trajectory can be achieved using LMSBCT. The time-frequency distribution of strong frequency-modulated signals and multicomponent signals can be handled well, even for signals with close signal frequencies and low signal-to-noise ratios. Numerical simulations and real experiments were conducted to prove the superiority of the proposed method over traditional methods.

In response to the problems of biased estimation of instantaneous frequency (IF) and poor noise immunity in current time-frequency (TF) analysis methods, the Adaptive scale chirplet transform (ASCT) is proposed in this paper. The core idea of the proposed algorithm is to use a frequency-dependent quadratic polynomial kernel function to approximate the IF of the signal and to use the time-varying window length to overcome the frequency resolution problem due to the change in signal modulation. This method can dynamically select suitable parameters and overcome the disadvantage of unfocused energy of TF distribution. The experimental results show that the ASCT algorithm has high TF aggregation and can suppress noise interference well. In practical signal processing, the advantage of the ASCT algorithm is that it can accurately depict the characteristic frequency of the signal and detect the fault in the bearing signal. Both simulation and experimental results prove the strong realistic relevance of this algorithm.