This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

A Chirplet Transform-based Mode Retrieval Method for Multicomponent Signals with Crossover Instantaneous Frequencies

Lin Li, Ningning Han, Qingtang Jiang, Charles K.Chui School of Electronic Engineering, Xidian University, Xi’an, China. e-mail: [email protected] Key Laboratory of Advanced Machine Learning and Applications, College of Mathematics and Statistics, Shenzhen University, Shenzhen, 518060, China. e-mail: [email protected] of Mathematics and Statistics, University of Missouri-St. Louis, St. Louis, MO, USA. e-mail:[email protected] of Statistics, Stanford University, Stanford, CA 94305, USA, and Department of Mathematics, Hong Kong Baptist University, Hong Kong. e-mail: [email protected].
Abstract

In nature and engineering world, the acquired signals are usually affected by multiple complicated factors and appear as multicomponent nonstationary modes. In such and many other situations, it is necessary to separate these signals into a finite number of monocomponents to represent the intrinsic modes and underlying dynamics implicated in the source signals. In this paper, we consider the mode retrieval of a multicomponent signal which has crossing instantaneous frequencies (IFs), meaning that some of the components of the signal overlap in the time-frequency domain. We use the chirplet transform (CT) to represent a multicomponent signal in the three-dimensional space of time, frequency and chirp rate and introduce a CT-based signal separation scheme (CT3S) to retrieve modes. In addition, we analyze the error bounds for IF estimation and component recovery with this scheme. We also propose a matched-filter along certain specific time-frequency lines with respect to the chirp rate to make nonstationary signals be further separated and more concentrated in the three-dimensional space of CT. Furthermore, based on the approximation of source signals with linear chirps at any local time, we propose an innovative signal reconstruction algorithm, called the group filter-matched CT3S (GFCT3S), which also takes a group of components into consideration simultaneously. GFCT3S is suitable for signals with crossing IFs. It also decreases component recovery errors when the IFs curves of different components are not crossover, but fast-varying and close to one and other. Numerical experiments on synthetic and real signals show our method is more accurate and consistent in signal separation than the empirical mode decomposition, synchrosqueezing transform, and other approaches.

(Note: This is the revised paper of “A separation method for multicomponent non-stationary signals with crossover instantaneous frequencies,” which was submitted to IEEE Trans IT on Feb 14, 2020, ms # IT-20-0113. Compared to the original paper, some references were added. In addition, mode retrieval comparison results with Fast-IF and ACMD were provided.)

Keywords: chirplet transform, filter-matched chirplet transform, signal separation, mode retrieval, multicomponent signals with crossing instantaneous frequencies.

1 Introduction

This paper studies blind source nonstationary signal separation in which a nonstationary signal is represented as a superposition of Fourier-like oscillatory modes:

x(t)=A0(t)+k=1Kxk(t),xk(t)=Ak(t)cos(2πϕk(t)),x(t)=A_{0}(t)+\sum_{k=1}^{K}x_{k}(t),\quad x_{k}(t)=A_{k}(t)\cos\big{(}2\pi\phi_{k}(t)\big{)}, (1)

with Ak(t),ϕk(t)>0A_{k}(t),\phi_{k}^{\prime}(t)>0 and Ak(t)A_{k}(t) varying slowly. Such a representation, called an adaptive harmonic model (AHM) representation, is important for extracting information, such as the underlying dynamics, hidden in the nonstationary signal, with the trend A0(t)A_{0}(t), instantaneous amplitudes (IAs) Ak(t)A_{k}(t) and the instantaneous frequencies (IFs) ϕk(t)\phi^{\prime}_{k}(t) being used to describe the underlying dynamics.

In nature, many real-world phenomena that can be formulated as signals (or in terms of time series) are often affected by a number of factors and appear as time-overlapping multicomponent signals in the form of (1). A natural approach to understand and process such phenomena is to decompose, or even better, to separate the multicomponent signals into their basic building blocks xk(t)x_{k}(t) (called components, modes or sub-signals) for extracting the necessary features. Also, for radar, communications, and other applications, signals often appear in multicomponent modes. Since these signals are mainly nonstationary, meaning the amplitudes and/or phases of some or all components change with the time, there have been few effective rigorous methods available for decomposition of them.

The empirical mode decomposition (EMD) algorithm along with the Hilbert spectrum analysis (HSA) is a popular method to decompose and analyze nonstationary signals [1]. EMD works like a filter bank [2, 3] to decompose a nonstationary signal into a superposition of intrinsic mode functions (IMFs) and a trend, and then the IF of each IMF is calculated by HSA. There are many articles studying the properties of EMD and variants of EMD have been proposed to improve the performance, see e.g. [2]-[14]. In particular, the separation ability of EMD was discussed in [4], which shows that EMD cannot decompose two components when their frequencies are close to each other. The ensemble EMD (EEMD) was proposed to suppress noise interferences [5]. The original EMD was extended to multivariate signals in [6, 8, 3]. Alternative sifting algorithms and formulations for EMD were introduced in [7, 9, 11]. Similar to the EMD filter bank, the wavelet filter bank for signal decomposition was proposed in [12], called empirical wavelet transform. An EMD-like sifting process was recently proposed in [13] to extract signal components in the linear time-frequency (TF) plane one by one. EMD is an efficient data-driven approach and no basis of functions is required. A weakness of EMD or EEMD is that it can easily lead to mode mixtures or artifacts, namely undesirable or false components [15]. In addition, there is no mathematical theorem to guarantee the recovery of the components.

Time-frequency analysis is another method to separate multicomponent signals, which is widely used in engineering fields such as communication, radar and sonar as a powerful tool for analyzing signals [16]. Time-frequency signal analysis and synthesis using the eigenvalue decomposition method have been studied [17, 18, 19]. Recently the synchrosqueezing transform (SST) was developed in [20] to provide mathematical theorems to guarantee the component recovery of nonstationary multicomponent signals. The SST, which was first introduced in 1996, intended for speech signal separation [21], is based on the continuous wavelet transform (CWT). The short-time Fourier transform (STFT)-based SST was also proposed in [22, 23] and further studied in [24]. SST provides an alternative to the EMD method and its variants, and it overcomes some limitations of the EMD and EEMD schemes [25, 26]. SST has been used in machine fault diagnosis [27, 28], crystal image analysis [29, 30], welding crack acoustic emission signal analysis [31], medical data analysis [32, 33, 34], etc.

SST works well for sinusoidal signals, but not for broadband time-varying frequency signals. To provide sharp representations for signals with significantly frequency changes, two methods were proposed. One is the matching demodulation transform-based SST (or called the instantaneous frequency-embedded SST) proposed in [35, 36] which changes broadband signals to narrow-band signals (see also [37]). The instantaneous frequency-embedded SST proposed in [36] preserves the IFs of the original signals. The other method is the 2nd-order SST introduced in [38] and [39]. The higher-order FSST was presented in [40] and [41], which aims to handle signals containing more general types. Very recently an adaptive SST with a time-varying parameter were introduced in [42, 43]. They obtained the well-separated condition for multicomponent signals using the linear frequency modulation to approximate a nonstationary signal at any local time. In addition, theoretical analysis of adaptive SST was obtained in [44, 45]. SST with a time-varying window width has also been studied in [46, 47].

Recently, a direct time-frequency approach, called signal separation operator (SSO), was introduced in [48] for multicomponent signal separation. In SSO approach, the components are reconstructed simply by substituting the time-frequency ridge to SSO. SSO based on CWT was proposed in [49, 50]. More recently, [51] proposed SSO of “linear chirp-based model” with the phase functions of the signal components in the source signal model (1) approximated by quadratic polynomials at any local time. This model provides a more accurate component recovery formulae, with analysis established in [52, 50].

While SST and SSO are mathematically rigorous on IF estimation and component recovery, both of them require that the components xk(t)x_{k}(t) are well-separated in the time-frequency plane, namely IFs of xk(t)x_{k}(t) satisfy

ϕk(t)ϕk1(t)2, 2kK,\phi^{\prime}_{k}(t)-\phi^{\prime}_{k-1}(t)\geq 2\triangle,\;2\leq k\leq K, (2)

for some >0\triangle>0. In many applications, multicomponent signals are overlapping in the time-frequency plane, that is the IFs of its components are crossover. For example, in radar signal processing, the micro-Doppler

Refer to caption
Refer to caption
Figure 1: Micro-Doppler modulations induced by target’s tumbling (Right) and their STFTs (Left).

effects are represented by highly nonstationary signals, when the target or any structure on the target undergoes micro-motion dynamics, such as mechanical vibrations, rotations, or tumbling and coning motions [53, 54]. Figure 1 shows simulated micro-Doppler modulations (two sinusoidal signals) induced by two target’s tumbling motions and their short-time Fourier transforms (SFTFs). In practice we need to recover each components or at least the main body signature corresponding to the target’s motion in the radar signal processing.

We say two components xk1(t)x_{k-1}(t) and xk(t)x_{k}(t) in (1) are overlapping in time-frequency plane when the IF curves of them are crossing at t=t0t=t_{0}, i.e., ϕk1(t0)=ϕk(t0)\phi_{k-1}^{{}^{\prime}}(t_{0})=\phi_{k}^{{}^{\prime}}(t_{0}). In this paper we consider multicomponent signals of the form (1) satisfying

|ϕk(t)ϕ(t)|+ρ|ϕk′′(t)ϕ′′(t)|2,|\phi^{\prime}_{k}(t)-\phi^{\prime}_{\ell}(t)|+\rho|\phi^{\prime\prime}_{k}(t)-\phi^{\prime\prime}_{\ell}(t)|\geq 2\triangle, (3)

where ρ0\rho\geq 0 is the regularization parameter and >0\triangle>0 is called the separation resolution. When ρ=0\rho=0, (3) is reduced to the well-separated condition (2) required for SST and SSO. Condition (3) allows the IFs of some components xk(t)x_{k}(t) to cross as long as their chirp rates ϕk′′(t)\phi_{k}^{\prime\prime}(t) are different near the time t0t_{0} where IFs crossing occurs.

Recently, many studies have been devoted to estimations of crossing instantaneous frequencies. An algorithm based on linear least square fitting technique was introduced [55]. In [56], the authors employed a three-dimensional parameter space (time, frequency, chirp rate) to estimate instantaneous frequencies and chirp rates jointly of signal, which can make the crossing of IFs appear as separated in the time-frequency-chirprate domain. Furthermore, [56] proposed a three-dimensional ridge detection algorithm. [57] used time-frequency analysis and Radon transform for the unsupervised separation of frequency modulated signals in noisy environment. The chirp rates were also introduced in [58], where estimations of IFs were turned into the resolution of a two-dimensional linear system. Effective quasi maximum likelihood–random samples consensus algorithm was also proposed for IF estimation of overlapping signals in the time-frequency (TF) plane [59].

Moreover, [54] developed a compressive sensing approach to recover stationary narrowband signals contaminated by strong nonstationary signals. An algorithm for estimations of IFs of signals with intersecting signatures in the time-frequency domain is proposed in [60]. Using the estimated IF, the corresponding component is removed from the mixture signal based on de-chirping method [60]. [61] combined parameterized de-chirping and band-pass filter to obtain components of multi-component signal, which avoided dealing with time-frequency representation of the signal and worked well under heavy noise. [62] introduced a novel nonparametric algorithm called ridge path regrouping to extract the IFs of the overlapped components and recover the corresponding component by using the intrinsic chirp component decomposition method. The time-frequency distribution (with a cross-term) [63] was used to estimate IFs. In [64], the authors developed a general model to characterize multi-component chirp signals, where IFs and instantaneous amplitudes of the intrinsic chirp components were modeled as Fourier series. Similarly, a multivariate intrinsic chirp mode was defined in [65]. Then IFs can be estimated using the framework of the general parameterized time-frequency transform and the corresponding multivariate intrinsic chirp modes were reconstructed by solving multivariate linear equations through an extended least square method [65]. Variational nonlinear chirp mode decomposition was employed to separate close or even crossed modes in [66]. In [67], the blind source was decomposed into a series of nonlinear chirp components and the reconstructed nonlinear chirp components can be clustered into corresponding intrinsic chirp sources. The frequency-domain intrinsic component decomposition method was proposed to characterize nonlinear and non-monotonic nonlinear group delays in frequency domain by using different kernel functions and separate and reconstruct each mode simultaneously as a time-frequency filter [68]. An adaptive chirp mode pursuit was proposed to capture signal modes one by one in a recursive framework [69]. In [70], the authors transformed a two-dimensional sinusoidal pattern into a single point in a two-dimensional plane and reconstructed signals from a reduced set of observations (back-projections).

In this paper, using the idea of SSO, we propose a chirplet transform-based signal separation scheme (CT3S) to retrieve modes of multicomponent signals with crossover IFs. Our algorithm addresses the inverse transform and aims to retrieve modes of multicomponent signals with fast varying IFs, even crossing IFs, while the aforementioned papers use the chirplet transform to obtain IFs. Most importantly, we provide a mathematically rigorous theorem which guarantees the recovery of components of multicomponent signals satisfying (3) with CT3S. To our best knowledge, there is no existing literature that establishes mathematical theorems to guarantee the recovery of the components overlapping in the time-frequency plane. Furthermore, we use a matched-filter along the specific time-frequency lines respect to the chirp rate to make different components be further separated and more concentrated in the three dimensional space of the chirplet transform. Based on the approximation of source signals with linear chirps at any local time, we propose an innovative signal reconstruction algorithm, called group filter-matched CT3S (GFCT3S), which takes a group of components into consideration simultaneously. GFCT3S is more suitable for signals with crossing IFs. When the IFs curves of different components are not crossover, but fast-varying and close to each other, our reconstruction algorithm will decrease the recovery errors significantly.

The remainder of this paper is organized as follows. In Section 2, we first review the signal separation methods by SST and SSO. After that we state the problem of recovering sub-signals with crossing IFs. In Section 3, we state our theorem which guarantees the recovery of components for multicomponent signal satisfying (3) with CT3S. We also introduce the filtered chirplet transform and propose GFCT3S for separating multicomponent signals with fast-varying and crossing IFs. We present the numerical experiments in Section 4. A conclusion is then presented in Section 5.

2 Problem statement

The (modified) STFT of signal x(t)L2()x(t)\in L_{2}({\mathbb{R}}) with a window function g(t)L2()g(t)\in L_{2}({\mathbb{R}}) is defined by,

Vx(t,η)=x(τ)g(τt)ei2πη(τt)𝑑τ,V_{x}(t,\eta)=\int_{{\mathbb{R}}}x(\tau)g(\tau-t)e^{-i2\pi\eta(\tau-t)}d\tau, (4)

If g(0)0g(0)\not=0, then the original signal x(t)x(t) can be recovered back from its STFT:

x(t)=1g(0)Vx(t,η)𝑑η.x(t)=\frac{1}{g(0)}\int_{\mathbb{R}}V_{x}(t,\eta)d\eta. (5)

For multicomponent signal x(t)x(t) in (1) satisfying the separation condition (2), the sub-signal xk(t)x_{k}(t) can be recovered by

xk(t)1g(0)|ηϕk(t)|<Γ1Vx(t,η)𝑑η,x_{k}(t)\approx\frac{1}{g(0)}\int_{|\eta-\phi_{k}^{\prime}(t)|<\Gamma_{1}}V_{x}(t,\eta)d\eta, (6)

for some Γ1>0\Gamma_{1}>0.

To enhance the time-frequency resolution and concentration, the idea of SST is to reassign the frequency variable. As in [22], denote

ωx(t,η)=tVx(t,η)i2πVx(t,η).\omega_{x}(t,\eta)=\frac{\frac{\partial}{\partial t}V_{x}(t,\eta)}{i2\pi V_{x}(t,\eta)}. (7)

The quantity ωx(t,η)\omega_{x}(t,\eta) is called the “phase transformation” [20]. The STFT-based SST is to reassign the frequency variable η\eta by transforming the STFT Vx(t,η)V_{x}(t,\eta) of x(t)x(t) to a quantity, denoted by Rx(t,η)R_{x}(t,\eta), on the time-frequency plane:

Rx(t,η)={ξ:Vx(t,ξ)0}Vx(t,ξ)δ(ωx(t,ξ)η)𝑑ξ.R_{x}(t,\eta)=\int_{\{\xi:V_{x}(t,\xi)\not=0\}}V_{x}(t,\xi)\delta\left(\omega_{x}(t,\xi)-\eta\right)d\xi. (8)
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Figure 2: Results of component recovery of two-component signal f(t)f(t) in (13). Source signal f(t)f(t): Waveform and IFs (Top row, from left to right); Time-frequency diagrams: STFT, SST, 2nd-order SST and estimated IFs by our proposed filter-matched CT (Second row, from left to right); Recovery results of f1(t)f_{1}(t) by different methods: EMD, 2nd-order SST, SSO and proposed method GFCT3S (Third row, from left to right); Recovery results of f2(t)f_{2}(t) by different methods: EMD, 2nd-order SST, SSO and proposed method GFCT3S (Bottom row, from left to right).

One also has a reconstruction formula of xk(t)x_{k}(t) similar to (6) with Vx(t,ξ)V_{x}(t,\xi) replaced by Rx(t,ξ)R_{x}(t,\xi).

Observe that signal reconstructions with the STFT and SST depend on the IF estimation of ϕk(t)\phi_{k}^{\prime}(t) and a given threshold Γ1\Gamma_{1}, hence it is indirect. In contrast, signal separation operator (SSO) [48] extracts signal components via local frequencies directly. The SSO Ta,δT_{a,\delta}, which is applied to signals xx in (1), is defined by

(Ta,δx)(t,η)=1anx(tnδ)h(na)ei2πnη,\left(T_{a,\delta}x\right)(t,\eta)=\frac{1}{\hbar_{a}}\sum\limits_{n\in{\mathbb{Z}}}x(t-n\delta)h\left(\frac{n}{a}\right)e^{i2\pi n\eta}, (9)

where hh is a compactly supported window function, η[0,1]\eta\in[0,1] and δ,a>0\delta,a>0 are parameters, with aa so chosen that

a=nh(na)>0.\hbar_{a}=\sum\limits_{n\in{\mathbb{Z}}}h\left(\frac{n}{a}\right)>0. (10)

For a multicomponent signal x(t)x(t) defined in (1), satisfying certain conditions including the well-separation condition (2), the set

{η[0,1]:|(Ta,δx)(t,η)|>Γ2}\left\{\eta\in[0,1]:|\left(T_{a,\delta}x\right)(t,\eta)|>\Gamma_{2}\right\}

can be expressed as a disjoint union of exactly KK non-empty sets Θ,=1,2,,K\Theta_{\ell},\ell=1,2,...,K, corresponding to the KK components of x(t)x(t). The sub-signal xk(t)x_{k}(t) can be reconstructed by,

x^k(t)=2e{(Ta,δx)(t,η^k)},\widehat{x}_{k}(t)=2\Re e\left\{\left(T_{a,\delta}x\right)(t,\widehat{\eta}_{k})\right\}, (11)

where

η^k(t)=argmaxηΘk|(Ta,δx)(t,η)|.\widehat{\eta}_{k}(t)=\arg\mathop{\max}\limits_{\eta\in\Theta_{k}}|\left(T_{a,\delta}x\right)(t,\eta)|. (12)

As mentioned in Section 1, to recover components xk(t)x_{k}(t) with SST or SSO, it is required all IFs of different components be separated from each other, namely they be far away from each other and non-crossing as shown in (2). In particular, there is no mathematical theorem to guarantee the recovery of the waveforms of components when their IFs are crossover with only one observation x(t)x(t) available. This paper is to provide a method to retrieve modes of such nonstationary multicomponent signals and establish retrieve error bounds. Next let us consider an example to show the performances of EMD, SST, SSO and our proposed method GFCT3S in retrieving the modes of a signal with crossover IFs.

Let f(t)f(t) be the two-component signal introduced in [20]:

f(t)=f1(t)+f2(t)=cos(t2+t+cos(t))+cos(8t).f(t)=f_{1}(t)+f_{2}(t)=\cos\left(t^{2}+t+\cos(t)\right)+\cos(8t). (13)

Here we let the sampling rate Fs=20F_{s}=20Hz and we only analyze the truncation signal on t[0,256/Fs]t\in[0,256/F_{s}], with 256256 discrete sampling points. The instantaneous frequencies of f1(t)f_{1}(t) and f2(t)f_{2}(t) are ϕ1(t)=(2t+1sin(t))/(2π)\phi_{1}^{\prime}(t)=(2t+1-\sin(t))/(2\pi) and ϕ2(t)=4/π\phi_{2}^{\prime}(t)=4/\pi, respectively.

Figure 2 shows the recovery results of f1(t)f_{1}(t) and f2(t)f_{2}(t). Observe that compared to the STFT and the STFT-based SST, the 2nd-order SST of f(t)f(t) represents this two-component signal with crossing IF curves much sharper and clearer. However, the existing methods including EMD [1], SST [22], the 2nd-order SST [38] and SSO [48] are unable to recover the waveforms f1(t)f_{1}(t) and f2(t)f_{2}(t) accurately, see the recovered f1f_{1} and f2f_{2} by these methods in Figure 2. Our proposed GFCT3S in Algorithm 1 provided in Section 3.2 can recover the two components accurately as shown in the 4th panels (from the left) in Row 3 and Row 4 respectively in Figure 2. Note that EMD, SST, 2nd-order SST and SSO all result in big recovery errors for either f1f_{1} or f2f_{2} around t0=3.38t_{0}=3.38 where IFs crossing occurs, while our method produces very small errors near t0t_{0}. The boundary effect is unavoidable for all methods since we only use the truncation signal for 0t12.80\leq t\leq 12.8 and the boundary extension has not be considered in this example. In addition, in this example we simply use the same Gaussian window with constant variance σ=1.6\sigma=1.6 for STFT, SST, the 2nd-order SST, SSO and GFCT3S .

3 Chirplet transform-based signal separation scheme

In this section we propose a chirplet transform-based signal separation scheme (CT3S) to retrieve modes. We provide the main theorem on component recovery analysis. In addition, we introduce filtered chirplet transform (CT) to make IFs crossover components further separated and more concentrated in the three-dimensional space of CT. Finally, to improve the performance of CT3S in mode retrieval, we present an algorithm, called group filter-matched CT3S or GFTC3S for short, based on filtered CT and the approximation of source signals with linear chirps at any local time.

3.1 Main results

The chirplet transform (CT) applied to a signal x(t)x(t) is defined by (see [71]-[74])

𝔖x(t,η,λ)\displaystyle\mathfrak{S}_{x}(t,\eta,\lambda)\hskip-17.07182pt =x(τ)1σg(τtσ)ei2πη(τt)iπλ(τt)2𝑑τ\displaystyle=\int_{{\mathbb{R}}}x(\tau)\frac{1}{\sigma}g\big{(}\frac{\tau-t}{\sigma}\big{)}e^{-i2\pi\eta(\tau-t)-i\pi\lambda(\tau-t)^{2}}d\tau
=x(t+τ)1σg(τσ)ei2πητiπλτ2𝑑τ,\displaystyle=\int_{{\mathbb{R}}}x(t+\tau)\frac{1}{\sigma}g\big{(}\frac{\tau}{\sigma}\big{)}e^{-i2\pi\eta\tau-i\pi\lambda\tau^{2}}d\tau,

where g(t)g(t) is a window function and σ>0\sigma>0. 𝔖x\mathfrak{S}_{x} is also called the localized polynomial Fourier transform (of order 2), see [75, 76]. Observe that when λ=0\lambda=0, 𝔖x(t,η,λ)\mathfrak{S}_{x}(t,\eta,\lambda) is the STFT. Thus we can also regard 𝔖x(t,η,λ)\mathfrak{S}_{x}(t,\eta,\lambda) as the STFT after the quadratic term eiπλτ2e^{-i\pi\lambda\tau^{2}} is added to match the local change of a non-stationary signal. Hence, we also call it the localized quadratic-phase Fourier transform in an early version of this paper.

The CT represents a multicomponent signal in a three-dimension space of time, frequency and chirp rate. Note that when the IF curves of two components xk1(t)x_{k-1}(t) and xk(t)x_{k}(t) are crossing, they may be well-separated in the three-dimensional space of the CT if ϕk1′′(t)ϕk′′(t)\phi_{k-1}^{{\prime}{\prime}}(t)\not=\phi_{k}^{{\prime}{\prime}}(t) for tt near the crossover time t0t_{0}. Thus a multicomponent signal with IFs crossover components could be well-separated in the three-dimensional space of the CT, and hence, it is feasible to propose to reconstruct its components based on the CT.

In the following definition, we give some conditions on Ak(t),ϕk(t)A_{k}(t),\phi_{k}(t) under which the CT-based approach can estimate IFs and retrieve modes with certain error bounds.

Refer to caption
Refer to caption
Figure 3: STFT, and a fixed slice of the CT of s(t). Left: STFT |Vx(t,η)||V_{x}(t,\eta)|; Right: |𝔖s(t,26/N,λ)||\mathfrak{S}_{s}(t,26/N,\lambda)|.
Definition 1.

For an α>0\alpha>0, let 𝒜α\mathcal{A}_{\alpha} denote the set consisting of (complex) adaptive harmonic models (AHMs) of the form

x(t)=A0(t)+k=1Kxk(t)=k=0KAk(t)ei2πϕk(t),x(t)=A_{0}(t)+\sum_{k=1}^{K}x_{k}(t)=\sum_{k=0}^{K}A_{k}(t)e^{i2\pi\phi_{k}(t)}, (15)

with Ak(t)L(),Ak(t)>0,ϕk(t)C3(),inftϕk(t)>0,suptϕk(t)<A_{k}(t)\in L_{\infty}({\mathbb{R}}),\;A_{k}(t)>0,\phi_{k}(t)\in C^{3}({\mathbb{R}}),\inf\limits_{t\in{\mathbb{R}}}\phi_{k}^{\prime}(t)>0,\sup\limits_{t\in{\mathbb{R}}}\phi_{k}^{\prime}(t)<\infty, and Ak(t),ϕk(t)A_{k}(t),\phi_{k}(t) satisfying

|Ak(t+τ)Ak(t)|α3B1|τ|Ak(t),k=0,,K,\displaystyle|A_{k}(t+\tau)-A_{k}(t)|\leq\alpha^{3}B_{1}|\tau|A_{k}(t),~{}~{}k=0,\cdots,K, (16)
supt|ϕk′′′(t)|α7B2,k=0,,K,\displaystyle\sup_{t\in{\mathbb{R}}}|\phi^{\prime\prime\prime}_{k}(t)|\leq\alpha^{7}B_{2},~{}~{}k=0,\cdots,K, (17)

where B1,B2B_{1},B_{2} are some positive constants independent of α\alpha, and (3) holds for some ρ0,>0\rho\geq 0,\triangle>0.

In this paper, we assume that the separation condition satisfies the condition (3). When ρ=0\rho=0, (3) is reduced to the well-separated condition required for SST and SSO. The proposed condition allows the IFs of some components xk(t)x_{k}(t) to cross as long as their chirp rates ϕk′′(t)\phi_{k}^{\prime\prime}(t) are different near the time t0t_{0} where IFs crossing occurs. We consider a two-component signal given by

s(t)\displaystyle s(t) =s1(t)+s2(t)=cos(2πc1t+πr1t2)+cos(2πc2t+πr2t2).\displaystyle=s_{1}(t)+s_{2}(t)=\cos\left(2\pi c_{1}t+\pi r_{1}t^{2}\right)+\cos\left(2\pi c_{2}t+\pi r_{2}t^{2}\right).

Here we let sampling rate Fs=1F_{s}=1Hz and just deal with the truncation signal on t[0,255]t\in[0,255], with N=256N=256 discrete sampling points. Especially, we consider the case c1=15/Nc_{1}=15/N, c2=43/Nc_{2}=43/N, r1=43/N2r_{1}=43/N^{2} and r2=20/N2r_{2}=-20/N^{2}. Figure 3 shows the STFT and a fixed slice of the CT of s(t)s(t) with the Gaussian window with σ=0.1N\sigma=0.1N. As shown in this figure, frequencies of sub-signals are crossover at t0=114t_{0}=114 and however the nonstationary signals are well separated in the three-dimensional space of the CT.

In Definition 1 and in the rest of this paper, we also write the trend A0(t)A_{0}(t) as x0(t)=A0(t)ei2πϕ0(t)x_{0}(t)=A_{0}(t)e^{i2\pi\phi_{0}(t)} with ϕ0(t)=0\phi_{0}(t)=0. In the real world, most signals are real-valued. Here for simplicity of presentation of the main result, Theorem 1, and its proof, we consider complex AHM given in the form of (15). The statement of Theorem 1 and its proof still hold for (real-valued) AHM given in (1) by extra arguments.

Denote

μ=μ(t)=min0kK|Ak(t)|,M=M(t)=k=0K|Ak(t)|.\mu=\mu(t)=\min_{0\leq k\leq K}|A_{k}(t)|,~{}~{}M=M(t)=\sum_{k=0}^{K}|A_{k}(t)|. (18)

The main result of this paper to be stated in Theorem 1 below applies to any value tt\in\mathbb{R}. Since tt will be fixed throughout the proof of that theorem, for simplicity we also use μ\mu and MM to denote μ(t)\mu(t) and M(t)M(t) respectively, as shown in (18).

For a window function gL1()g\in L_{1}({\mathbb{R}}), denote

(

g
(η,λ)
=g(τ)ei2πητiπλτ2𝑑τ
.
\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(\eta,\lambda)=\int_{{\mathbb{R}}}g(\tau)e^{-i2\pi\eta\tau-i\pi\lambda\tau^{2}}d\tau.
(19)

(

g
(η,λ)
\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(\eta,\lambda)
is called a polynomial Fourier transform (of order 2) of gg [76, 77].

Definition 2.

(Admissible window function)   A function g(t)0g(t)\geq 0 is called an admissible window function if g(t)𝑑t=1\int_{\mathbb{R}}g(t)dt=1, supp(g)[N,N](g)\subseteq[-N,N] for some N>0N>0, and satisfies the following conditions.

  • (a)

    There exists a constant CC such that

    |

    (

    g
    (η,λ)
    |
    C|η|+|λ|,η
    ,λ
    .
    |\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(\eta,\lambda)|\leq\frac{C}{\sqrt{|\eta|+|\lambda|}},\;\forall\eta,\lambda\in{\mathbb{R}}.
    (20)
  • (b)

    If there exists a constant DD such that

    1|

    (

    g
    (η,λ)
    |
    Dε
    ,
    1-|\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(\eta,\lambda)|\leq D\varepsilon,
    (21)

    holds for sufficiently small ε>0\varepsilon>0 and (η,λ)(\eta,\lambda) in the neighborhood of (0,0)(0,0), then η\eta and λ\lambda must satisfy

    |η|=o(1)and|λ|=o(1)asε0.|\eta|=o(1)~{}~{}{\rm and}~{}~{}|\lambda|=o(1)~{}~{}{\rm as}~{}~{}\varepsilon\to 0. (22)

When gg is the Gaussian function given by

g(t)=12πet22,g(t)=\frac{1}{\sqrt{2\pi}}\;e^{-\frac{t^{2}}{2}}, (23)

then (refer to [16, 42, 43])

(

g
(η,λ)
=11+i2πλe2π2η21+i2πλ
.
\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(\eta,\lambda)=\frac{1}{\sqrt{1+i2\pi\lambda}}e^{-\frac{2\pi^{2}\eta^{2}}{1+i2\pi\lambda}}.
(24)

One can verify that |

(

g
(η,λ)
|
=1(1+4π2λ2)1/4e2π2η21+(2πλ)2
|\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(\eta,\lambda)|=\frac{1}{(1+4\pi^{2}\lambda^{2})^{1/4}}e^{-\frac{2\pi^{2}\eta^{2}}{1+(2\pi\lambda)^{2}}}
satisfies conditions (a)(b) in Definition 2.


Observe that for an admissible window function gg, we have

|

(

g
(η,λ)
|

(

g
(0,0)
=1
.
|\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(\eta,\lambda)|\leq\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(0,0)=1.

In addition, from (20), we have

|

(

g
(η,λ)
|
L|η|+ρ|λ|,η
,λ
,
|\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(\eta,\lambda)|\leq\frac{L}{\sqrt{|\eta|+\rho|\lambda|}},\;\forall\eta,\lambda\in{\mathbb{R}},
(25)

where L=max(1,ρ)CL=\max(1,\sqrt{\rho})C, and ρ0\rho\geq 0 is the number in (3).

Theorem 1.

Let x(t)𝒜αx(t)\in{\mathcal{A}}_{\alpha} for some α>0\alpha>0, and 𝔖x(t,η,λ)\mathfrak{S}_{x}(t,\eta,\lambda) be the CT of x(t)x(t) with an admissible window function gg. Let σ=c0α2\sigma=\frac{c_{0}}{\alpha^{2}} for some c0>0c_{0}>0. If

αmin{μ4Mc0N(B1+π3B2c02N2),μc04ML},\alpha\leq\min\Big{\{}\frac{\mu}{4Mc_{0}N(B_{1}+\frac{\pi}{3}B_{2}c_{0}^{2}N^{2})},\frac{\mu\sqrt{c_{0}\triangle}}{4ML}\Big{\}}, (26)

then the following statements hold.

  1. (a)

    The set 𝒢(t)={(η,λ):|𝔖x(t,η,λ)|μ/2}\mathcal{G}(t)=\{(\eta,\lambda):|\mathfrak{S}_{x}(t,\eta,\lambda)|\geq\mu/2\} can be expressed as a disjoint union of exactly K+1K+1 non-empty sets

    𝒢(t)={(η,λ)𝒢(t):σ|ηϕ(t)|+ρσ2|λϕ′′(t)|(4LMμ)2},=0,,K.\begin{array}[]{l}\mathcal{G}_{\ell}(t)=\big{\{}(\eta,\lambda)\in\mathcal{G}(t):\sigma|\eta-\phi^{{}^{\prime}}_{\ell}(t)|+\rho\sigma^{2}|\lambda-\phi^{{}^{\prime\prime}}_{\ell}(t)|\leq\big{(}\frac{4LM}{\mu}\big{)}^{2}\big{\}},\ell=0,\cdots,K.\end{array} (27)
  2. (b)

    For each tt, let

    (η^(t),λ^(t))=argmax(η,λ)𝒢(t)|𝔖x(t,η,λ)|,=0,,K.(\widehat{\eta}_{\ell}(t),\widehat{\lambda}_{\ell}(t))={\rm argmax}_{(\eta,\lambda)\in\mathcal{G}_{\ell}(t)}|\mathfrak{S}_{x}(t,\eta,\lambda)|,\;\ell=0,\cdots,K.\\ (28)

    Then

    ||𝔖x(t,η^(t),λ^(t))|A(t)|αM(Lc0+c0NB1+π3B2c03N3),\displaystyle\big{|}|\mathfrak{S}_{x}(t,\widehat{\eta}_{\ell}(t),\widehat{\lambda}_{\ell}(t))|-A_{\ell}(t)\big{|}\leq\alpha M\Big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\Big{)}, (29)
    |η^(t)ϕ(t)|=1σo(1)=α2o(1),\displaystyle|\widehat{\eta}_{\ell}(t)-\phi_{\ell}^{{}^{\prime}}(t)|=\frac{1}{\sigma}o(1)=\alpha^{2}o(1), (30)
    |λ^(t)ϕ′′(t)|=1σ2o(1)=α4o(1),\displaystyle|\widehat{\lambda}_{\ell}(t)-\phi_{\ell}^{{}^{\prime\prime}}(t)|=\frac{1}{\sigma^{2}}o(1)=\alpha^{4}o(1), (31)
    |𝔖x(t,η^,λ^)x(t)|o(1)+αM(Lc0+c0NB1+π3B2c03N3),\displaystyle\big{|}\mathfrak{S}_{x}(t,\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})-x_{\ell}(t)\big{|}\leq o(1)+\alpha M\Big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\Big{)}, (32)

    as α0+\alpha\to 0^{+}.

The proof of Theorem 1 is provided in Appendix. Theorem 1 shows that we can use the CT to separate a multicomponent signal, even when the IF curves of different components are crossover. More precisely, for a multicomponent signal x𝒜αx\in\cal A_{\alpha}, its sub-signal x(t)x_{\ell}(t) can be reconstructed by

x^(t)=𝔖x(t,η^,λ^),=1,2,,K.\widehat{x}_{\ell}(t)=\mathfrak{S}_{x}(t,\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell}),\;\ell=1,2,\cdots,K. (33)

Especially for real-valued signals, we have

x^(t)=2e{𝔖x(t,η^,λ^)},=1,2,,K.\widehat{x}_{\ell}(t)=2\Re e\left\{\mathfrak{S}_{x}(t,\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})\right\},\;\ell=1,2,\cdots,K. (34)

The trend in (15) can also be recovered by

x^0(t)=𝔖x(t,0,0)\widehat{x}_{0}(t)=\mathfrak{S}_{x}(t,0,0) (35)

for complex signals or

x^0(t)=2e{𝔖x(t,0,0)}\widehat{x}_{0}(t)=2\Re e\left\{\mathfrak{S}_{x}(t,0,0)\right\} (36)

for real-valued signals.

It is important to point out that although the parameters α=α(t)\alpha=\alpha(t), σ=σ(t)\sigma=\sigma(t) are time-dependent, our experiments show that the dependence is not quite sensitive for reasonably well-behaved signals in A(t)A(t). Therefore, we use the constant parameters α\alpha in Section 44. However, in fact one can select the time-varying parameter so that the corresponding adaptive chirplet transform of the components of a multicomponent signal have sharp representations and are well-separated.

We call the method to obtain IFs ϕk(t)\phi_{k}^{\prime}(t), chirp rates ϕk′′(t)\phi_{k}^{{\prime}{\prime}}(t) by (28), and retrieve modes x(t)x_{\ell}(t) and trend A0(t)A_{0}(t) by (33)-(36) the chirplet transform-based signal separation scheme (or CT3S for short).

Next we would like to explain the implementation of the proposed method. The first step is to apply the CT in (3.1) to (uniform or nonuniform) samples of x(t)x(t). Then there are many narrow bands (clusters) corresponding to blind sources in time-frequency-chirprate spectrogram |𝔖x(t,η,λ)||\mathfrak{S}_{x}(t,\eta,\lambda)|. By applying an appropriate smoothing curve fitting scheme to obtain each local maximum curve. The second step is to find extreme curves in the narrow bands. Since the number of IF curves is unknown, curve fitting can be carried out by estimating one IF curve at a time, till there appears to be no curve left behind. After obtaining local maximum values η^\widehat{\eta}_{\ell} and λ^\widehat{\lambda}_{\ell}, the third step is to compute instantaneous amplitudes, frequencies, chirp rates, and signal components by (29), (30), (31), and (32), respectively.

The dominant computational complexity of the proposed algorithm is to calculate the CT of a given signal. Assume that the number of samples of a given signal is mm, the number of grids of the chirp rate is nn and the length of a window is LL, then the computational complexity of the CT is 𝒪(nmLlog2L)\mathcal{O}(nmL\log_{2}L). The computational cost of clustering is 𝒪(nmL)\mathcal{O}(nmL). Then the set 𝒢(t)={(η,λ):|𝔖x(t,η,λ)|μ/2}\mathcal{G}(t)=\{(\eta,\lambda):|{\mathfrak{S}}_{x}(t,\eta,\lambda)|\geq\mu/2\} can be expressed as a disjoint union of exactly K+1K+1 non-empty sets. For each set, the computational cost of recovering magnitudes, frequencies, waveforms and chirp rates is 𝒪(m)\mathcal{O}(m). Therefore, the total computational complexity is 𝒪(nmLlog2L)\mathcal{O}(nmL\log_{2}L).

Remark 1.

The error bounds in (29) and (32) are related to

M(Lc0+c0NB1+π3B2c03N3).M\big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}).

We shall choose c0c_{0} such that the above quantity is sufficient small. Considering that the third power c03c_{0}^{3} of c0c_{0} appears in this quantity, we shall choose c01c_{0}\leq 1. With c01c_{0}\leq 1, one may choose c0c_{0} such that Lc0=c0NB1\frac{L}{\sqrt{c_{0}\triangle}}=c_{0}NB_{1} with which Lc0+c0NB1\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1} gains its minimum. Thus we may let

c0=min(1,(L2B12N2)13).c_{0}=\min\Big{(}1,\big{(}\frac{L^{2}}{B_{1}^{2}N^{2}\triangle}\big{)}^{\frac{1}{3}}\Big{)}.

Note that σ=c0α2\sigma=\frac{c_{0}}{\alpha^{2}}. To improve recovery performance, we need to increase the window length σ\sigma. However, for an arbitrary nonstationary signal, the recover error cannot be reduced just by setting a sufficiently large number σ\sigma. We propose a modified algorithm in the next subsection to reduce the recovery errors.

3.2 A improved scheme derived from linear chirp local approximation

From the uncertainty principle [16], one can get the minimum time-bandwidth product with a Gaussian window, which means the optimal two-dimensional resolution of time and frequency is attained when a Gaussian window is used. So next we consider the CT with the Gaussian window function given by (23).

When x(t)𝒜αx(t)\in\mathcal{A}_{\alpha}, then conditions (16) and (17) imply that each component xk(t)x_{k}(t) is well-approximated locally by linear chirps (also called linear frequency modulation signals) at any time tt in the sense of (see Appendix)

xk(t+τ)xk(t)ei2π(ϕk(t)τ+12ϕk′′(t)τ2),t,x_{k}(t+\tau)\approx x_{k}(t)e^{i2\pi(\phi^{\prime}_{k}(t)\tau+\frac{1}{2}\phi^{{\prime}{\prime}}_{k}(t)\tau^{2})},\;t\in{\mathbb{R}}, (37)

for τ0\tau\approx 0. For a fixed tt, the right side of (37), as a function of τ\tau, is a linear chirp (linear frequency modulation signal). Thus from (37), we have

𝔖xk(t,η,λ)xk(t)ei2π(ϕk(t)τ+12ϕk′′(t)τ2)1σg(τσ)ei2πητiπλτ2𝑑τ\displaystyle\mathfrak{S}_{x_{k}}(t,\eta,\lambda)\approx\int_{{\mathbb{R}}}x_{k}(t)e^{i2\pi(\phi^{\prime}_{k}(t)\tau+\frac{1}{2}\phi^{{\prime}{\prime}}_{k}(t)\tau^{2})}\frac{1}{\sigma}g\big{(}\frac{\tau}{\sigma}\big{)}e^{-i2\pi\eta\tau-i\pi\lambda\tau^{2}}d\tau
=xk(t)1σg(τσ)ei2π(ηϕk(t))τiπ(λϕk′′(t))τ2𝑑τ\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}=x_{k}(t)\int_{{\mathbb{R}}}\frac{1}{\sigma}g\big{(}\frac{\tau}{\sigma}\big{)}e^{-i2\pi(\eta-\phi^{\prime}_{k}(t))\tau-i\pi(\lambda-\phi^{{\prime}{\prime}}_{k}(t))\tau^{2}}d\tau
=xk(t)(g(σ(ηϕk(t)),σ2(λϕk′′(t)))\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}=x_{k}(t)\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\eta-\phi^{\prime}_{k}(t)),\sigma^{2}(\lambda-\phi^{{\prime}{\prime}}_{k}(t))\big{)}
=11+i2πσ2(λϕk′′(t))xk(t)e2π2σ21+i2πσ2(λϕk′′(t))(ηϕk(t))2(by (24)).\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}=\frac{1}{\sqrt{1+i2\pi\sigma^{2}(\lambda-\phi^{{\prime}{\prime}}_{k}(t))}}x_{k}(t)e^{-\frac{2\pi^{2}\sigma^{2}}{1+i2\pi\sigma^{2}(\lambda-\phi^{{\prime}{\prime}}_{k}(t))}(\eta-\phi^{\prime}_{k}(t))^{2}}\;\hbox{(by \eqref{g_PFT})}.

Denote

𝔸(λ)=11+i2πσ2λ,Ω(a,b)=e2π2σ21+i2πσ2ab2.\mathbb{A}(\lambda)=\frac{1}{\sqrt{1+i2\pi\sigma^{2}\lambda}},\;\Omega(a,b)=e^{-\frac{2\pi^{2}\sigma^{2}}{1+i2\pi\sigma^{2}a}b^{2}}.

Then the above equation leads to

𝔖xk(t,η,λ)xk(t)𝔸(λϕk′′(t))Ω(λϕk′′(t),ηϕk(t)).\mathfrak{S}_{x_{k}}(t,\eta,\lambda)\approx x_{k}(t)\mathbb{A}(\lambda-\phi^{{\prime}{\prime}}_{k}(t))\Omega(\lambda-\phi^{{\prime}{\prime}}_{k}(t),\eta-\phi^{\prime}_{k}(t)). (38)

Observe that 𝔸(0)=1,Ω(,0)=1\mathbb{A}(0)=1,\Omega(\cdot,0)=1, therefore, if (η^k,λ^k)=(ϕk(t),ϕk′′(t))\big{(}\widehat{\eta}_{k},\widehat{\lambda}_{k}\big{)}=(\phi^{\prime}_{k}(t),\phi^{{\prime}{\prime}}_{k}(t)), then 𝔖xk(t,η^k,λ^k)=xk(t)\mathfrak{S}_{x_{k}}(t,\widehat{\eta}_{k},\widehat{\lambda}_{k})=x_{k}(t). From the expression of 𝔸\mathbb{A}, we see |𝔖xk(t,η,λ)||\mathfrak{S}_{x_{k}}(t,\eta,\lambda)| is not exponentially decaying with respect to variable λ\lambda as λ\lambda\to\infty. For a multicomponent signal x(t)x(t), we need to find the extreme points (η^,λ^),=1,2,,K(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell}),\ell=1,2,\cdots,K of |𝔖x(t,η,λ)||\mathfrak{S}_{x}(t,\eta,\lambda)| with (η,λ)𝒢(\eta,\lambda)\in\mathcal{G}_{\ell}. Therefore, we first need to find these KK non-empty sets 𝒢,=1,2,,K\mathcal{G}_{\ell},\ell=1,2,\cdots,K as defined in Theorem 1 on the three-dimensional space of the CT 𝔖x(t,η,λ)\mathfrak{S}_{x}(t,\eta,\lambda). However when the IF curves of two components x1(t)x_{\ell-1}(t) and x(t)x_{\ell}(t) are crossing, 𝒢1\mathcal{G}_{\ell-1} and 𝒢\mathcal{G}_{\ell} are not sufficiently separated in the three-dimensional space of the CT due to the fact that |𝔖x(t,η,λ)||\mathfrak{S}_{x}(t,\eta,\lambda)| is not a function with a fast rate of decay with respect to the chirp rate λ\lambda. Next we also use an example to explain this point.

Let s(t)s(t) be a two-component signal given by

s(t)\displaystyle s(t) =s1(t)+s2(t)=cos(2πc1t+πr1t2)+cos(2πc2t+πr2t2).\displaystyle=s_{1}(t)+s_{2}(t)=\cos\left(2\pi c_{1}t+\pi r_{1}t^{2}\right)+\cos\left(2\pi c_{2}t+\pi r_{2}t^{2}\right). (39)
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Figure 4: IFs, STFT, and some slices of the CT of the two-component signal s(t)s(t) in (39). Top row (from left to right): IFs, STFT |Vx(t,η)||V_{x}(t,\eta)|, |𝔖s(t,η,r1)||\mathfrak{S}_{s}(t,\eta,r_{1})| and |𝔖s(t,η,r2)||\mathfrak{S}_{s}(t,\eta,r_{2})|; Bottom row (from left to right): |𝔖s(114,η,λ)||\mathfrak{S}_{s}(114,\eta,\lambda)|, |𝔖s(160,η,λ)||\mathfrak{S}_{s}(160,\eta,\lambda)|, |𝔖s(t,34/N,λ)||\mathfrak{S}_{s}(t,34/N,\lambda)| and |𝔖s(t,26/N,λ)||\mathfrak{S}_{s}(t,26/N,\lambda)|.

Here we let sampling rate Fs=1F_{s}=1Hz and just deal with the truncation signal on t[0,255]t\in[0,255], with N=256N=256 discrete sampling points. Especially, we consider the case c1=15/Nc_{1}=15/N, c2=43/Nc_{2}=43/N, r1=43/N2r_{1}=43/N^{2} and r2=20/N2r_{2}=-20/N^{2}. Figure 4 shows the IFs and the STFT of s(t)s(t), and some special slices of the CT of the two-component signal s(t)s(t) with the Gaussian window with σ=0.1N\sigma=0.1N. Observe that when λ=r1\lambda=r_{1} or λ=r2\lambda=r_{2}, s1(t)s_{1}(t) and s2(t)s_{2}(t) are well represented on the two time-frequency planes |𝔖s(t,η,r1)||\mathfrak{S}_{s}(t,\eta,r_{1})| and |𝔖s(t,η,r2)||\mathfrak{S}_{s}(t,\eta,r_{2})|, respectively.

Now we focus on the crossing point of the two IFs of s1(t)s_{1}(t) and s2(t)s_{2}(t), which is located at around (t0,η0)(t_{0},\eta_{0}) with t0=114t_{0}=114 and η0=34/N\eta_{0}=34/N. From the 1st and 3rd panels in the bottom row of Figure 4, namely the crossover point, the two components appear to two separated peaks on the chirp rate-frequency and chirp rate-time planes, respectively, but not very clearly and sharply. Taking t=t0t=t_{0} and η=η0\eta=\eta_{0} in (38), we have

(λ)=|𝔖s(114,η0,λ)|\displaystyle\mathcal{L}(\lambda)=|\mathfrak{S}_{s}(114,\eta_{0},\lambda)|
=|121+i2πσ2(λr1)s~1(t)+121+i2πσ2(λr2)s~2(t)|\displaystyle~{}~{}~{}~{}~{}~{}=\bigg{|}\frac{1}{2\sqrt{1+i2\pi\sigma^{2}(\lambda-r_{1})}}\tilde{s}_{1}(t)+\frac{1}{2\sqrt{1+i2\pi\sigma^{2}(\lambda-r_{2})}}\tilde{s}_{2}(t)\bigg{|}
121+4π2σ4(λr1)24+121+4π2σ4(λr2)24,\displaystyle~{}~{}~{}~{}~{}~{}\approx\frac{1}{2\sqrt[4]{1+4\pi^{2}\sigma^{4}(\lambda-r_{1})^{2}}}+\frac{1}{2\sqrt[4]{1+4\pi^{2}\sigma^{4}(\lambda-r_{2})^{2}}},

where s~k(t)=ei2πckt+iπrkt2\tilde{s}_{k}(t)=e^{i2\pi c_{k}t+i\pi r_{k}t^{2}} denotes the analytic signal of sk(t)s_{k}(t), k=1,2k=1,2. Note that the two parts in (λ)\mathcal{L}(\lambda) above are corresponding to s1(t)s_{1}(t) and s2(t)s_{2}(t), respectively, which are centered at λ=r1=43/N2\lambda=r_{1}=43/N^{2} and λ=r2=20/N2\lambda=r_{2}=-20/N^{2}. Then let t=114t=114 and λ=r2\lambda=r_{2}, we obtain

𝒯(η)=|𝔖s(114,η,r2)|12e2π2σ2(ηη0)2.\mathcal{T}(\eta)=|\mathfrak{S}_{s}(114,\eta,r_{2})|\approx\frac{1}{2}e^{-2\pi^{2}\sigma^{2}(\eta-\eta_{0})^{2}}.

Compared to 𝒯(η)\mathcal{T}(\eta), (λ)\mathcal{L}(\lambda) is a slowly attenuated function from the two extrema located at λ=r1\lambda=r_{1} and λ=r2\lambda=r_{2}. This explains why there are two components which not well separated in either the 1st or the 3rd panel in the bottom row of Figure 4, while there is only one component in the 4th panel of the top row.

To solve the above problem, we first consider the popular integral transform, namely Radon transform [78]. Since 𝔖s(t,η,λ)\mathfrak{S}_{s}(t,\eta,\lambda) is a three dimensional function, we may use the 3D Radon transform as that in [79] to detect the signal components, which is similar to the case of two dimensional Radon transform in [80].

For each time tt, with a pair of angles (φ1,φ2)(\varphi_{1},\varphi_{2}), the 3D Radon transform is an integral transform along the lines in the 3D space,

R\displaystyle R (t,φ1,φ2)=𝔖s(t,η,λ)δ(tηsinφ1cosφ2+ηsinφ1sinφ2+tcosφ1)𝑑t𝑑η𝑑λ,\displaystyle(t^{\prime},\varphi_{1},\varphi_{2})=\int_{-\infty}^{\infty}\int_{-\infty}^{\infty}\int_{-\infty}^{\infty}\mathfrak{S}_{s}(t,\eta,\lambda)\delta(t^{\prime}-\eta\sin\varphi_{1}\cos\varphi_{2}+\eta\sin\varphi_{1}\sin\varphi_{2}+t\cos\varphi_{1})dtd\eta d\lambda,

where δ\delta is a Dirac’s delta function.

If all the components of a multicomponent signal are linear chirps, then they can be well represented in the 3D space of R(t,φ1,φ2)R(t^{\prime},\varphi_{1},\varphi_{2}). However, the computational burden is heavy for this 3D Radon transform. Moreover, a nonstationary signal is approximated by linear chirps just for local time around tt.

Considering the relation among tt, η\eta and λ\lambda in 𝔖s(t,η,λ)\mathfrak{S}_{s}(t,\eta,\lambda), namely ϕ(t+u)=η+λu,u[b,b]\phi^{\prime}(t+u)=\eta+\lambda u,u\in[-b,b], where b>0b>0 is small enough, we introduce a time-frequency filter operator \mathcal{F} on 𝔖x\mathfrak{S}_{x} to make different sub-signals more distinguishable in the 3D space of time, frequency and chirp rate.

For a multicomponent signal x(t)x(t), the time-frequency filter-matched CT is defined by

h(𝔖x)(t,η,λ)=1bh(ub)|𝔖x(t+u,η+λu,λ)|𝑑u,\mathcal{F}^{h}\left(\mathfrak{S}_{x}\right)(t,\eta,\lambda)=\frac{1}{b}\int_{{\mathbb{R}}}h\big{(}\frac{u}{b}\big{)}\left|\mathfrak{S}_{x}(t+u,\eta+\lambda u,\lambda)\right|du, (40)

where h(t)h(t) is a fast decay window function with h(t)0h(t)\geq 0 and h(t)𝑑t=1\int_{\mathbb{R}}h(t)dt=1. In the following experiments, in order to simplify calculations, we will use a rectangular window with width of 2b2b.

Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Figure 5: Slices of filter-matched CT defined by (40) corresponding to the slices in Figure 4. Top row (from left to right): |h(𝔖s)(t,η,r1)||\mathcal{F}^{h}(\mathfrak{S}_{s})(t,\eta,r_{1})|, |h(𝔖s)(t,η,r2)||\mathcal{F}^{h}(\mathfrak{S}_{s})(t,\eta,r_{2})| and |h(𝔖s)(114,η,λ)||\mathcal{F}^{h}(\mathfrak{S}_{s})(114,\eta,\lambda)|; Bottom row (from left to right): |h(𝔖s)(160,η,λ)||\mathcal{F}^{h}(\mathfrak{S}_{s})(160,\eta,\lambda)|, |h(𝔖s)(t,34/N,λ)||\mathcal{F}^{h}(\mathfrak{S}_{s})(t,34/N,\lambda)| and |𝔖s(t,26/N,λ)||\mathfrak{S}_{s}(t,26/N,\lambda)|.

Consider again the signal in (39), Figure 5 shows the slices of the filter-matched CT defined by (40) with Gaussian window and b=20b=20 (discrete points, unitless). Observe that by comparing the corresponding pictures in Figure 4 and Figure 5, the filter-matched CT indeed improves the separability of the two components when their IFs are crossover.

For x𝒜αx\in\mathcal{A}_{\alpha}, we will use the filter-matched CT to estimate ϕ(t),ϕ′′(t)\phi^{\prime}_{\ell}(t),\phi^{{\prime}{\prime}}_{\ell}(t) by

ϕ(t)η^h(t),ϕ′′(t)λ^h(t)\phi^{\prime}_{\ell}(t)\approx\widehat{\eta}_{\ell}^{h}(t),\phi^{{\prime}{\prime}}_{\ell}(t)\approx\widehat{\lambda}_{\ell}^{h}(t) (41)

with

(η^h(t),λ^h(t))=argmaxη,λ𝒢(t)h(𝔖x)(t,η,λ),(\widehat{\eta}^{h}_{\ell}(t),\widehat{\lambda}^{h}_{\ell}(t))={\rm argmax}_{\eta,\lambda\in\mathcal{G}_{\ell}(t)}\mathcal{F}^{h}(\mathfrak{S}_{x})(t,\eta,\lambda), (42)

where 𝒢(t)\mathcal{G}_{\ell}(t) is defined in Theorem 1. We call (t,η^h(t),λ^h(t))(t,\widehat{\eta}^{h}_{\ell}(t),\widehat{\lambda}^{h}_{\ell}(t)) the ridge of the filter-matched CT.

With the resulting η^h(t),λ^h(t)\widehat{\eta}_{\ell}^{h}(t),\widehat{\lambda}_{\ell}^{h}(t), we may use the CT (namely (33) or (34)) to recover sub-signal x(t),1Kx_{\ell}(t),1\leq\ell\leq K. Observe that the recovering formula (33) or (34) recovers x(t)x_{\ell}(t) one by one. Next, by considering all x(t),0Kx_{\ell}(t),0\leq\ell\leq K as a whole group, we propose an innovative algorithm based on the filter-matched CT to recover sub-signals x(t)x_{\ell}(t).

Recall that when gg is the Gaussian window given in (23), then (38) holds. Thus for x𝒜αx\in\mathcal{A}_{\alpha}, we have

𝔖x(t,η,λ)=0Kx(t)𝔸(λϕ′′(t))Ω(λϕ′′(t),ηϕ(t)).\mathfrak{S}_{x}(t,\eta,\lambda)\approx\sum_{\ell=0}^{K}x_{\ell}(t)\mathbb{A}(\lambda-\phi^{{\prime}{\prime}}_{\ell}(t))\Omega(\lambda-\phi^{{\prime}{\prime}}_{\ell}(t),\eta-\phi^{\prime}_{\ell}(t)).

Hence if η^h(t),λ^h(t),1K\widehat{\eta}^{h}_{\ell}(t),\widehat{\lambda}^{h}_{\ell}(t),1\leq\ell\leq K obtained from the filter-matched CT by (42) are good approximations to ϕ(t),ϕ′′(t)\phi^{\prime}_{\ell}(t),\phi^{{\prime}{\prime}}_{\ell}(t), then, with η^0=λ^0=0\widehat{\eta}_{0}=\widehat{\lambda}_{0}=0, we have

𝔖x(t,η,λ)=0Kx(t)𝔸(λλ^h(t))Ω(λλ^,ηη^h(t)).\mathfrak{S}_{x}(t,\eta,\lambda)\approx\sum_{\ell=0}^{K}x_{\ell}(t)\mathbb{A}(\lambda-\widehat{\lambda}_{\ell}^{h}(t))\Omega(\lambda-\widehat{\lambda}_{\ell},\eta-\widehat{\eta}_{\ell}^{h}(t)).

In particular, with η=η^mh(t),λ=λ^mh(t)\eta=\widehat{\eta}_{m}^{h}(t),\lambda=\widehat{\lambda}_{m}^{h}(t), we have

𝔖x(t,η^mh(t),λ^mh(t))=0Kam,x(t),m=0,1,,K,\mathfrak{S}_{x}(t,\widehat{\eta}_{m}^{h}(t),\widehat{\lambda}_{m}^{h}(t))\approx\sum_{\ell=0}^{K}a_{m,\ell}x_{\ell}(t),\quad m=0,1,\cdots,K, (43)

where

am,=𝔸(λ^mh(t)λ^h(t))Ω(λ^mh(t)λ^h(t),η^mh(t)η^h(t)).a_{m,\ell}=\mathbb{A}\big{(}\widehat{\lambda}_{m}^{h}(t)-\widehat{\lambda}_{\ell}^{h}(t)\big{)}\;\Omega\big{(}\widehat{\lambda}_{m}^{h}(t)-\widehat{\lambda}_{\ell}^{h}(t),\widehat{\eta}_{m}^{h}(t)-\widehat{\eta}_{\ell}^{h}(t)\big{)}. (44)

Denote

𝐀t=[1a0,1a0,Ka1,01a1,KaK,0aK,11],𝐗t=[x0(t)x1(t)xK(t)],𝐗^th=[𝔖x(t,η^0h(t),λ^0h(t))𝔖x(t,η^1h(t),λ^1h(t))𝔖x(t,η^Kh(t),λ^Kh(t))].\mathbf{A}_{t}=\begin{bmatrix}1&a_{0,1}&\cdots&a_{0,K}\\ a_{1,0}&1&\cdots&a_{1,K}\\ \vdots&\vdots&\ddots&\vdots\\ a_{K,0}&a_{K,1}&\cdots&1\end{bmatrix},\quad\mathbf{X}_{t}=\begin{bmatrix}x_{0}(t)\\ x_{1}(t)\\ \vdots\\ x_{K}(t)\end{bmatrix},\quad\widehat{\mathbf{X}}^{h}_{t}=\begin{bmatrix}\mathfrak{S}_{x}\big{(}t,\widehat{\eta}_{0}^{h}(t),\widehat{\lambda}_{0}^{h}(t)\big{)}\\ \mathfrak{S}_{x}\big{(}t,\widehat{\eta}_{1}^{h}(t),\widehat{\lambda}_{1}^{h}(t)\big{)}\\ \vdots\\ \mathfrak{S}_{x}\big{(}t,\widehat{\eta}_{K}^{h}(t),\widehat{\lambda}_{K}^{h}(t)\big{)}\end{bmatrix}. (45)

Then (43) can be written as

𝐗^th𝐀t𝐗t.\widehat{\mathbf{X}}^{h}_{t}\approx\mathbf{A}_{t}\mathbf{X}_{t}.

Hence

𝐗t𝐀t1𝐗^th.\mathbf{X}_{t}\approx\mathbf{A}_{t}^{-1}\;\widehat{\mathbf{X}}^{h}_{t}. (46)

Based (46), we propose the following algorithm, called the group filter-matched chirplet transform-based signal separation scheme (GFCT3S), to recover components x(t)x_{\ell}(t) and trend x0(t)x_{0}(t).

Algorithm 1.

(Mode retrieval with GFCT3S). Let x(t)x(t) be a multicomponent signal x𝒜αx\in\mathcal{A}_{\alpha} satisfying (3) and 𝔖x(t,η,λ)\mathfrak{S}_{x}(t,\eta,\lambda) be the CT of xx with the Gaussian window function.

  • Step 1.

    Set η^0h=λ^0h=0\widehat{\eta}_{0}^{h}=\widehat{\lambda}_{0}^{h}=0. Calculate η^h,λ^h,1K\widehat{\eta}_{\ell}^{h},\widehat{\lambda}_{\ell}^{h},1\leq\ell\leq K by (42) with the filter-matched CT.

  • Step 2.

    Calculate

    𝐗~t=𝐀t1𝐗^th,\widetilde{\mathbf{X}}_{t}=\mathbf{A}^{-1}_{t}\;\widehat{\mathbf{X}}^{h}_{t}, (47)

    where 𝐀t\mathbf{A}_{t} and 𝐗^th\widehat{\mathbf{X}}^{h}_{t} are defined by (45).

  • Step 3.

    The components x~(t)\widetilde{x}_{\ell}(t) of 𝐗~t=:[x~0(t),x~1(t),,x~K(t)]T\widetilde{\mathbf{X}}_{t}=:[\widetilde{x}_{0}(t),\widetilde{x}_{1}(t),\cdots,\widetilde{x}_{K}(t)]^{T} are the recovered sub-signals x(t)x_{\ell}(t) of x(t)x(t).

We first apply the CT to the blind source signal x(t)x(t), with output 𝔖x(t,η,λ)\mathfrak{S}_{x}(t,\eta,\lambda) for thresholding with the appropriate parameter μ\mu that can be determined by the energy distribution of |𝔖x(t,η,λ)||\mathfrak{S}_{x}(t,\eta,\lambda)|. This allows us to separate the thresholded set {(η,λ):|𝔖x(t,η,λ)|μ/2}\{(\eta,\lambda):|\mathfrak{S}_{x}(t,\eta,\lambda)|\geq\mu/2\} into different clusters 𝒢(t)\mathcal{G}_{\ell}(t) (=0,,K)(\ell=0,\cdots,K). Note that Ω(λ,η)\Omega(\lambda,\eta) is a fast decay function with respect to η\eta. If all the sub-signals xk(t)x_{k}(t) are well-separated in the time-frequency plane, namely satisfy (2), then a,m0a_{\ell,m}\approx 0 for m\ell\neq m, and hence, 𝐀t\mathbf{A}_{t} in (47) is essentially the identity matrix. So the reconstruction algorithm above is fit for both cases in (2) and (3).

Finally, we discuss the algorithm of real-time processing of an consecutive input signal. To reduce the computational cost, we need to predefine some variables. Let T+T\in{\mathbb{Z}}^{+} denote the truncation length of the input signal, e.g. T=128T=128 or T=256T=256, then frequency η\eta is discretized into η=0,1/T,,(T/21)/T\eta=0,1/T,...,(T/2-1)/T and λ\lambda is discretized into λ=(T/21)/T2,(T/22)/T,,0,(T/21)/T2\lambda=-(T/2-1)/T^{2},-(T/2-2)/T,...,0,...(T/2-1)/T^{2}. Define 𝐒T/2×(T1)tm=𝔖x(tm,,){\bf S}^{t_{m}}_{T/2\times(T-1)}=\mathfrak{S}_{x}(t_{m},\cdot,\cdot), where tmt_{m} is a fixed time. Suppose we will separate xx when t=tmt=t_{m}, then we need to calculate 𝐒tmLm,,𝐒tm+Lm{\bf S}^{t_{m}-L_{m}},\cdots,{\bf S}^{t_{m}+L_{m}} first, where 2Lm+12L_{m}+1 should equivalent to the window length bb in (40) and 2Lm+1T2L_{m}+1\ll T. Then for the next time instant t=tm+1t=t_{m}+1, we just need to calculate 𝐒tm+1+Lm{\bf S}^{t_{m}+1+L_{m}}, and continue the procedure.

Refer to caption
Refer to caption
Figure 6: Waveform of s(t)s(t) in (48) with enlarged picture around t=1t=1 and IFs of two AM-FM components.
Refer to caption
Refer to caption
Refer to caption
Figure 7: Recovered IFs of s(t)s(t) in (48) with SST and ridge of the filter-matched CT (with enlarged picture around t=1t=1). Top row (from left to right): Time-frequency diagram of STFT, time-frequency diagram of the 2nd-order SST in [38]; Bottom row: Estimated IFs by ridges of the filter-matched CT given in (42)

.

4 Numerical experiments

Figure 2 demonstrates our proposed method GFCT3S (Algorithm 1) is efficient for the two-component signal in (13) with one cross point of the IFs. In this section, we first consider another synthetic multicomponent signal s(t)s(t), given as

s(t)=s1(t)+s2(t)+A0(t)=1.2cos(2300πt+90sin(20πt))+cos(2438πt)+(1+(t2+t)e1t1.5),\begin{array}[]{l}s(t)=s_{1}(t)+s_{2}(t)+A_{0}(t)=1.2\cos(2300\pi t+90\sin(20\pi t))+\cos(2438\pi t)+(1+(t^{2}+t)e^{1-t^{1.5}}),\end{array} (48)

where t>0t>0. Note that the IFs of s1(t)s_{1}(t) and s2(t)s_{2}(t) are ϕ1(t)=1150+900cos(20πt)\phi^{\prime}_{1}(t)=1150+900\cos(20\pi t) and ϕ2(t)=1219\phi^{\prime}_{2}(t)=1219, respectively, called IF1 and IF2 in Figure 7.

In this experiment, we discretize s(t)s(t) with a sampling rate Fs=8F_{s}=8kHz and data length M=214M=2^{14}, namely t[0,2.048]t\in[0,2.048]. Figure 6 shows the waveform of s(t)s(t) and the IFs of two AM-FM components, s1(t)s_{1}(t) and s2(t)s_{2}(t). As the expression in (48), s(t)s(t) consists of one trend and two oscillating AM-FM components. Meanwhile, the IFs of the two AM-FM components are crossover.

Observe that the signal s(t)s(t) to be processed contains lots of samples, which should be analyzed or separated locally. Here we use a sliding truncated Gaussian window with length of N=28N=2^{8} points for methods of STFT, SST and GFCT3S. Hence the frequency bins is discretized as FsN{N/2+1,N/2+2,,N/21,N/2}\frac{F_{s}}{N}\{-N/2+1,-N/2+2,...,N/2-1,N/2\} for complex signals, or just FsN{0,1,,N/21,N/2}\frac{F_{s}}{N}\{0,1,...,N/2-1,N/2\} for real signals. Note that we set NN as a power of 2 to take full advantage of the fast Fourier transform. Figure 7 shows the time-frequency diagrams of the STFT and the 2nd-order SST in [38] and the recovered IFs by the ridges of the filter-matched CT given in (42). The enlarged pictures around t=1t=1 are also attached with each sub-Figure. Obviously, when the IFs of s1(t)s_{1}(t) and s2(t)s_{2}(t) are crossover, either the STFT or the 2nd-order SST hardly represents the sub-signals reliably. Thus we cannot use the time-frequency diagram of the STFT or the 2nd-order SST to extract the IFs of the sub-signals for the purpose of recovering their waveforms. However, using the ridges η^h(t)\widehat{\eta}_{\ell}^{h}(t) of the filter-matched CT, we can extract the IFs of s(t)s(t) accurately.

Refer to caption
Refer to caption
Refer to caption
Figure 8: Mode recovery results of s(t)s(t) in (48) with proposed GFTC3S (Algorithm 1). Top: Recovered trend with enlarged picture around t=1t=1; Bottom: Recovered modes s1(t)s_{1}(t) (Left) and s2(t)s_{2}(t) (Right) around t=1t=1.
Refer to caption
Refer to caption
Figure 9: Recovery errors of s(t)s(t) under different SNRs. Left: Recovered errors of s1(t)s_{1}(t) and s2(t)s_{2}(t) by proposed GFTC3S; Right: Comparison with various methods.

Figure 8 provides recovered modes s1(t)s_{1}(t) and s2(t)s_{2}(t) around t=1t=1 with GFTC3S (Algorithm 1) proposed in Section 3.2. Since there are so many sample periods of the signal s(t)s(t), we just show a small truncation around t=1t=1. Observe the differences between the recovered waveforms and the truth ones are extremely small.

To demonstrate the efficiency of our computational scheme for signal data with additive noise, we compared the proposed algorithm with the following methods: EMD [1], 2nd-order SST [38], SSO [48], Fast-IF [60], and ACMD [66]. Among these algorithms, Fast-IF, and ACMD are the ones that take crossover frequencies into account. To measure the errors, we use the root-mean-square error (RMSE) defined by

Ef=ff~2f2,E_{f}=\frac{||f-\widetilde{f}||_{2}}{||f||_{2}},

where f~\widetilde{f} is the estimation of a function ff. The left panel of Figure 9 provides the RMSEs of Es1E_{s_{1}} and Es2E_{s_{2}} when signal-to-noise ratios (SNRs) vary from 10-10dB to 2020dB. Note that the recovery performance tends to be stationary when SNR is larger than 0dB. From the right panel of Figure 9, where the average RMSE is defined by Es=Es1+Es22E_{s}=\frac{E_{s_{1}}+E_{s_{2}}}{2}, we find that the existing methods EMD and 2nd-order SST and SSO are hardly to recover the sub-signals s1(t)s_{1}(t) and s2(t)s_{2}(t) with crossover IFs. Our method outperforms Fast-IF and ACMD. As shown in this figure, our algorithm posses the best stability with respect to robustness.

Refer to caption
Refer to caption
Refer to caption
Figure 10: Waveform and spectrum of the radar echoes. Top-left: Real part of the waveform; Top-right: Imaginary part of the waveform; Bottom: Spectrum.
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Refer to caption
Figure 11: Results of the radar echoes. Top row (from left to right): STFT, 2nd-order SST, a specific slice of 3D filter-matched CT matrix; Bottom row (from left to right): Estimated IFs by ridges of filter-matched CT given in (42), recovered waveform of Component 1 (real part) and recovered waveform of Component 2 (real part) by GFCT3S.

Finally, we consider a real signal, the radar echoes. Figure 10 shows the waveform and spectrum of the radar echoes. Note that the sampling rate here is equal to 400 Hz, which is just the pulse repetition frequency of the radar. The bottom panel of Figure 10, namely the spectrum shows that this signal consists of several broadband components and a trend.

Figure 11 shows some results of the radar echoes given in Figure 10. From their STFTs (top-left panel in Figure 11), there are two components (two radar targets) in the echoes. Meanwhile, the IF curves of these two targets are crossover with the trend component. Although the 2nd-order SST can squeeze the time-frequency plane of STFT, it is still affected by the trend component when they are crossover. The top-right panel of Figure 11 shows a specific slice of 3D filter-matched CT matrix, where the chirp rate is close to those of Component 1 and Component 2. Observe that in this specific slice, compared with STFT and 2nd-order SST, the two signal components are enhanced a lot. The left-bottom panel shows the estimated IFs by the ridges of filter-matched CT given in (42). The recovered waveforms of Component 1 (real part) and Component 2 (real part) by GFCT3S are provided in the middle and right panels in the bottom row of Figure 11.

5 Conclusions

In this paper, we propose a method based the chirplet transform (CT) to retrieve modes of multicomponent signals with crossover instantaneous frequencies. We define the modified adaptive harmonic model and the conditions to represent crossover components separately by the proposed CT-based method. The error bounds for instantaneous frequency estimation and sub-signal recovery are provided. Based on the approximation of source signals with linear chirps at any local time, we propose an improved CT-based signal reconstruction algorithm with all signal components taken into account. The numerical experiments demonstrate the proposed method are more accurate and consistent in signal separation than EMD, SST, SSO and other approaches such as Fast-IF and ACMD. The proposed method has a great potential for a variety of engineering applications such as channel detection in communication, fault monitoring in mechanical systems, radar signal processing etc.

Appendix

In this appendix we provide the proof of Theorem 1. Write

x(t+τ)=xm(t,τ)+xr(t,τ),x(t+\tau)=x_{\rm m}(t,\tau)+x_{\rm r}(t,\tau),

where

xm(t,τ)=k=0Kxk(t)ei2π(ϕk(t)τ+12ϕk′′(t)τ2),xr(t,τ)=k=0K{(Ak(t+τ)Ak(t))ei2πϕk(t+τ)+xk(t)ei2π(ϕk(t)τ+12ϕk′′(t)τ2)(ei2π(ϕk(t+τ)ϕk(t)ϕk(t)τ12ϕk′′(t)τ2)1)}.\begin{array}[]{l}x_{\rm m}(t,\tau)=\sum_{k=0}^{K}x_{k}(t)e^{i2\pi(\phi^{\prime}_{k}(t)\tau+\frac{1}{2}\phi^{{\prime}{\prime}}_{k}(t)\tau^{2})},\\ x_{\rm r}(t,\tau)=\sum_{k=0}^{K}\Big{\{}(A_{k}(t+\tau)-A_{k}(t))e^{i2\pi\phi_{k}(t+\tau)}+x_{k}(t)e^{i2\pi(\phi^{\prime}_{k}(t)\tau+\frac{1}{2}\phi^{{\prime}{\prime}}_{k}(t)\tau^{2})}\\ \big{(}e^{i2\pi(\phi_{k}(t+\tau)-\phi_{k}(t)-\phi_{k}^{\prime}(t)\tau-\frac{1}{2}\phi^{{\prime}{\prime}}_{k}(t)\tau^{2})}-1\big{)}\Big{\}}.\end{array}

Denote

x(t,η,λ)=xm(t,τ)𝒦σ(τ,η,λ)𝑑τ=1σg(τσ)xm(t,τ)ei2πτηiπλτ2𝑑τ.\begin{array}[]{l}\mathfrak{R}_{x}(t,\eta,\lambda)=\int_{{\mathbb{R}}}x_{\rm m}(t,\tau)\mathcal{K}_{\sigma}(\tau,\eta,\lambda)d\tau=\int_{{\mathbb{R}}}\frac{1}{\sigma}g\big{(}\frac{\tau}{\sigma}\big{)}x_{\rm m}(t,\tau)e^{-i2\pi\tau\eta-i\pi\lambda\tau^{2}}d\tau.\end{array} (49)

Then we have

x(t,η,λ)=k=0Kxk(t)

(

g
(σ(ηϕk(t)),σ2(λϕk′′(t)))
.
\begin{array}[]{l}\mathfrak{R}_{x}(t,\eta,\lambda)=\sum_{k=0}^{K}x_{k}(t)\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\eta-\phi^{\prime}_{k}(t)),\sigma^{2}(\lambda-\phi^{{\prime}{\prime}}_{k}(t))\big{)}.\end{array}
(50)

In following, σ=c0α2\sigma=\frac{c_{0}}{\alpha^{2}} as in Theorem 1. In addition, since in general α\alpha is small, we assume σ1\sigma\geq 1 for simplicity of presentation. Furthermore, since x,tx,t will be fixed throughout the proof, in the following we use 𝔖(η,λ)\mathfrak{S}(\eta,\lambda), (η,λ)\mathfrak{R}(\eta,\lambda), 𝒢\mathcal{G} and 𝒢\mathcal{G}_{\ell} to denote 𝔖x(t,η,λ)\mathfrak{S}_{x}(t,\eta,\lambda), x(t,η,λ)\mathfrak{R}_{x}(t,\eta,\lambda), 𝒢(t)\mathcal{G}(t) and 𝒢(t)\mathcal{G}_{\ell}(t) respectively. First we establish a few lemmas.

Lemma 1.

For x(t)Aαx(t)\in A_{\alpha}, let xm(t,τ)x_{\rm m}(t,\tau) be the linear chirp approximation to x(t+τ)x(t+\tau) at time tt defined above. Then

|x(t+τ)xm(t,τ)|M(B1α3|τ|+π3B2α7|τ|3).\begin{array}[]{l}|x(t+\tau)-x_{\rm m}(t,\tau)|\leq M\big{(}B_{1}\alpha^{3}|\tau|+\frac{\pi}{3}B_{2}\alpha^{7}|\tau|^{3}\big{)}.\end{array} (51)
Proof.

The proof is straightforward. Indeed, by (16) and (17),

|x(t+τ)xm(t,τ)|=|xr(t,τ)|k=0K{|Ak(t+τ)Ak(t)|+Ak(t)|i2π(ϕk(t+τ)ϕk(t)ϕk(t)τ12ϕk′′(t)τ2)|}k=0K{Ak(t)B1α3|τ|+Ak(t)2πsupξ16|ϕ(ξ)′′′kτ3|M(t)B1α3|τ|+k=0KAk(t)π3B2α7|τ|3=M(B1α3|τ|+π3B2α7|τ|3),\begin{array}[]{l}|x(t+\tau)-x_{\rm m}(t,\tau)|=|x_{\rm r}(t,\tau)|\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq\sum_{k=0}^{K}\Big{\{}|A_{k}(t+\tau)-A_{k}(t)|+A_{k}(t)~{}\big{|}i2\pi\big{(}\phi_{k}(t+\tau)-\phi_{k}(t)-\phi_{k}^{\prime}(t)\tau-\frac{1}{2}\phi^{{\prime}{\prime}}_{k}(t)\tau^{2}\big{)}\big{|}\Big{\}}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq\sum_{k=0}^{K}\Big{\{}A_{k}(t)B_{1}\alpha^{3}|\tau|+A_{k}(t)2\pi\sup_{\xi\in{\mathbb{R}}}\frac{1}{6}\big{|}\phi{{}^{\prime\prime\prime}}_{k}(\xi)\tau^{3}\big{|}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq M(t)B_{1}\alpha^{3}|\tau|+\sum_{k=0}^{K}A_{k}(t)\frac{\pi}{3}B_{2}\alpha^{7}|\tau|^{3}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}=M\big{(}B_{1}\alpha^{3}|\tau|+\frac{\pi}{3}B_{2}\alpha^{7}|\tau|^{3}\big{)},\end{array}

as desired. ∎

Lemma 2.

For x(t)Aαx(t)\in A_{\alpha}, let 𝔖(η,λ)\mathfrak{S}(\eta,\lambda) be its transform by CT and (η,λ)\mathfrak{R}(\eta,\lambda) be the approximation of 𝔖(η,λ)\mathfrak{S}(\eta,\lambda) with linear chirps defined by (49). Then

|𝔖(η,λ)(η,λ)|αM(B1c0N+π3B2c03N3).\begin{array}[]{l}\big{|}\mathfrak{S}(\eta,\lambda)-\mathfrak{R}(\eta,\lambda)\big{|}\leq\alpha M\big{(}B_{1}c_{0}N+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)}.\end{array} (52)
Proof.

By (51) and the facts g0g\geq 0, suppg[N,N]g\subseteq[-N,N], we have

|𝔖(η,λ)(η,λ)|=|(x(t+τ)xm(t,τ))1σg(τσ)ei2π(ητ+12λτ2)𝑑τ|NσNσM(B1α3|τ|+π3B2α7|τ|3)1σg(τσ)𝑑τM(B1α3Nσ+π3B2α7σ3N3)=αM(B1c0N+π3B2c03N3).\begin{array}[]{l}\big{|}\mathfrak{S}(\eta,\lambda)-\mathfrak{R}(\eta,\lambda)\big{|}=\Big{|}\int_{\mathbb{R}}(x(t+\tau)-x_{\rm m}(t,\tau))\frac{1}{\sigma}g(\frac{\tau}{\sigma})e^{-i2\pi(\eta\tau+\frac{1}{2}\lambda\tau^{2})}d\tau\Big{|}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq\int_{-N\sigma}^{N\sigma}M\big{(}B_{1}\alpha^{3}|\tau|+\frac{\pi}{3}B_{2}\alpha^{7}|\tau|^{3}\big{)}\frac{1}{\sigma}g(\frac{\tau}{\sigma})d\tau\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq M\big{(}B_{1}\alpha^{3}N\sigma+\frac{\pi}{3}B_{2}\alpha^{7}\sigma^{3}N^{3}\big{)}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}=\alpha M\big{(}B_{1}c_{0}N+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)}.\end{array}

Lemma 3.

Let 𝒢,0K\mathcal{G}_{\ell},0\leq\ell\leq K be the sets defined by (27). If αμc04ML\alpha\leq\frac{\mu\sqrt{c_{0}\triangle}}{4ML}, then 𝒢\mathcal{G}_{\ell} are nonoverlapping, namely, 𝒢𝒢k=\mathcal{G}_{\ell}\cap\mathcal{G}_{k}=\emptyset for k\ell\not=k.

Proof.

Assume (η,λ)𝒢𝒢k(\eta,\lambda)\in\mathcal{G}_{\ell}\cap\mathcal{G}_{k} for some k\ell\not=k. By the definition of 𝒢\mathcal{G}_{\ell}, we have

|ϕk(t)ϕ(t)|+ρ|ϕk′′(t)ϕ′′(t)||ϕk(t)η|+ρ|ϕk′′(t)λ|+|ϕ(t)η|+ρ|ϕ′′(t)λ|1σ(σ|ϕk(t)η|+ρσ2|ϕk′′(t)λ|)+1σ(σ|ϕ(t)η|+ρσ2|ϕ′′(t)λ|)(since σ1)2σ(4MLμ)22,\begin{array}[]{l}|\phi^{\prime}_{k}(t)-\phi^{\prime}_{\ell}(t)|+\rho|\phi^{\prime\prime}_{k}(t)-\phi^{\prime\prime}_{\ell}(t)|\\ \leq|\phi^{\prime}_{k}(t)-\eta|+\rho|\phi^{\prime\prime}_{k}(t)-\lambda|+|\phi^{\prime}_{\ell}(t)-\eta|+\rho|\phi^{\prime\prime}_{\ell}(t)-\lambda|\\ \leq\frac{1}{\sigma}\left(\sigma|\phi^{\prime}_{k}(t)-\eta|+\rho\sigma^{2}|\phi^{\prime\prime}_{k}(t)-\lambda|\right)+\frac{1}{\sigma}\left(\sigma|\phi^{\prime}_{\ell}(t)-\eta|+\rho\sigma^{2}|\phi^{\prime\prime}_{\ell}(t)-\lambda|\right)~{}~{}\hbox{(since $\sigma\geq 1$)}\\ \leq\frac{2}{\sigma}\Big{(}\frac{4ML}{\mu}\Big{)}^{2}\leq 2\triangle,\end{array}

a contradiction to the well-separated condition (3). Thus the sets 𝒢,0K\mathcal{G}_{\ell},0\leq\ell\leq K are nonoverlapping. ∎

Since we assume σ1\sigma\geq 1, from (3), we have

σ|ϕk(t)ϕ(t)|+ρσ2|ϕk′′(t)ϕ′′(t)|σ(|ϕk(t)ϕ(t)|+ρ|ϕk′′(t)ϕ′′(t)|2σ.\begin{array}[]{l}\sigma|\phi^{\prime}_{k}(t)-\phi^{\prime}_{\ell}(t)|+\rho\;\sigma^{2}|\phi^{\prime\prime}_{k}(t)-\phi^{\prime\prime}_{\ell}(t)|\geq\sigma\Big{(}|\phi^{\prime}_{k}(t)-\phi^{\prime}_{\ell}(t)|+\rho|\phi^{\prime\prime}_{k}(t)-\phi^{\prime\prime}_{\ell}(t)|\geq 2\sigma\triangle.\end{array} (53)
Lemma 4.

For x(t)Aαx(t)\in A_{\alpha}, let (η,λ)\mathfrak{R}(\eta,\lambda) be defined by (49). If σ(4MLμ)2\sigma\triangle\geq\big{(}\frac{4ML}{\mu}\big{)}^{2}, that is αμc04ML\alpha\leq\frac{\mu\sqrt{c_{0}\triangle}}{4ML} when σ=c0α2\sigma=\frac{c_{0}}{\alpha^{2}}, then

|(η,λ)x(t)

(

g
(σ(ηϕ(t)),σ2(λϕ′′(t)))
|
MLσ
,(η,λ)𝒢
,
\begin{array}[]{l}\big{|}\mathfrak{R}(\eta,\lambda)-x_{\ell}(t)\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\eta-\phi^{\prime}_{\ell}(t)),\sigma^{2}(\lambda-\phi^{{\prime}{\prime}}_{\ell}(t))\big{)}\big{|}\leq\frac{ML}{\sqrt{\sigma\triangle}},\forall(\eta,\lambda)\in\mathcal{G}_{\ell},\end{array}
(54)
|(ϕ(t),ϕ′′(t))x(t)|ML2σ.\begin{array}[]{l}\big{|}\mathfrak{R}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))-x_{\ell}(t)\big{|}\leq\frac{ML}{\sqrt{2\sigma\triangle}}.\end{array} (55)
Proof.

By (50), we have for any (η,λ)𝒢(\eta,\lambda)\in\mathcal{G}_{\ell},

|(η,λ)x(t)

(

g
(σ(ηϕ(t)),σ2(λϕ′′(t)))
|
=|kxk(t)

(

g
(σ(ηϕk(t)),σ2(λϕk′′(t)))
|
kAk(t)L(σ|ηϕk(t)|+ρσ2|λϕk′′(t)|)12(by (20))kAk(t)L(σ|ϕ(t)ϕk(t)|σ|ηϕ(t)|+ρσ2|ϕ′′(t)ϕk′′(t)|ρσ2|λϕ′′(t)|)12kAk(t)L(2σ(4MLμ)2)12(by (53) and (27))MLσ,
\begin{array}[]{l}\big{|}\mathfrak{R}(\eta,\lambda)-x_{\ell}(t)\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\eta-\phi^{\prime}_{\ell}(t)),\sigma^{2}(\lambda-\phi^{{\prime}{\prime}}_{\ell}(t))\big{)}\big{|}\\ =\Big{|}\sum_{k\not=\ell}x_{k}(t)\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\eta-\phi^{\prime}_{k}(t)),\sigma^{2}(\lambda-\phi^{{\prime}{\prime}}_{k}(t))\big{)}\Big{|}\\ \leq\sum_{k\not=\ell}A_{k}(t)L\big{(}\sigma|\eta-\phi^{\prime}_{k}(t)|+\rho\sigma^{2}|\lambda-\phi^{{\prime}{\prime}}_{k}(t)|\big{)}^{-\frac{1}{2}}\hbox{(by \eqref{inequality_g1})}\\ \leq\sum_{k\not=\ell}A_{k}(t)L\big{(}\sigma|\phi^{\prime}_{\ell}(t)-\phi^{\prime}_{k}(t)|-\sigma|\eta-\phi^{{\prime}}_{\ell}(t)|+\rho\sigma^{2}|\phi^{\prime\prime}_{\ell}(t)-\phi^{\prime\prime}_{k}(t)|-\rho\sigma^{2}|\lambda-\phi^{{\prime}{\prime}}_{\ell}(t)|\big{)}^{-\frac{1}{2}}\\ \leq\sum_{k\not=\ell}A_{k}(t)L\big{(}2\sigma\triangle-\big{(}\frac{4ML}{\mu}\big{)}^{2}\big{)}^{-\frac{1}{2}}\hbox{(by \eqref{extra_ineq} and \eqref{def_Gell})}\\ \leq\frac{ML}{\sqrt{\sigma\triangle}},\end{array}

since σ(4MLμ)2\sigma\triangle\geq\big{(}\frac{4ML}{\mu}\big{)}^{2}. This proves (54). The proof (55) is similar and the details are omitted. ∎


Proof of Theorem (a). Let (η,λ)𝒢(\eta,\lambda)\in\mathcal{G}. Suppose (η,λ)G(\eta,\lambda)\not\in G_{\ell} for any \ell. Then

σ|ηϕk(t)|+ρσ2|λϕk′′(t)|>(4MLμ)2.\sigma|\eta-\phi^{\prime}_{k}(t)|+\rho\sigma^{2}|\lambda-\phi^{{\prime}{\prime}}_{k}(t)|>\big{(}\frac{4ML}{\mu}\big{)}^{2}.

Hence,

|(η,λ)|=|k=0Kxk(t)

(

g
(σ(ηϕk(t)),σ2(λϕk′′(t)))
|
k=0KAk(t)L(σ|ηϕk(t)|+σ2|λϕk′′(t)|)12(by (20))<k=0KAk(t)L4ML/μ=μ4.
\begin{array}[]{l}\big{|}\mathfrak{R}(\eta,\lambda)\big{|}=\Big{|}\sum_{k=0}^{K}x_{k}(t)\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\eta-\phi^{\prime}_{k}(t)),\sigma^{2}(\lambda-\phi^{{\prime}{\prime}}_{k}(t))\big{)}\Big{|}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq\sum_{k=0}^{K}A_{k}(t)\frac{L}{\big{(}\sigma|\eta-\phi^{\prime}_{k}(t)|+\sigma^{2}|\lambda-\phi^{{\prime}{\prime}}_{k}(t)|\big{)}^{\frac{1}{2}}}~{}~{}\hbox{(by \eqref{inequality_g1})}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}<\sum_{k=0}^{K}\frac{A_{k}(t)L}{4ML/\mu}=\frac{\mu}{4}.\end{array}

This, together with (52), implies

|𝔖(η,λ)||𝔖(η,λ)(η,λ)|+|(η,λ)|αM(B1c0N+π3B2c03N3)+μ4μ4+μ4=μ2,\begin{array}[]{l}\big{|}\mathfrak{S}(\eta,\lambda)\big{|}\leq\big{|}\mathfrak{S}(\eta,\lambda)-\mathfrak{R}(\eta,\lambda)\big{|}+\big{|}\mathfrak{R}(\eta,\lambda)\big{|}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq\alpha M\big{(}B_{1}c_{0}N+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)}+\frac{\mu}{4}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq\frac{\mu}{4}+\frac{\mu}{4}=\frac{\mu}{2},\end{array}

where the second last inequality follows (26) on the condition for α\alpha. This leads to a contradiction that (η,λ)𝒢(\eta,\lambda)\in\mathcal{G}. Hence there must exist \ell such that (η,λ)𝒢(\eta,\lambda)\in\mathcal{G}_{\ell}. Lemma 3 has shown that 𝒢,0K\mathcal{G}_{\ell},0\leq\ell\leq K are disjoint.

Finally we show that each 𝒢\mathcal{G}_{\ell} is non-empty. To this regard, we show (ϕ(t),ϕ′′(t))𝒢(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))\in\mathcal{G}. Indeed, the following fact followed from (55)

|(ϕ(t),ϕ′′(t))||x(t)|ML2σμμ42>3μ4\begin{array}[]{l}\big{|}\mathfrak{R}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))\big{|}\geq|x_{\ell}(t)|-\frac{ML}{\sqrt{2\sigma\triangle}}\geq\mu-\frac{\mu}{4\sqrt{2}}>\frac{3\mu}{4}\end{array}

implies

|𝔖(ϕ(t),ϕ′′(t))||(ϕ(t),ϕ′′(t))||𝔖(ϕ(t),ϕ′′(t))(ϕ(t),ϕ′′(t))|>3μ4μ4=μ2.\begin{array}[]{l}\big{|}\mathfrak{S}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))\big{|}\geq\left|\mathfrak{R}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))\right|-\big{|}\mathfrak{S}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))-\mathfrak{R}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))\big{|}>\frac{3\mu}{4}-\frac{\mu}{4}=\frac{\mu}{2}.\end{array}

Hence (ϕ(t),ϕ′′(t))𝒢(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))\in\mathcal{G}. \square


Proof of (29). By the definition of η^\widehat{\eta}_{\ell} and λ^\widehat{\lambda}_{\ell}, (52) and (55), we have

|𝔖(η^,λ^)||𝔖(ϕ(t),ϕ′′(t))||(ϕ(t),ϕ′′(t))|αM(c0NB1+π3B2c03N3)A(t)LM2σαM(c0NB1+π3B2c03N3)A(t)αM(Lc0+c0NB1+π3B2c03N3).\begin{array}[]{l}|\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})|\geq|\mathfrak{S}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))|\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\geq|\mathfrak{R}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))|-\alpha M\big{(}c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\geq A_{\ell}(t)-\frac{LM}{\sqrt{2\sigma\triangle}}-\alpha M\big{(}c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\geq A_{\ell}(t)-\alpha M\Big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\Big{)}.\end{array} (56)

On the other hand, by (52) and (54), we have

|𝔖(η^,λ^)||(η^,λ^)|+αM(c0NB1+π3B2c03N3)|x(t)

(

g
(σ(η^ϕ(t)),σ2(λ^ϕ′′(t)))
|
+LMσ+αM(c0NB1+π3B2c03N3)
A(t)+αM(Lc0+c0NB1+π3B2c03N3)(since |(g(η,λ)|1).
\begin{array}[]{l}|\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})|\leq|\mathfrak{R}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})|+\alpha M\big{(}c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq|x_{\ell}(t)\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\widehat{\eta}_{\ell}-\phi^{\prime}_{\ell}(t)),\sigma^{2}(\widehat{\lambda}_{\ell}-\phi^{{\prime}{\prime}}_{\ell}(t))\big{)}\big{|}+\frac{LM}{\sqrt{\sigma\triangle}}+\alpha M\big{(}c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)}\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}\leq A_{\ell}(t)+\alpha M\Big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\Big{)}\hbox{(since $|\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}(\eta,\lambda)|\leq 1$).}\end{array}
(57)

Relationship of |𝔖(η^,λ^)||\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})| and A(t)A_{\ell}(t) in (56) and (57) leads to (29). \square


Proof of (30). Write 𝔖(η^,λ^)=|𝔖(η^,λ^)|ei2πψ(t)\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})=|\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})|e^{i2\pi\psi(t)} for some real-valued function ψ(t)\psi(t). Since for any complex number z1,z2z_{1},z_{2}, ||z1||z2|||z1z2|\big{|}|z_{1}|-|z_{2}|\big{|}\leq|z_{1}-z_{2}|, we have

A(t)||

(

g
(σ(η^ϕ(t)),σ2(λ^ϕ′′(t)))
|
1
|
A(t)|

(

g
(σ(η^ϕ(t)),σ2(λ^ϕ′′(t)))ei2πϕ(t)
ei2πψ(t)
|
=|

(

g
(σ(η^ϕ(t)),σ2(λ^ϕ′′(t)))x(t)
A(t)ei2πψ(t)
|
|

(

g
(σ(η^ϕ(t)),σ2(λ^ϕ′′(t)))x(t)
𝔖(η^,λ^)
|
+|𝔖(η^,λ^)A(t)ei2πψ(t)|
|

(

g
(σ(η^ϕ(t)),σ2(λ^ϕ′′(t)))x(t)
(η^,λ^)
|
+|𝔖(η^,λ^)(η^,λ^)|+||𝔖(η^,λ^)|A(t)|
MLσ+αM(c0NB1+π3MB2c03N3)+αM(Lc0+c0NB1+π3B2c03N3)=2αM(Lc0+c0NB1+π3B2c03N3),
\begin{array}[]{l}A_{\ell}(t)\big{|}|\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\widehat{\eta}_{\ell}-\phi^{\prime}_{\ell}(t)),\sigma^{2}(\widehat{\lambda}_{\ell}-\phi^{{\prime}{\prime}}_{\ell}(t))\big{)}|-1\big{|}\\ \leq A_{\ell}(t)\big{|}\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\widehat{\eta}_{\ell}-\phi^{\prime}_{\ell}(t)),\sigma^{2}(\widehat{\lambda}_{\ell}-\phi^{{\prime}{\prime}}_{\ell}(t))\big{)}e^{i2\pi\phi_{\ell}(t)}-e^{-i2\pi\psi(t)}\big{|}\\ =\big{|}\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\widehat{\eta}_{\ell}-\phi^{\prime}_{\ell}(t)),\sigma^{2}(\widehat{\lambda}_{\ell}-\phi^{{\prime}{\prime}}_{\ell}(t))\big{)}x_{\ell}(t)-A_{\ell}(t)e^{-i2\pi\psi(t)}\big{|}\\ \leq\big{|}\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\widehat{\eta}_{\ell}-\phi^{\prime}_{\ell}(t)),\sigma^{2}(\widehat{\lambda}_{\ell}-\phi^{{\prime}{\prime}}_{\ell}(t))\big{)}x_{\ell}(t)-\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})\big{|}+\big{|}\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})-A_{\ell}(t)e^{-i2\pi\psi(t)}\big{|}\\ \leq\big{|}\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}\big{(}\sigma(\widehat{\eta}_{\ell}-\phi^{\prime}_{\ell}(t)),\sigma^{2}(\widehat{\lambda}_{\ell}-\phi^{{\prime}{\prime}}_{\ell}(t))\big{)}x_{\ell}(t)-\mathfrak{R}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})\big{|}+\big{|}\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})-\mathfrak{R}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})\big{|}+\big{|}|\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})|-A_{\ell}(t)\big{|}\\ \leq\frac{ML}{\sqrt{\sigma\triangle}}+\alpha M\big{(}c_{0}NB_{1}+\frac{\pi}{3}MB_{2}c_{0}^{3}N^{3}\big{)}+\alpha M\big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)}\\ =2\alpha M\big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)},\end{array}

where the second inequality follows from (54), (52), and (29). Thus

(

g
\mathchoice{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\displaystyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{4.10278pt}{3.8889pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\textstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.87193pt}{2.72223pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptstyle g\hss$\crcr}}}\limits}{\mathop{\vbox{\halign{#\cr\kern 0.80002pt$\hss\leavevmode\resizebox{2.05138pt}{1.94444pt}{\rotatebox[origin={c}]{90.0}{(}}\hss$\crcr\nointerlineskip\cr$\hss\scriptscriptstyle g\hss$\crcr}}}\limits}
satisfies (21) with η=σ(η^ϕ(t)),λ=σ2(λ^ϕ′′(t)\eta=\sigma(\widehat{\eta}_{\ell}-\phi^{\prime}_{\ell}(t)),\lambda=\sigma^{2}(\widehat{\lambda}_{\ell}-\phi^{{\prime}{\prime}}_{\ell}(t) and ε=α\varepsilon=\alpha. Hence (30) holds by the property (b) of the admissible window function gg. \square


Proof of (32). By (52) and (55), we have

|𝔖(η^,λ^)x(t)||𝔖(η^,λ^)𝔖(ϕ(t),ϕ′′(t))|+|𝔖(ϕ(t),ϕ′′(t))(ϕ(t),ϕ′′(t))|+|(ϕ(t),ϕ′′(t))x(t)||1σg(τσ)(ei2πη^τiπλ^τ2ei2πϕ^(t)τiπϕ^′′(t)τ2)𝑑τ|+αM(c0NB1+π3B2c03N3)+LMσ1σg(τσ)|2πη^τ+πλ^τ22πϕ(t)τπϕ′′(t)τ2|𝑑τ+αM(Lc0+c0NB1+π3B2c03N3)2π|η^ϕ(t)|1σg(τσ)|τ|𝑑τ+π|λ^ϕ′′(t)|1σg(τσ)τ2𝑑τ+αM(Lc0+c0NB1+π3B2c03N3)2π|η^ϕ(t)σN+π|λ^ϕ′′(t)|σ2N2+αM(Lc0+c0NB1+π3B2c03N3)=o(1)+αM(Lc0+c0NB1+π3B2c03N3),\begin{array}[]{l}\big{|}\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})-x_{\ell}(t)\big{|}\\ \leq\big{|}\mathfrak{S}(\widehat{\eta}_{\ell},\widehat{\lambda}_{\ell})-\mathfrak{S}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))\big{|}+\big{|}\mathfrak{S}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))-\mathfrak{R}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))\big{|}+\big{|}\mathfrak{R}(\phi^{\prime}_{\ell}(t),\phi^{\prime\prime}_{\ell}(t))-x_{\ell}(t)\big{|}\\ \leq\Big{|}\frac{1}{\sigma}\int_{\mathbb{R}}g(\frac{\tau}{\sigma})\big{(}e^{-i2\pi\widehat{\eta}_{\ell}\tau-i\pi\widehat{\lambda}_{\ell}\tau^{2}}-e^{-i2\pi\widehat{\phi}^{\prime}_{\ell}(t)\tau-i\pi\widehat{\phi}^{\prime\prime}_{\ell}(t)\tau^{2}}\big{)}d\tau\Big{|}+\alpha M\big{(}c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\big{)}+\frac{LM}{\sqrt{\sigma\triangle}}\\ \leq\frac{1}{\sigma}\int_{\mathbb{R}}g(\frac{\tau}{\sigma})\big{|}2\pi\widehat{\eta}_{\ell}\tau+\pi\widehat{\lambda}_{\ell}\tau^{2}-2\pi\phi^{\prime}_{\ell}(t)\tau-\pi\phi^{\prime\prime}_{\ell}(t)\tau^{2}\big{|}d\tau+\alpha M\Big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\Big{)}\\ \leq 2\pi|\widehat{\eta}_{\ell}-\phi^{\prime}_{\ell}(t)|\frac{1}{\sigma}\int_{\mathbb{R}}g(\frac{\tau}{\sigma})|\tau|d\tau+\pi|\widehat{\lambda}_{\ell}-\phi^{\prime\prime}_{\ell}(t)|\frac{1}{\sigma}\int_{\mathbb{R}}g(\frac{\tau}{\sigma})\tau^{2}d\tau+\alpha M\Big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\Big{)}\\ \leq 2\pi|\widehat{\eta}_{\ell}-\phi^{\prime}_{\ell}(t)\sigma N+\pi|\widehat{\lambda}_{\ell}-\phi^{\prime\prime}_{\ell}(t)|\sigma^{2}N^{2}+\alpha M\Big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\Big{)}\\ =o(1)+\alpha M\Big{(}\frac{L}{\sqrt{c_{0}\triangle}}+c_{0}NB_{1}+\frac{\pi}{3}B_{2}c_{0}^{3}N^{3}\Big{)},\end{array}

where the last equality follows from (30). This completes the proof of (32). \square

Acknowledgments

The authors thank the anonymous reviewers for their valuable comments.

This work was partially supported by the ARO under Grant \sharp W911NF2110218, HKBU Grant \sharp RC-FNRA-IG/18-19/SCI/01, the Simons Foundation under Grant \sharp 353185, the National Natural Science Foundation of China under Grants \sharp 62071349.

References

  • [1] N.E. Huang, Z. Shen, S.R. Long, M.L. Wu, H.H. Shih, Q. Zheng, N.C. Yen, C.C. Tung, and H.H. Liu, “The empirical mode decomposition and Hilbert spectrum for nonlinear and nonstationary time series analysis,” Proc. Roy. Soc. London A, vol. 454, no. 1971, pp. 903–995, Mar. 1998.
  • [2] P. Flandrin, G. Rilling, and P. Goncalves, “Empirical mode decomposition as a filter bank,” IEEE Signal Proc. Letters, vol. 11, no. 2, pp. 112–114, Feb. 2004.
  • [3] N. Ur Rehman and D. P. Mandic, “Filter bank property of multivariate empirical mode decomposition,” IEEE Trans. Signal Proc., vol. 59, no. 5, pp. 2421-2426, May 2011.
  • [4] G. Rilling and P. Flandrin, “One or two frequencies? The empirical mode decomposition answers,” IEEE Trans. Signal Proc., vol. 56, pp. 85–95, Jan. 2008.
  • [5] Z. Wu and N.E. Huang, “Ensemble empirical mode decomposition: A noise-assisted data analysis method,” Adv. Adapt. Data Anal., vol. 1, no. 1, pp. 1–41, Jan. 2009.
  • [6] Y.S. Xu, B. Liu, J. Liu, and S. Riemenschneider, “Two-dimensional empirical mode decomposition by finite elements,” Proc. Roy. Soc. London A, vol. 462, no. 2074, pp. 3081–3096, Oct. 2006.
  • [7] L. Lin, Y. Wang, and H.M. Zhou, ”Iterative filtering as an alternative algorithm for empirical mode decomposition,” Adv. Adapt. Data Anal., vol. 1, no. 4, pp. 543–560, Oct. 2009.
  • [8] N. Ur Rehman and D.P. Mandic, “Empirical mode decomposition for trivariate signals,” IEEE Trans. Signal Proc., vol. 58, no. 3, pp. 1059-68, Mar. 2010.
  • [9] T. Oberlin, S. Meignen, and V. Perrier, “An alternative formulation for the empirical mode decomposition,” IEEE Trans. Signal Proc., vol. 60, no. 5, pp. 2236–2246, May 2012.
  • [10] Y. Wang, G.-W. Wei and S.Y. Yang , “Iterative filtering decomposition based on local spectral evolution kernel,” J. Scientific Computing, vol. 50, no. 3, pp. 629–664, Mar. 2012.
  • [11] A. Cicone, J.F. Liu, and H.M. Zhou, “Adaptive local iterative filtering for signal decomposition and instantaneous frequency analysis,” Appl. Comput. Harmon. Anal., vol. 41, no. 2, pp. 384–411, Sep. 2016.
  • [12] J. Gilles, “Empirical wavelet transform,” IEEE Trans. Signal Proc., vol. 61, no. 16, pp. 3999-4010, Aug. 2013.
  • [13] L. Li, H.Y. Cai, Q.T. Jiang and H.B. Ji, “An empirical signal separation algorithm for multicomponent signals based on linear time-frequency analysis,” Mechanical Systems and Signal Proc., vol. 121, no. 4, pp. 791–809, Apr. 2019.
  • [14] M.D. van der Walt, “Empirical mode decomposition with shape-preserving spline interpolation,”Results in Appl. Math., vol. 5, 100086, Feb. 2020.
  • [15] L. Li and H.B. Ji, “Signal feature extraction based on improved EMD method,” Measurement, vol. 42, pp. 796–803, Jun. 2009.
  • [16] L. Cohen, Time-frequency Analysis, Prentice Hall, New Jersey, 1995.
  • [17] H. Hassanpour, M. Mesbah and B. Boashash, “SVD-based TF feature extraction for newborn EEG seizure,” EURASIP Journal on Advances in Signal Proc., vol. 16, pp. 2544–2554, 2004.
  • [18] L. Stankovic´\acute{\rm c}, T. Thayaparan, and M. Dakovic´\acute{\rm c}, “Signal decomposition by using the S-method with application to the analysis of HF radar signals in sea-clutter,” IEEE Trans. Signal Proc., vol. 54, no. 11, pp. 4332–4342, Nov. 2006.
  • [19] L. Stankovic´\acute{\rm c}, D. Mandic´\acute{\rm c}, M. Dakovic´\acute{\rm c}, and M. Brajovic´\acute{\rm c}, “Time-frequency decomposition of multivariate multicomponent signals,” Signal Proc., vol. 142, pp. 468–479, Jan. 2018.
  • [20] I. Daubechies, J.F. Lu, and H.-T. Wu, “Synchrosqueezed wavelet transforms: An empirical mode decomposition-like tool,” Appl. Computat. Harmon. Anal., vol. 30, no. 2, pp. 243–261, Mar. 2011.
  • [21] I. Daubechies and S. Maes, “A nonlinear squeezing of the continuous wavelet transform based on auditory nerve models,” in A. Aldroubi, M. Unser Eds. Wavelets in Medicine and Biology, CRC Press, 1996, pp. 527-546.
  • [22] G. Thakur and H.-T. Wu, “Synchrosqueezing based recovery of instantaneous frequency from nonuniform samples,” SIAM J. Math. Anal., vol. 43, pp. 2078–2095, 2011.
  • [23] H.-T. Wu, Adaptive Analysis of Complex Data Sets, Ph.D. dissertation, Princeton Univ., Princeton, NJ, 2012.
  • [24] T. Oberlin, S. Meignen, and V. Perrier, “The Fourier-based synchrosqueezing transform,” in Proc. 39th Int. Conf. Acoust., Speech, Signal Process. (ICASSP), 2014, pp. 315–319.
  • [25] S. Meignen, T. Oberlin, and S. McLaughlin, “A new algorithm for multicomponent signals analysis based on synchrosqueezing: With an application to signal sampling and denoising,” IEEE Trans. Signal Proc., vol. 60, no. 11, pp. 5787–5798, Nov. 2012.
  • [26] F. Auger, P. Flandrin, Y. Lin, S.McLaughlin, S. Meignen, T. Oberlin, and H.-T. Wu, “Time-frequency reassignment and synchrosqueezing: An overview,” IEEE Signal Process. Mag., vol. 30, no. 6, pp. 32–41, Nov. 2013.
  • [27] C. Li and M. Liang, “Time frequency signal analysis for gearbox fault diagnosis using a generalized synchrosqueezing transform,” Mechanical Systems and Signal Proc., vol. 26, pp. 205–217, Jan. 2012.
  • [28] S.B. Wang, X.F. Chen, I.W. Selesnick, Y.J. Guo, C.W. Tong and X.W. Zhang, “Matching synchrosqueezing transform: A useful tool for characterizing signals with fast varying instantaneous frequency and application to machine fault diagnosis,” Mechanical Systems and Signal Proc., vol. 100, pp. 242–288, Feb. 2018.
  • [29] H.Z. Yang, J.F. Lu, and L.X. Ying, “Crystal image analysis using 2D synchrosqueezed transforms,” Multiscale Modeling &\& Simulation, vol. 13, no. 4, pp. 1542–1572, 2015.
  • [30] J.F. Lu and H.Z. Yang, “Phase-space sketching for crystal image analysis based on synchrosqueezed transforms,” SIAM J. Imaging Sci., vol. 11, no. 3, pp.1954–1978, 2018.
  • [31] K. He, Q. Li, and Q. Yang, “Characteristic analysis of welding crack acoustic emission signals using synchrosqueezed wavelet transform,” J. Testing and Evaluation, vol. 46, no. 6, pp. 2679–2691, 2018.
  • [32] H.-T. Wu, Y.-H. Chan, Y.-T. Lin, and Y.-H. Yeh, “Using synchrosqueezing transform to discover breathing dynamics from ECG signals,”Appl. Comput. Harmon. Anal., vol. 36, no. 2, pp. 354–459, Mar. 2014.
  • [33] H.-T. Wu, R. Talmon, and Y.L. Lo, “Assess sleep stage by modern signal processing techniques,” IEEE Trans. Biomedical Engineering, vol. 62, no. 4, 1159–1168, 2015.
  • [34] C. L. Herry, M. Frasch, A. J. Seely1, and H. -T. Wu, “Heart beat classification from single-lead ECG using the synchrosqueezing transform,” Physiological Measurement, vol. 38, no. 2, Jan. 2017.
  • [35] S. Wang, X. Chen, G. Cai, B. Chen, X. Li, and Z. He, “Matching demodulation transform and synchrosqueezing in time-frequency analysis,” IEEE Trans. Signal Proc., vol. 62, no. 1, pp. 69–84, 2014.
  • [36] Q.T. Jiang and B.W. Suter, “Instantaneous frequency estimation based on synchrosqueezing wavelet transform,” Signal Proc., vol. 138, no.9, pp.167–181, 2017.
  • [37] C. Li and M. Liang, “A generalized synchrosqueezing transform for enhancing signal time-frequency representation,” Signal Proc., vol. 92, no. 9, pp. 2264–2274, 2012.
  • [38] T. Oberlin, S. Meignen, and V. Perrier, “Second-order synchrosqueezing transform or invertible reassignment? towards ideal time-frequency representations,” IEEE Trans. Signal Proc., vol. 63, no. 5, pp.1335–1344, Mar. 2015.
  • [39] T. Oberlin and S. Meignen, “The 2nd-order wavelet synchrosqueezing transform,” in 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), March 2017, New Orleans, LA, USA.
  • [40] D.H. Pham and S. Meignen, “High-order synchrosqueezing transform for multicomponent signals analysis- With an application to gravitational-wave signal,” IEEE Trans. Signal Proc., vol. 65, no. 12, pp.3168–3178, Jun. 2017.
  • [41] L. Li, Z.H. Wang, H.Y. Cai, Q.T. Jiang, and H.B. Ji, “Time-varying parameter-based synchrosqueezing wavelet transform with the approximation of cubic phase functions,” in 2018 14th IEEE Int’l Conference on Signal Proc. (ICSP), pp. 844–848, Aug. 2018.
  • [42] L. Li, H.Y. Cai, H.X. Han, Q.T. Jiang and H.B. Ji, “Adaptive short-time Fourier transform and synchrosqueezing transform for nonstationary signal separation,” Signal Proc., vol. 166, 2020, 107231.
  • [43] L. Li, H.Y. Cai, and Q.T. Jiang, “Adaptive synchrosqueezing transform with a time-varying parameter for nonstationary signal separation,” Appl. Comput. Harmon. Anal., vol. 49, 1075–1106, 2020.
  • [44] J. Lu, Q.T. Jiang and L. Li, “Analysis of adaptive synchrosqueezing transform with a time-varying parameter,” Advances in Comput. Math., vol. 46, 2020, Article number: 72.
  • [45] H.Y. Cai, Q.T. Jiang, L. Li, and B.W. Suter, “Analysis of adaptive short-time Fourier transform-based synchrosqueezing transform,” Analysis and Applications, vol. 19, no. 1, pp. 71–105, 2021.
  • [46] Y.-L. Sheu, L.-Y. Hsu, P.-T. Chou, and H.-T. Wu, “Entropy-based time-varying window width selection for nonlinear-type TF analysis,” Int’l J. Data Sci. Anal., vol. 3, pp. 231–245, 2017.
  • [47] A. Berrian and N. Saito, “Adaptive synchrosqueezing based on a quilted short-time Fourier transform,” arXiv:1707.03138v5, Sep. 2017.
  • [48] C.K. Chui and H.N. Mhaskar, “Signal decomposition and analysis via extraction of frequencies,” Appl. Comput. Harmon. Anal., vol. 40, no. 1, pp. 97–136, 2016.
  • [49] C.K. Chui and N.N. Han, “Wavelet thresholding for recovery of active sub-signals of a composite signal from its discrete samples,” Appl. Comput. Harmon. Anal., vol. 52, pp. 1–24, 2021.
  • [50] C.K. Chui, Q.T. Jiang, L. Lin, and J. Lu, “Signal separation based on adaptive continuous wavelet-like transform and analysis,” Appl. Comput. Harmon. Anal., vol. 53, pp. 151–179, 2021.
  • [51] L. Li, C.K. Chui, and Q.T. Jiang, “Direct signals separation via extraction of local frequencies with adaptive time-varying parameters,” preprint, 2020. arXiv2010.01866v1
  • [52] C.K. Chui, Q.T. Jiang, L. Li, and J. Lu, “Analysis of an adaptive short-time Fourier transform-based multicomponent signal separation method derived from linear chirp local approximation”, Journal of Comput. & Appl. Math., vol. 382, 2021, 113074.
  • [53] V.C. Chen, F. Li, S.-S. Ho, and H. Wechsler, “Micro-Doppler effect in radar : phenomenon, model, and simulation study,” IEEE Trans. Aerosp. Electron. Syst., vol. 42, no. 1, pp. 2–21, 2006.
  • [54] L. Stankovic´\acute{\rm c}, I. Orovic´\acute{\rm c}, S. Stankovic´\acute{\rm c}, and M. Amin, “Compressive sensing based separation of nonstationary and stationary signals overlapping in time-frequency,” IEEE Trans. Signal Proc., vol 61, no. 18, pp. 4562–4572, Sep. 2013.
  • [55] P. Li, and Q.H. Zhang, “IF estimation of overlapped multicomponent signals based on viterbi algorithm,” Circuits, Syst., Signal Process., vol 39, no. 6, pp. 3105-3124, 2020.
  • [56] X.X. Zhu, H.Z. Yang, Z.S. Zhang, J.H. Guo, and N.H. Liu, “Frequency-chirprate reassignment,” Digit. Signal Process., vol 104, 102783, Jun. 2020.
  • [57] V. Bruni, M. Tartaglione, and D. Vitulano,“Radon spectrogram-based approach for automatic IFs separation,” EURASIP J. Adv. Signal Process., pp. 1-21, Mar. 2020.
  • [58] V. Bruni, M. Tartaglione, and D. Vitulano,“A pde-based analysis of the spectrogram image for instantaneous frequency estimation,” Mathematics, vol. 9, no. 3, pp. 3105-3124, Jan. 2021.
  • [59] I. Djurovic´\acute{\rm c},“QML-RANSAC instantaneous frequency estimator for overlapping multicomponent signals in the time-frequency plane,” IEEE Signal Proc. Letters, vol. 25, no. 3 447-451, Mar. 2018.
  • [60] N.A. Khan and S. Ali,“A robust and efficient instantaneous frequency estimator of multi-component signals with intersecting time-frequency signatures,” Signal Proc., vol. 177, 107728, Dec. 2020.
  • [61] Y. Yang, X. J. Dong, Z. K. Peng, W. M. Zhang, and G. Meng,“Component extraction for non-stationary multi-component signal using parameterized de-chirping and band-pass filter,”IEEE Signal Proc. Letters, vol. 22, no. 9, 1373-1377, Sep. 2014.
  • [62] S. Chen, X. Dong, G. Xing, Z. Peng, W. Zhang, and G. Meng, “Separation of overlapped non-stationary signals by ridge path regrouping and intrinsic chirp component decomposition,” IEEE Sensors Journals, vol. 17, no. 18, pp. 5994–6005, Sep. 2017.
  • [63] B. Barkat and K. Abed-Meraim, “Algorithms for blind components separation and extraction from the time-frequency distribution of their mixture,” EURASIP J. Appl. Signal Proc., vol. 13, pp. 2025–2033, 2004.
  • [64] S. Chen, Z. Peng, Y.Yang, X. Dong, and W. Zhang, “Intrinsic chirp component decomposition by using Fourier Series representation,” Signal Proc., vol. 137, pp. 319–327, Feb. 2017.
  • [65] O. Chen, X. Lang, L. Xie, and H. Su, “Multivariate intrinsic chirp mode decomposition,” Signal Proc., vol. 183, Jan. 2021.
  • [66] S. Chen, X. Dong, Z. Peng, W. Zhang, and G. Meng, “Nonlinear Chirp Mode Decomposition: A Variational Method,” IEEE Trans. Signal Proc., vol. 65, no. 22, pp. 6024–6037, Nov. 2017.
  • [67] P. Zhou, Y. Yang, S. Chen, Z. Peng, K. Noman, and W.Zhang, “Parameterized model based blind intrinsic chirp source separation,” Digit. Signal Process., vol 83, pp. 73-82, Aug. 2018.
  • [68] Z. Liu, Q. He, S. Chen, X. Dong, Z. Peng, and W. Zhang, “Frequency-domain intrinsic component decomposition for multimodal signals with nonlinear group delays,” Signal Proc., vol. 154, pp. 57-63. 2019.
  • [69] S. Q. Chen, Y. Yang, Z.Peng, X. J. Dong, W. Zhang, and G. Meng, “Adaptive chirp mode pursuit: Algorithm and applications,” Mechanical Systems and Signal Proc., vol. 116, pp. 566–584, Feb. 2019.
  • [70] L. Stankovic´\acute{\rm c}, M. Dakovic´\acute{\rm c}, T.Thayaparan, and V. Bugarin, “Inverse radon transform-based micro-doppler analysis from a reduced set of observations,” IEEE Trans. Aerosp. Electron. Syst., vol. 51, no. 2, pp. 1155–1169, Feb. 2015.
  • [71] S. Mann and S. Haykin, “The chirplet transform: Physical considerations,” IEEE Trans. Signal Proc., vol. 43, no. 11, pp. 2745–2761, Nov. 1995.
  • [72] R. G. Baraniuk, and D. L. Jones, “Wigner-based formulation of the chirplet transform,” IEEE Trans. Signal Proc., vol. 44, no. 12, pp. 3129–3135, Dec. 1996.
  • [73] J. Zheng J, H. Liu, and Q. Liu, “Parameterized centroid frequency-chirp rate distribution for LFM signal analysis and mechanisms of constant delay introduction,” IEEE Trans. Signal Proc., vol. 65, no. 24, pp. 6435–6447, Dec. 2017.
  • [74] K. Czarnecki, D. Fourer, F. Auger, and M. Rojewski, “A fast time-frequency multi-window analysis using a tuning directional kernel,” Signal Proc., vol. 147, pp. 110–119, Jun. 2018.
  • [75] V. Katkovnik, “A new form of the Fourier transform for time-frequency estimation,” Signal Proc., vol. 47, no. 2, pp. 187–200, 1995.
  • [76] X. Li, G. Bi, S. Stankovic´\acute{\rm c}, and A.M. Zoubir, “Local polynomial Fourier transform: A review on recent developments and applications,” Signal Proc., vol. 91, no.6, pp.1370–1393, 2011.
  • [77] L. Stankovic´\acute{\rm c}, M. Dakovic´\acute{\rm c}, and T. Thayaparan, Time-Frequency Signal Analysis with Applications, Artech House, Boston, 2013.
  • [78] G. Beylkin, “Discrete radon transform,” IEEE Trans. Acoust. Speech Signal Process., vol. 35, no. 2, pp. 162-172, Feb. 1987.
  • [79] A. Averbuch and Y. Shkolnisky, “3D Fourier based discrete Radon transform,” Appl. Comput. Harmon. Anal., vol. 15, pp. 33–69, July 2003.
  • [80] M. Wang, A.K. Chan, and C.K. Chui, “Linear frequency-modulated signal detection using Radon-ambiguity transform,” IEEE Trans. Signal Proc., vol. 46, no. 3, pp. 571-586, Mar. 1998.