Next Article in Journal
Dynamical Model of Rotation and Orbital Coupling for Deimos
Next Article in Special Issue
MRG-T: Mask-Relation-Guided Transformer for Remote Vision-Based Pedestrian Attribute Recognition in Aerial Imagery
Previous Article in Journal
A Texture Enhancement Method for Oceanic Internal Wave Synthetic Aperture Radar Images Based on Non-Local Mean Filtering and Texture Layer Enhancement
Previous Article in Special Issue
Seismic Data Reconstruction Using a Phase-Shift-Plus-Interpolation-Based Apex-Shifted Hyperbolic Radon Transform
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Synchrosqueezed Method and Its Theory-Analysis-Based Novel Short-Time Fractional Fourier Transform for Chirp Signals

1
The National Engineering Research Center for Offshore Oil and Gas Exploration, School of Information and Communications Engineering, Xi’an Jiaotong University, Xi’an 710049, China
2
Department of Mathematics, Jiujiang University, Jiujiang 332005, China
3
School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an 710049, China
*
Author to whom correspondence should be addressed.
Remote Sens. 2024, 16(7), 1173; https://doi.org/10.3390/rs16071173
Submission received: 7 December 2023 / Revised: 22 March 2024 / Accepted: 24 March 2024 / Published: 27 March 2024
(This article belongs to the Special Issue Signal Processing Theory and Methods in Remote Sensing)

Abstract

:
Time–frequency analysis is an important tool used for the processing and interpretation of non-stationary signals, such as seismic data and remote sensing data. In this paper, based on the novel short-time fractional Fourier transform (STFRFT), a new modified STFRFT is first proposed which can also generalize the properties of the modified short-time Fourier transform (STFT). Then, in the modified STFRFT domain, we derive the instantaneous frequency estimator for the chirp signal and present a new type of synchrosqueezing STFRFT (FRSST). The proposed FRSST presents many results similar to those of the synchrosqueezing STFT (FSST), and it extends the harmonic signal to a chirp signal that offers attractive new features. Furthermore, we provide a detailed analysis of the signal reconstruction, theories, and some properties of the proposed FRSST. Several experiments are conducted, and all of the results illustrate that the proposed FRSST is more effective than the FSST. Finally, based on the linear amplitude modulation and frequency modulation signal, we present a derivation for analyzing the limitations of the FRSST.

Graphical Abstract

1. Introduction

The Fourier transform (FT) is a fundamental technique used to process and interpret signals [1,2]. It can detect the frequency contents within the signal, and it has been widely applied in speech processing, quantum physics, and remote sensing images. As a generalization of the FT, the fractional FT (FRFT) was designed in the mathematics literature [3,4]. Both the FT and FRFT are global transformations that cannot describe the time location of a frequency or fractional frequency. However, as we know, most actual signals are time-varying frequencies. Thus, it is often necessary to localize the frequency characteristics as they change over time. For this goal, the time–frequency analysis (TFA) method is an effective and important tool that obtains the characterization of time-varying frequencies. Based on the FT, many classical TFA methods have been proposed, such as the short-time FT (STFT), wavelet transform (WT), S transform (ST), Wigner–Ville distribution (WVD), and Cohen class distribution [5,6,7,8,9,10,11,12,13]. As developments of the FRFT, short-time FRFT (STFRFT), fractional wavelet transform (FRWT), and fractional ST were also designed [14,15,16,17,18,19]. All of these TFA tools can analyze the location of the signal frequency response. Unfortunately, due to Heisenberg’s uncertainty principle, traditional methods always provide diffused time–frequency representations (TFRs).
For FT-based TFR, to improve the quality and readability, many methods have been proposed. Among the post-processing tools, the synchrosqueezing transform (SST) is one of the most representative techniques [20,21]. In fact, the SST can be regarded as a special situation of the reassigned method [21,22]. The SST retains superiority in concentrated energy and further allows for signal reconstruction [23]. The SST has, thus, been widely extended and studied. On the one hand, the original SST is based on the CWT, and the innovation was introduced into other classical transforms, such as the STFT, ST, and GST [24,25,26]. On the other hand, the translation direction of TF coefficients changes from the frequency to the time, such the time-reassigned SST and the transient-extracting transform [27,28,29,30]. Moreover, a higher-order expansion of the amplitude and the phase are introduced into the time or frequency domain, which improves the concentration and adaptability of the SST-based method, such as the second-order SST, second SET [31,32,33,34,35], and high-order SST or SET [36,37]. A higher order can provide a more highly concentrated TFR but requires more complex computation. In fact, the SST also inspires some other ideas, such as the multisynchrosqueezing (MSST) and synchroextracting transforms (SET) [38,39], which have also drawn significant attention [40,41,42,43,44]. In conclusion, a perfect system of theory and method for the FT-based SST already exists.
For FRFT-based approaches, it is just the beginning. Considering the resolution and concentration, FRFT-based methods are combined with the idea of the SST. The synchrosqueezed fractional wavelet transform (FRWSST) and synchrosqueezing-based short-time fractional Fourier transform methods have been proposed [45,46,47]. In the FRWSST, theory analysis was built and superiority was shown. In this study, we focus on the paper concerning synchrosqueezing-based short-time fractional Fourier transform [47]. The author provided a corresponding definition, some derivations, and simple calculations, but no systemic mathematical analysis of the approximation theory and properties is available. In our work, the main aim is to bridge this gap.
In fact, there are many different definitions of the STFRFT [14,15,16], but most of these definitions cannot generalize the classical result of the STFT that is interpreted as a bank of filters [48]. To deal with this issue, a novel STFRFT was proposed [48]. In this study, to achieve this goal, we design a modified STFRFT based on the novel STFRFT, and then propose a new fractional synchrosqueezing transform. For the theoretical analysis of errors of instantaneous frequency (IF) estimation and mode reconstruction, we extend the harmonic wave-like signal class to the chirp-like ones. Then, we present a new approximation result that differs slightly from the Fourier-based SST (FSST) [24], and also study some of the properties of the proposed method. Furthermore, we present an analysis of the inapplicability of the approach for linear amplitude modulation signals.
This paper is organized as follows. In Section 2, we briefly review the FRFT and STFRFT. In Section 3, a new FRSST and the corresponding theoretical analysis of the approximation theorem and some of its properties are presented. In Section 4, composite examples are used to demonstrate the performance of the proposed FRSST. Finally, a brief discussion and conclusion are presented in Section 5 and Section 6.

2. Preliminaries

2.1. Fractional Fourier Transform

The fractional Fourier transform (FRFT) is one of the unitary integral transforms. For one given signal f ( t ) L 2 ( ) , the definition of the FRFT is [4]
F α ( u ) = F α { f ( t ) } ( u ) = f ( t ) K α ( t , u ) d t
The kernel K α ( t , u ) is
K α ( t , u ) { B α e j u 2 + t 2 2 cot α j u t csc α , α m π δ ( t u ) , α = 2 m π δ ( t + u ) , α = ( 2 m 1 ) π
where B α = ( 1 j cot α ) / 2 π and m , δ ( ) is the Dirac Delta function, and t and u are the time and fractional frequency, respectively. Like the Fourier transform (FT) spectrum, the FRFT can only provide fractional frequencies within the signal, but it cannot localize frequency characteristics that change with time. Like the short-time FT (STFT), as is well known, the simplest solution is the short-time FRFT (STFRFT) that gives the information of the signal in time and frequency domains [14].

2.2. Short-Time FRFT

Indeed, there are many different STFRFTs proposed in the literature [49,50,51], but none of those definitions can generalize the properties of the STFT. In this situation, Shi et al. proposed a novel STFRFT [48]:
S T F R F T f α ( t , u ) = f ( τ ) g α , t , u * ( τ ) d τ
where
g α , t , u ( τ ) g ( τ t ) e j τ 2 t 2 2 cot α + j τ u csc α
Like the STFT, due to the fixed window, the STFRFT will obtain a TFR with diffused energies. In fact, a synchrosqueezing-based STFRFT has been proposed [47]. However, to our knowledge, no thorough theory is available. In this paper, to bridge that gap, we propose a new synchrosqueezing transform based on the modified novel STFRFT defined by (5).

3. FRSST-Based Novel STFRFT

3.1. Modified Novel STFRFT

Inspired by the modified STFT, we introduce a phase shift ejutcscα into the novel STFRFT (3), and then define the modified STFRFT as
S T F R F T f α ( t , u ) = f ( τ ) g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ
In consideration of the novel STFRFT [48], the modified STFRFT (5) can preserve the properties of the modified STFT well, and has the following equivalent form:
S T F R F T f α ( t , u ) = F α ( u ) G * ( ( u u ) csc α ) K α * ( t , u ) d u
where G * ( · ) means the FT of g(t).

3.2. Definition of the New FRSST

To motivate the new synchrosqueezing short-time FRFT (FRSST), it considers a chirp signal f ( t ) = A e j ϕ ( t ) , where ϕ ( t ) = a + ω 0 t + 1 2 c t 2 , and a Gaussian window function g ( t ) = e σ t 2 . Obviously,
f ( τ + t ) = f ( t ) e i [ ϕ ( t ) τ + 1 2 ϕ ( t ) τ 2 ]
According to (6) and letting α = −arccot(c), we can obtain the FRFT of f(t) as
F α ( u ) = B α | sin α | A e j ω 0 2 4 sin 2 α δ ( u ω 0 sin α )
Substituting (7) into (6),
S T F R F T f α ( t , u ) = A 2 π G ^ ( ω 0 u csc α ) e j ϕ ( t )
Then, we calculate the derivative of the STFRFT as
t S T F R F T f α ( t , u ) = j ϕ ( t ) A 2 π G ^ ( ω 0 u csc α ) e j ϕ ( t ) = j ϕ ( t ) S T F R F T f α ( t , u )
It holds that
t S T F R F T f α ( t , u ) j S T F R F T f α ( t , u ) = ϕ ( t ) = ω 0 + c t
Alongside the FSST, we can define the frequency estimation operator ω f α ( t , ω ) in the modified STFRFT domain as
ω ˜ f α ( t , u ) = { t S T F T f α ( t , u ) j S T F T f α ( t , u ) }
Therefore, the new time–frequency-representative FRSST can be defined as
F R S S T f α ( t , ω ) = Ξ f α S T F R F T f α ( t , u ) δ ( ω ω ˜ f α ( t , u ) ) d u
where Ξ f α { u + | S T F R F T f α ( t , u ) 0 } . If the α = π / 2 , the proposed FRSST becomes the conventional FSST. It is worth noting that the proposed FRSST preserves some properties of the conventional FSST, which will be analyzed in detail. Similar to the FSST [24,31], the FRSST only reassigns the coefficients and does not lose any information. The FRSST, thus, allows for the reconstruction of the signal, which can be proven by the following expression:
F R S S T ( t , ω ) d ω = × + S T F R F T f α ( t , u ) δ ( ω ω ˜ f α ( t , u ) ) d u d ω = S T F R F T f α ( t , u ) d u = F α ( u ) K α * ( t , u ) + G * ( ( u u ) csc α ) d u d u = 2 π csc α g ( 0 ) F α ( u ) K α * ( t , u ) d u = 2 π csc α g ( 0 ) f ( t )
Equation (12) illustrates that the proposed FRSST can restore the original signal. The corresponding inverse FRSST is defined by
f ( t ) = csc α 2 π g ( 0 ) F R S S T ( t , ω ) d ω

3.3. Theoretical Analysis of FRSSTT

In this section, we define a class of functions like the linear chirp that are well-separated and give an approximation result to show that the proposed new FRSST can successfully handle the defined class of signals. We start with the following definitions and propositions.
Definition 1.
Let  ε > 0 ,  c > 0  and  Δ > 0 . The set  A Δ , ε , c  of multicomponent signals  f ( t )  is the set of all multicomponent signals with the amplitude  A n ( t )  and phase  ϕ n ( t )  satisfying the following conditions:
A n ( t ) C 1 ( ) L ( ) , ϕ n ( t ) C 2 ( ) , sup t R ϕ n ( t ) < , ϕ n ( t ) > 0 t , | A n ( t ) | ε , | ϕ n ( t ) c | ε t .
Further,  f n ( t ) = A n ( t ) e j ϕ n ( t )  are separated with the fractional resolution  Δ , i.e., for all  n { 1 , , N 1 }  and all  t ,
ϕ n + 1 ( t ) ϕ n ( t ) 2 Δ
Definition 2.
Let function  h ( t ) C ( )  and  h ( t ) d t = 1 , and set the threshold  ε ˜  and the accuracy  λ . The FRSST of  f ( t ) A Δ , ε , c  with  ε ˜  and  λ  can be defined by:
F R S S T f λ , ε ˜ ( t , ω ) = csc α 2 π g ( 0 ) Ξ f α S T F R F T f α ( t , u ) 1 λ h ( ω ω ˜ f α ( t , u ) λ ) d u
where  Ξ f α { u + | S T F R F T f α ( t , u ) 0 } . When  ε ˜  and  λ  approach zero, we obtain the usual formula as in (11).
Without the loss of generality, assuming s 0 and according to Definition 1, for n { 1 , , N } , the following can easily be obtained:
| A ( t + s ) A ( t ) | = 0 s A n ( t + ξ ) d ξ ε s
and
| ϕ n ( t + s ) ϕ n ( t ) c s | = 0 s ( ϕ n ( t + ξ ) c ) d ξ ε s
Furthermore, for any n { 1 , , N } and t 0 ,
ϕ n ( t ) c 2 t 2 = ϕ n ( t 0 ) c 2 t 0 2 + ( ϕ n ( t 0 ) c t 0 ) ( t t 0 ) + 0 t t 0 ( ϕ n ( t 0 + s ) ϕ n ( t 0 ) c s ) d s
Under these definitions and equivalences, we present the following two propositions:
Proposition 1.
For the multicomponent signals  f ( t ) = n = 1 N f n ( t )  and any  ( t , u ) 2 , it leads to
| S T F R F T f α ( t , u ) n = 1 N f n ( t ) G ( u csc α ( ϕ n ( t ) c t ) ) | ε Γ 1 ( t )
where  Γ 1 ( t ) = N I 1 + 1 2 I 2 n = 1 N A n ( t ) , and  I k = | x | k | g ( x ) | d x .
Proof. 
See Appendix A. □
Proposition 2.
For the partial derivative  t S T F R F T f g ( t , u ) ,
| t S T F R F T f α ( t , u ) j n = 1 N f n ( t ) ϕ n ( t ) G ( u csc α ( ϕ n ( t ) c t ) ) | ε ( Γ 2 ( t ) + | u csc α + c t | Γ 1 ( t ) )
where  Γ 2 ( t ) = N I 1 + 1 2 I 2 n = 1 N A n ( t ) , and  I k = | x | k | g ( x ) | d x .
Proof. 
See Appendix B. □
Proposition 1 and Proposition 2 extend the signal class to chirp-like ones and generalize the FT domain to FRFT. Based on these definitions and propositions, we present the following approximation theorem of the proposed new FRSST.
Theorem 1.
Consider  f ( t ) A Δ , ε , c  and set  ε ˜ = ε 1 3 . Let  g ( t ) S ( ) , the Schwartz class, satisfy  s u p p ( g ^ ) [ Δ , Δ ] . Further, if  ε  is small enough, then
(a)  | S T F R F T f α ( t , u ) | > ε ˜  only when there exists  n { 1 , , N }  such that  ( t , u ) Z n : = { ( t , u ) , s . t . | u csc α ( ϕ n ( t ) c t ) | < Δ } .
(b) For each  n { 1 , , N }  and all  ( t , u ) Z n  such that  | S T F R F T f α ( t , u ) | > ε ˜ ,
| ω ˜ f α ( t , u ) ϕ n ( t ) | ε ˜
(c) Moreover, for all  n { 1 , , N }  and  t , there is a C such that
| lim λ 0 ( csc α 2 π g ( 0 ) | ω ˜ f ( t , u ) ϕ n ( t ) | ε ˜ F R S S T f λ , ε ˜ ( t , ω ) d ω ) f n ( t ) | C ε ˜
Proof. 
Different from the FSST, this theorem provides a strong approximation result for the chirp-like signal class in the FRFT domain. Furthermore, it only uses the first-order derivative of the STFRFT. Inspired by the FSST, the descriptions of the proof are shown in Appendix C. □

3.4. Basic Properties of the FRSST

Benefited by the novel STFRFT, the proposed FRSST also shares some properties with the FSST. Here, we list several of the most representative properties along with the corresponding proof.
(1) Linearity: For f 1 ( t ) ,   f 2 ( t ) A Δ , ε , c and two scalar constants m 1 ,   m 2 , let f = m 1 f 1 + m 2 f 2 , and it holds
F R S S T f α ( t , ω ) = m 1 F R S S T f 1 α ( t , ω ) + m 2 F R S S T f 2 α ( t , ω )
Proof. 
Similar to the modified STFT, the proposed modified STFRFT is also linear, i.e.,
S T F R F T f α ( t , u ) = m 1 S T F R F T f 1 α ( t , u ) + m 2 S T F R F T f 2 α ( t , u ) .
Following Theorem 1,
S T F R F T f α ( t , u ) = { m 1 S T F R F T f 1 α ( t , u ) , u ( ( ϕ 1 ( t ) c t ) Δ csc α , ( ϕ 1 ( t ) c t ) + Δ csc α ) m 2 S T F R F T f 2 α ( t , u ) , u ( ( ϕ 2 ( t ) c t ) Δ csc α , ( ϕ 2 ( t ) c t ) + Δ csc α ) ε 1 3 , otherwise .
Then, according to (10),
ω ˜ f α ( t , u ) = { t S T F T f α ( t , u ) j S T F T f α ( t , u ) } = { t ( m 1 S T F R F T f 1 α ( t , u ) + m 2 S T F R F T f 2 α ( t , u ) ) j ( m 1 S T F R F T f 1 α ( t , u ) + m 2 S T F R F T f 2 α ( t , u ) ) }
which, alongside (24), can obtain
ω ˜ f α ( t , u ) = { ω ˜ f 1 α ( t , u ) , u ( ( ϕ 1 ( t ) c t ) Δ csc α , ( ϕ 1 ( t ) c t ) + Δ csc α ) ω ˜ f 2 α ( t , u ) , u ( ( ϕ 2 ( t ) c t ) Δ csc α , ( ϕ 2 ( t ) c t ) + Δ csc α )
Combining (11), (22) and (26),
F R S S T f α ( t , ω ) = Ξ f α S T F R F T f α ( t , u ) δ ( ω ω ˜ f α ( t , u ) ) d u = Ξ f 1 α m 1 S T F R F T f 1 α ( t , u ) δ ( ω ω ˜ f 1 α ( t , u ) ) d u + Ξ f 2 α m 2 S T F R F T f 2 α ( t , u ) δ ( ω ω ˜ f 2 α ( t , u ) ) d u = m 1 F R S S T f 1 α ( t , ω ) + m 2 F R S S T f 2 α ( t , ω )
(2) Complex Conjugate: If f ( t ) F R S S T f α ( t , ω ) , it leads to
F R S S T f α ( t , ω ) = ( F R S S T f α ( t , ω ) )
Proof. 
Since the g ( t ) is a real window and the cot ( ) and csc ( ) are odd functions, we can derive
S T F R F T f α ( t , u ) = f ( τ ) g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ = ( f ( τ ) g ( τ t ) e j τ 2 t 2 2 cot ( α ) j u ( τ t ) csc ( α ) d τ ) = ( S T F R F T f α ( t , u ) )
Furthermore, according to (10),
ω ˜ f α ( t , u ) = { t S T F T f α ( t , u ) j S T F T f α ( t , u ) } = { ( t S T F T f α ( t , u ) j S T F T f α ( t , u ) ) } = ω ˜ f α ( t , u )
which yields
F R S S T f α ( t , ω ) = Ξ f α S T F R F T f α ( t , u ) δ ( ω ω ˜ f α ( t , u ) ) d u = Ξ f α ( S T F R F T f α ( t , u ) ) δ ( ω ( ω ˜ f α ( t , u ) ) ) d u = Ξ f α ( S T F R F T f α ( t , u ) ) δ ( ω + ω ˜ f α ( t , u ) ) d u = Ξ f α ( S T F R F T f α ( t , u ) ) δ ( ω ˜ f α ( t , u ) ( ω ) ) d u = ( Ξ f α ( S T F R F T f α ( t , u ) ) δ ( ω ˜ f α ( t , u ) ( ω ) ) d u ) = ( F R S S T f α ( t , ω ) )
(3) Translation: If f ( t ) F R S S T f α ( t , ω ) , and t 0 is a real number, then
F R S S T f ( t t 0 ) α ( t , ω ) = F R S S T f α ( t t 0 , ω )
Proof. 
According to (5), we can obtain
S T F R F T f ( t t 0 ) α ( t , u ) = f ( τ t 0 ) g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ = f ( ξ ) g ( ξ ( t t 0 ) ) e j ( ξ + t 0 ) 2 t 2 2 cot α j u ( ξ ( t t 0 ) ) csc α d τ = f ( ξ ) g ( ξ ( t t 0 ) ) e j ξ 2 t 2 + 2 t t 0 t 0 2 2 cot α j u ( ξ ( t t 0 ) ) csc α e j t 0 ξ cot α j t 0 t cot α + j t 0 2 cot α d τ = f ( ξ ) g ( ξ ( t t 0 ) ) e j ξ 2 ( t t 0 ) 2 2 cot α j ( u t 0 cos α ) ( ξ ( t t 0 ) ) csc α d τ = S T F R F T f α ( t t 0 , u t 0 cos α )
Combining (10) and (33),
ω ˜ f ( t t 0 ) α ( t , u ) = ω ˜ f α ( t t 0 , u t 0 cos α )
Then,
F R S S T f ( t t 0 ) α ( t , ω ) = Ξ f α S T F R F T f ( t t 0 ) α ( t , u ) δ ( ω ω ˜ f ( t t 0 ) α ( t , u ) ) d u = Ξ f α S T F R F T f α ( t t 0 , u t 0 cos α ) δ ( ω ω ˜ f α ( t t 0 , u t 0 cos α ) ) d u = F R S S T f α ( t t 0 , ω )
(4) Fractional Time Shift: If f ( t ) F R S S T f α ( t , ω ) , and the fractional time shift of f ( t ) is
Τ t 0 α f ( t ) = f ( t t 0 ) e j t 0 ( t t 0 2 ) cot α
whereby the STFRFT is
F R S S T Τ t 0 α f ( t ) α ( t , ω ) = e j t 0 ( t t 0 2 ) cot α F R S S T f α ( t t 0 , ω + t 0 cot α )
Proof. 
Similar to (33), for (36),
S T F R F T Τ t 0 α f ( t ) α ( t , u ) = e j t 0 ( t t 0 2 ) cot α S T F R F T f α ( t t 0 , u )
Then, combining (10) and (38),
ω ˜ Τ t 0 α f ( t ) α ( t , u ) = ω ˜ f α ( t t 0 , u ) t 0 cot α
from which, alongside (11), we can derive
F R S S T Τ t 0 α f ( t ) α ( t , ω ) = Ξ f α S T F R F T Τ t 0 α f ( t ) α ( t , u ) δ ( ω ω ˜ Τ t 0 α f ( t ) α ( t , u ) ) d u = Ξ f α e j t 0 ( t t 0 2 ) cot α S T F R F T f α ( t t 0 , u ) δ ( ω ( ω ˜ f α ( t t 0 , u ) t 0 cot α ) ) d u = e j t 0 ( t t 0 2 ) cot α F R S S T f α ( t t 0 , ω + t 0 cot α )
(5) Modulation: For the f ( t ) e j ω 0 t with ω 0 ,
F R S S T f ( t ) e j ω 0 t α ( t , ω ) = e j ω 0 t F R S S T f α ( t , ω ω 0 )
Proof. 
Alongside the variable substitution, the STFRFT (5) derives
S T F R F T f ( t ) e j ω 0 t α ( t , u ) = f ( τ ) e j ω 0 τ g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ = f ( τ ) g ( τ t ) e j τ 2 t 2 2 cot α j ( u ω 0 sin α ) u ( τ t ) csc α + j ω 0 t d τ = e j ω 0 t S T F R F T f α ( t , u ω 0 sin α )
which, substituted into (10), will allow to obtain
ω ˜ f ( a t ) α ( t , u ) = ω 0 + ω ˜ f α ( t , u ω 0 sin α )
Then,
F R S S T f ( t ) e j ω 0 t α ( t , ω ) = Ξ f α S T F R F T f ( t ) e j ω 0 t α ( t , u ) δ ( ω ω ˜ f ( t ) e j ω 0 t α ( t , u ) ) d u = Ξ f α e j ω 0 t S T F R F T f α ( t , u ω 0 sin α ) δ ( ω ( ω 0 + ω ˜ f α ( t , u ω 0 sin α ) ) ) d u = e j ω 0 t F R S S T f α ( t , ω ω 0 )
(6) Frequency Shear: For the f ( t ) e j b 2 t 2 with b ,
F R S S T f ( t ) e j b 2 t 2 α ( t , ω ) = e j b 2 t 2 F R S S T f σ ( t , ω c t )
where σ = arccot ( cot α + b ) .
Proof. 
Similarly, for the f ( t ) e j b 2 t 2 ,
S T F R F T f ( t ) e j b 2 t 2 α ( t , u ) = f ( τ ) e j b 2 τ 2 g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ = e j b 2 t 2 f ( τ ) g ( τ t ) e j τ 2 t 2 2 ( cot α + b ) j csc α csc σ u ( τ t ) csc σ d τ = e j b 2 t 2 S T F R F T f σ ( t , csc α csc σ u )
and
ω ˜ f ( t ) e j b 2 t 2 α ( t , u ) = b t + ω ˜ f σ ( t , csc α csc σ u )
Then,
F R S S T f ( t ) e j b 2 t 2 α ( t , ω ) = Ξ f α S T F R F T f ( t ) e j b 2 t 2 α ( t , u ) δ ( ω ω ˜ f ( t ) e j b 2 t 2 α ( t , u ) ) d u = Ξ f α e j b 2 t 2 S T F R F T f σ ( t , csc α csc σ u ) δ ( ω ( c t + ω ˜ f σ ( t , csc α csc σ u ) ) ) d u = e j b 2 t 2 F R S S T f α ( t , ω c t )

4. Numerical Examples

In this section, two examples are employed to show the performance of this new FRSST. At the same time, we take the STFT, FRFT, FSST, and second-order SST (VSST) as the compared methods. For all examples, the sampling frequency, sampling number of the signal, and k are 1000 Hz, 1000, and 150, respectively. Herein, without the loss of generality, all of the methods are conjured with a Gaussian window function.

4.1. Linear Modulations

To show the good resolution and concentration of the new FRSST, we use three different signals, defined as
f 11 ( t ) = e 2 π j ( 200 t + k 2 t 2 ) + e 2 π j ( 155 t + k 2 t 2 ) , f 12 ( t ) = e 2 π j ( 200 t + k 2 t 2 ) + e 2 π j ( 175 t + k 2 t 2 ) , f 13 ( t ) = e 2 π j ( 200 t + k 2 t 2 ) + e 2 π j ( 195 t + k 2 t 2 )
where the frequency intervals of the different modes are decreasing. The corresponding time–frequency representations (TFRs) are shown in Figure 1, Figure 2 and Figure 3, respectively.
From Figure 1, it is clear that the five different methods can distinguish the two modes within the signal f 11 ( t ) . As shown in Figure 1d, the resolution of the STFRFT is still fixed, but it is higher than that of the STFT in Figure 1a. Like the analysis in the other papers [21,22,31], the synchrosqueezing transforms (Figure 1b,c,e) improve the energy concentration of the TFRs. Due to the same underlying assumptions, the FRSST (Figure 1e) can provide a result with the same readability as the VSST (Figure 1c). Moreover, the FRSST inherits the resolution of STFRFT. Thus, compared with the other methods, the proposed FRSST has a better resolution and concentration.
For the signal f 12 ( t ) , the frequency interval becomes 25 Hz; the TFR is given in Figure 2. We can see that the STFT (Figure 2a) contains cross-terms because of the resolution. Due to the post-processing of the STFT, the FSST (Figure 2b) and the VSST (Figure 2c) improve the concentration of the energy, but still remain less cross-term. The result of the STFRFT is shown in Figure 2d. Due to the improvement in the time–frequency resolution, the STFRFT can still separate the two modes well, but the STFRFT shows low energy concentration. However, the FRSST still exhibits the best performance of resolution and concentration.
When the interval reaches 5 Hz in the signal f 13 ( t ) , the STFT (Figure 3a) cannot identify the features of the two modes in the time–frequency domain, which leads to a useless result. As illustrated in Figure 3b,c, the FSST and VSST share common phenomena of the STFT. As shown in Figure 3d, the two components are well distinguished in the STFRFT domain.
It is worth noting that the FRSST shares the high resolution of the STFRFT and the aggregation of the SST. For the three different frequency intervals of linear frequency-modulated signals, as indicated in Figure 1e, Figure 2e and Figure 3e, the FRSST presents better performance in terms of resolution and concentration, which helps for the subsequent processing and interpretation.

4.2. Linear Modulation with Disturbance

Herein, we take the signal f 2 ( t ) as the second illustration to verify the superiority of the FRSST. The results are shown in Figure 4. The STFT obtains a TFR with diffusion and cross-terms between the two components. It can be seen from Figure 4b that the FSST concentrates the energy of the TFR, but the cross-term still exists and is diffused at the fast-changing frequencies (marked by the white arrow). The STFRFT in Figure 4c provides a TFR that seems to be of the same concentration as that of the STFT. However, the STFRFT can distinguish the two modes clearly and has fewer cross-terms. The conclusions of the theory analysis indicate that the FRSST gives results that can best characterize the TF features of the signal f 2 ( t ) .
f 2 ( t ) = e 2 π j ( 200 t + k 2 t 2 + c o s ( 3 π t ) ) + e 2 π j ( 175 t + k 2 t 2 )
In Definition 1, for the given signal, the window width should be wide enough to ensure that the frequency resolution meets the separation condition. In this case, the time resolution will be poor because of the Heisenberg uncertainty principle. As shown in Figure 5a,b, the low time resolution still leads to the TFR of the STFT and FSST with serious disturbance and energy diffusion. In Figure 5c, the time–frequency resolution of the STFRFT is obviously better than that of the STFT, and the two different modes are separated completely. Unfortunately, the time–frequency distribution is insufficiently concentrated. Like the STFRFT, the FRSST (Figure 5d) can separate the modes. However, the wide window may enlarge the local approximation error, which leads to a bad frequency estimation and then a diffused TFR, indicated by the white arrows in Figure 5d.
Theorem 1 explains that a narrow window width is required to minimize the error of the frequency estimation. The corresponding results obtained using the four different methods with a narrow window are illustrated in Figure 6. The narrow window width provides a low-frequency resolution, which makes the features of the two modes mixed in the STFT (Figure 6a) or STFRFT (Figure 6c) domain. Though the FSST (Figure 6b) and FRSST (Figure 6d) also have some cross-terms: they are much more concentrated in the TFR because of the good estimation of the instantaneous frequency. In summary, the corresponding results of the FRSST are always more concentrated and can better separate the different components within the signal, i.e., the FRSST provides more flexibility in the choice of window width.

5. Discussion

In the theoretical analysis of the proposed FRSST method, for the signal f ( t ) = A ( t ) e j ϕ ( t ) , it assumed that | A ( t ) | ε , | ϕ ( t ) c | ε , t . The choice of the angle α is an important point in the implementation of the FRSST. Herein, we consider a linear frequency modulation signal h ( t ) = A ( t ) e j ϕ ( t ) = e a 1 + b 1 t + c 1 2 t 2 e j ( a 2 + b 2 t + c 2 2 t 2 ) , and the derivative is
h ( t ) = ( b 1 + c 1 t + j ( b 2 + c 2 t ) ) h ( t )
Then, we rewrite Equation (5) as
S T F R F T f α , g ( u , t ) = f ( τ + t ) g ( τ ) e j τ 2 2 cot α + j τ ( t cot α u csc α ) d τ
According to (51) and (52),
t S T F R F T h α , g ( u , t ) = ( b 1 + c 1 ( τ + t ) + j ( b 2 + c 2 ( τ + t ) ) ) h ( τ + t ) g ( τ ) e j τ 2 2 cot α + j τ ( t cot α u csc α ) d τ + j cot α h ( τ + t ) τ g ( τ ) e j τ 2 2 cot α + j τ ( t cot α u csc α ) d τ = ( b 1 + c 1 t + j ( b 2 + c 2 t ) ) h ( τ + t ) g ( τ ) e j τ 2 2 cot α + j τ ( t cot α u csc α ) d τ + ( c 1 + j ( c 2 + cot α ) ) h ( τ + t ) τ g ( τ ) e j τ 2 2 cot α + j τ ( t cot α u csc α ) d τ = ( b 1 + c 1 t + j ( b 2 + c 2 t ) ) S T F R F T h α , g ( u , t ) + ( c 1 + j ( c 2 + cot α ) ) S T F R F T h α , τ g ( u , t )
where τ g = τ g ( τ ) and S T F R F T h α , τ g ( u , t ) are the STFRFT with the window function τ g = τ g ( τ ) . Then,
t S T F R F T h α , g ( u , t ) S T F R F T h α , g ( u , t ) = ( b 1 + c 1 t + j ( b 2 + c 2 t ) ) + ( c 1 + j ( c 2 + cot α ) ) S T F R F T h α , τ g ( u , t ) S T F R F T h α , g ( u , t )
Further,
b 2 + c 2 t = { t S T F R F T h α , g ( u , t ) j S T F R F T h α , g ( u , t ) } { ( j c 1 + ( c 2 + cot α ) ) S T F R F T h α , τ g ( u , t ) S T F R F T h α , g ( u , t ) }
where { t S T F R F T h α , g ( u , t ) j S T F R F T h α , g ( u , t ) } is the operator ω ˜ ( u , t ) , and it clearly shows that, under the assumed condition c2 = −cotα. It is the exact estimation of the IF for the constant amplitude linear chirp [46,47]. However, for the linear AM-FM signal, the frequency estimation will diverge from reality.
We use two signals defined by (54) to show the corresponding effect on the time–frequency representation.
f 3 ( t ) = e 2 π j ( 200 t + k 1 2 t 2 ) + e 2 π j ( 130 t + k 2 2 t 2 ) , k 1 = 200 , k 2 = 100 f 4 ( t ) = e 2 π j ( 200 t + k 2 t 2 + 3 c o s ( 6 π t ) )
The signal f 3 ( t ) consists of two modes with different chirp rates, and the TFRs obtained using the STFRFT and FRSST are given in Figure 7. We can see that the α relates to the concentration of the STFRFT result and the frequency estimation of the FRSST method. In some work concerning the STFRFT, the way to best select the α for multi-component signals was studied. However, in this work, we only consider different modes with the same chirp rate. From the expression of signal f 4 ( t ) , it obviously does not meet the assumed conditions. As shown in Figure 8, the TFR is so diffused. In the future, we may consider the higher-order terms of the instantaneous amplitude and phase to extend the FRSST and reduce the influence of α for the concentration of the TFR. Furthermore, we created the algorithm for the proposed method to show the resolution and concentration but do not consider the computation time. The efficiency of the program we have written is low, and this will be the focus of future work.

6. Conclusions

In this paper, we developed a modified novel short-time fractional Fourier transform and then proposed a new extension of the synchrosqueezing short-time Fourier transform (FRSST). Most importantly, we developed a theoretical analysis of the FRSST that states that the energy in the synchrosqueezing time–frequency plane associated with the STFRFT is concentrated around the instantaneous frequency curves ϕ n ( t ) , and the inverted components f n ( t ) approximate the actual oscillatory components A n ( t ) e j ϕ n ( t ) . We also provided the derivation of its basic properties. Numerical examples verified the effectiveness and practicality of the FRSST in terms of the time–frequency resolution and energy concentration, and the results were consistent with the theoretical analysis. Proof of the theoretical limitations is provided in the Section 5, and relevant improvements are currently underway.

Author Contributions

Conceptualization, Z.L. and J.G.; methodology, Z.L. and J.G.; software, Z.G.; validation, Z.G. and L.C.; investigation, Z.L. and L.C.; writing—original draft preparation, Z.L.; writing—review and editing, all authors. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China under Grant 42204116 and 12271428, the National Key Research and Development Program of China under Grant 2020YFA0713403, the Natural Science Basic Research Program of Shaanxi under Grant 2022JQ-230, and by the China Postdoctoral Science Foundation under Grant 2021M692520.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Proof of Proposition 1.
Let Β = n = 1 N f n ( t ) g ^ ( u csc α ( ϕ n ( t ) c t ) ) , which can also be written as
Β = n = 1 N f n ( t ) g ^ ( u csc α ( ϕ n ( t ) c t ) )   = n = 1 N A n ( t ) e j ϕ n ( t ) g ( τ t ) e j ( τ t ) ( u csc α ( ϕ n ( t ) c t ) ) d τ = n = 1 N A n ( t ) e j ϕ n ( t ) e j ( τ t ) ( ϕ n ( t ) c t ) g ( τ t ) e j ( τ t ) u csc α d τ
Then, according to (5), the modified STFRFT of f(t) ∈ AΔ,ε,c with α = −arccot(c)is
S T F R F T f g ( t , u ) = f ( τ ) g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ = n = 1 N A n ( τ ) e j ϕ n ( τ ) g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ = n = 1 N e j c 2 t 2 ( A n ( τ ) A n ( t ) ) e j ( ϕ n ( τ ) c 2 τ 2 ) g ( τ t ) e j u ( τ t ) csc α d τ + n = 1 N e j c 2 t 2 A n ( t ) e j ( ϕ n ( τ ) c 2 τ 2 ) g ( τ t ) e j u ( τ t ) csc α d τ
Following from (17) and (A2) is
S T F R F T f g ( t , u ) = n = 1 N e j c 2 t 2 ( A n ( τ ) A n ( t ) ) e j ( ϕ n ( τ ) c 2 τ 2 ) g ( τ t ) e j u ( τ t ) csc α d τ + n = 1 N A n ( t ) e j ϕ n ( t ) e j ( τ t ) ( ϕ n ( t ) c t ) × e 0 τ t ( ϕ n ( t + s ) ϕ n ( t ) c s ) d s g ( τ t ) e j u ( τ t ) csc α d τ
which will obtain
| S T F R F T f g ( t , u ) Β | n = 1 N | A n ( τ ) A n ( t ) | | g ( τ t ) | d τ + n = 1 N | A n ( t ) | | e 0 τ t ( ϕ n ( t + s ) ϕ n ( t ) c s ) d s 1 | | g ( τ t ) | d τ
From (16),
e 0 τ t ( ϕ n ( t + s ) ϕ n ( t ) c s ) d s 1 0 τ t ( ϕ n ( t + s ) ϕ n ( t ) c s ) d s
Then, combining (15), (16), (A4) and (A5),
| S T F R F T f g ( t , u ) Β | n = 1 N | A n ( τ ) A n ( t ) | | g ( τ t ) | d τ   + n = 1 N | A n ( t ) | | 0 τ t ( ϕ n ( t + s ) ϕ n ( t ) c s ) d s | | g ( τ t ) | d τ n = 1 N ε | τ t | | g ( τ t ) | d τ + n = 1 N | A n ( t ) | | 0 τ t ε s d s | | g ( τ t ) | d τ n = 1 N ε | τ t | | g ( τ t ) | d τ + n = 1 N | A n ( t ) | 1 2 ε | τ t | 2 | g ( τ t ) | d τ = ε ( N I 1 + 1 2 I 2 n = 1 N | A n ( t ) | ) = ε Γ 1 ( t )

Appendix B

Proof of Proposition 2.
According to (A1),
n = 1 N f n ( t ) ϕ n ( t ) g ^ ( u csc α ( ϕ n ( t ) c t ) ) = n = 1 N f n ( t ) ϕ n ( t ) g ( τ t ) e j ( τ t ) ( u csc α ( ϕ n ( t ) c t ) ) d τ = j n = 1 N f n ( t ) g ( τ t ) d ( e j ( τ t ) ( u csc α ( ϕ n ( t ) c t ) ) ) ( u csc α + c t ) × n = 1 N f n ( t ) g ( τ t ) e j ( τ t ) ( u csc α ( ϕ n ( t ) c t ) ) d τ = j n = 1 N A n ( t ) e j ϕ n ( t ) g ( τ t ) e j ( τ t ) ( u csc α ( ϕ n ( t ) c t ) ) d τ ( u csc α + c t ) n = 1 N f n ( t ) g ^ ( u csc α ( ϕ n ( t ) c t ) )
Through (A2) and (A3), we can obtain
t S T F R F T f g ( t , u ) = t f ( τ ) g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ = A ( τ ) e j ϕ ( τ ) g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ + j ( u csc α + c t ) f ( τ ) g ( τ t ) e j τ 2 t 2 2 cot α j u ( τ t ) csc α d τ = n = 1 N e j c 2 t 2 ( A n ( τ ) A n ( t ) ) e j ( ϕ n ( τ ) c 2 τ 2 ) g ( τ t ) e j u ( τ t ) csc α d τ n = 1 N A n ( t ) e j ϕ n ( t ) e 0 τ t ( ϕ n ( t + s ) ϕ n ( t ) c s ) d s g ( τ t ) e j ( τ t ) ( u csc α ( ϕ n ( t ) c t ) ) d τ + j ( u csc α + c t ) S T F R F T f g
Combining (A6)–(A8),
| t S T F R F T f α ( t , u ) j n = 1 N f n ( t ) ϕ n ( t ) G ( u csc α ( ϕ n ( t ) c t ) ) | = | n = 1 N e j c 2 t 2 ( A n ( τ ) A n ( t ) ) e j ( ϕ n ( τ ) c 2 τ 2 ) g ( τ t ) e j u ( τ t ) csc α d τ n = 1 N A n ( t ) e j ϕ n ( t ) e 0 τ t ( ϕ n ( t + s ) ϕ n ( t ) c s ) d s g ( τ t ) × e j ( τ t ) ( u csc α ( ϕ n ( t ) c t ) ) d τ + j ( u csc α + c t ) S T F R F T f g + n = 1 N A n ( t ) e j ϕ n ( t ) g ( τ t ) e j ( τ t ) ( u csc α ( ϕ n ( t ) c t ) ) d τ   j ( u csc α + c t ) n = 1 N f n ( t ) g ^ ( u csc α ( ϕ n ( t ) c t ) ) | n = 1 N | A n ( τ ) A n ( t ) | | g ( τ t ) | d τ + n = 1 N | A n ( t ) | | 0 τ t ( ϕ n ( t + s ) ϕ n ( t ) c s ) d s | | g ( τ t ) | d τ + | ( u csc α + c t ) ( S T F R F T f g ( t , u ) Β ) | n = 1 N ε | τ t | | g ( τ t ) | d τ + n = 1 N | A n ( t ) | 1 2 ε | τ t | 2 | g ( τ t ) | d τ + ε | u csc α + c t | Γ 1 ( t ) = ε ( N I 1 + 1 2 I 2 n = 1 N | A n ( t ) | ) + ε | u csc α + c t | Γ 1 ( t ) = ε ( Γ 2 ( t ) + | u csc α + c t | Γ 1 ( t ) )

Appendix C

Proof of Theorem 1.
(a) As the result of Proposition 1,
| S T F R F T f α ( t , u ) n = 1 N f n ( t ) G ( u csc α ( ϕ n ( t ) c t ) ) | ε Γ 1 ( t )
Since s u p p ( G = g ^ ) [ Δ , Δ ] , and the frequency interval between every two modes are larger than 2 Δ , for any ( t , u ) n = 1 N Z n , and if
ε ˜ Γ 1 1 2
Then
| S T F R F T f α ( t , u ) | ε Γ 1 ( t ) ε ˜ 3 ε ˜ 2 = ε ˜
Furthermore, for any ( t , u ) 2 , there is, at most, one n , which satisfies (a). Assuming there exist two integers n 1 > n 2 such that | u csc α ( ϕ n 1 ( t ) c t ) | < Δ and | u csc α ( ϕ n 2 ( t ) c t ) | < Δ . It then holds that
ϕ n 1 ( t ) ϕ n 2 ( t ) | ϕ n 1 ( t ) ϕ n 2 ( t ) | = | u csc α ( ϕ n 2 ( t ) c t ) ( u csc α ( ϕ n 1 ( t ) c t ) ) | | u csc α ( ϕ n 1 ( t ) c t ) | + | u csc α ( ϕ n 2 ( t ) c t ) | < 2 Δ
which conflicts with ϕ n + 1 ( t ) ϕ n ( t ) 2 Δ . Thus, for any pair ( t , u ) under consideration, there is, at most, one mode of the signal f ( t ) that satisfies | S T F R F T f α ( t , u ) | > ε ˜ .
(b) In the Proposition 2, we have the following estimation of t S T F R F T f g ( t , u ) :
| t S T F R F T f α ( t , u ) j n = 1 N f n ( t ) ϕ n ( t ) G ( u csc α ( ϕ n ( t ) c t ) ) | ε ( Γ 2 ( t ) + | u csc α + c t | Γ 1 ( t ) )
It should be noted that, since the sets Z n are disjointed, there are no more than two non-zero terms in that involved in the Equations (A9) and (A13). Then, for every ( t , u ) Z n ,
| ω ˜ f α ( t , u ) ϕ n ( t ) | = | t S T F R S T f g ( t , u ) j S T F R S T f g ( t , u ) ϕ n ( t ) | | t S T F R S T f g ( t , u ) j n 1 N f n ( t ) ϕ n ( t ) G ( u csc α ( ϕ n ( t ) c t ) ) j S T F R S T f g ( t , u ) | + | j ϕ n ( t ) ( n 1 N f n ( t ) G ( u csc α ( ϕ n ( t ) c t ) ) S T F R S T f g ( t , u ) ) S T F R S T f g ( t , u ) | ε ( ( Γ 2 ( t ) + | u csc α + c t | Γ 1 ( t ) ) ) ε ˜ + ϕ n ( t ) ε Γ 1 ( t ) ε ˜ = ε ˜ 2 ( ( Γ 2 ( t ) + ( | u csc α + c t | + ϕ n ( t ) ) Γ 1 ( t ) ) ) ε ˜ 2 ( ( Γ 2 ( t ) + ( 2 ϕ n ( t ) + Δ ) Γ 1 ( t ) ) )
Hence, for all t , if it satisfies
ε ˜ ( Γ 2 ( t ) + ( 2 ϕ n ( t ) + Δ ) Γ 1 ( t ) ) 1
Then,
| ω ˜ f α ( t , u ) ϕ n ( t ) | ε ˜ 2 ( ( Γ 2 ( t ) + ( 2 ϕ n ( t ) + Δ ) Γ 1 ( t ) ) ) ε ˜
(c) According to Reference [33],
lim λ 0 | ω ϕ n ( t ) | ε ˜ F R S S T f λ , ε ˜ ( t , ω ) d ω = csc α 2 π g ( 0 ) | S T F R F T f g ( t , u ) | > ε ˜ S T F R F T f g ( t , u ) × lim λ 0 | ω ˜ f ( t , u ) ϕ n ( t ) | ε ˜ 1 λ h ( ω ω ˜ f α ( t , u ) λ ) d ω d u = csc α 2 π g ( 0 ) | S T F R F T f g ( t , u ) | > ε ˜ | ω ˜ f ( t , u ) ϕ n ( t ) | ε ˜ S T F R F T f g ( t , u ) d u = csc α 2 π g ( 0 ) [ | S T F R F T f g ( t , u ) | > ε ˜ S T F R F T f g ( t , u ) d u | S T F R F T f g ( t , u ) | > ε ˜ \ | ω ˜ f ( t , u ) ϕ n ( t ) | ε ˜ S T F R F T f g ( t , u ) d u ]
Alongside (a), for (21),
| lim λ 0 | ω ϕ n ( t ) | ε ˜ F R S S T f λ , ε ˜ ( t , ω ) d ω A n ( t ) e j ϕ n ( t ) | = | csc α 2 π g ( 0 ) | S T F R F T f g ( t , u ) | > ε ˜ S T F R F T f g ( t , u ) d u A n ( t ) e j ϕ n ( t ) | + | csc α 2 π g ( 0 ) | S T F R F T f g ( t , u ) | > ε ˜ \ | ω ˜ f ( t , u ) ϕ n ( t ) | ε ˜ S T F R F T f g ( t , u ) d u | | csc α 2 π g ( 0 ) | u csc α ( ϕ n ( t ) c t ) | < Δ [ S T F R F T f g ( t , u ) Β ] d u | + | csc α 2 π g ( 0 ) | u csc α ( ϕ n ( t ) c t ) | < Δ S T F R F T f g ( t , u ) d u | + | | u csc α ( ϕ n ( t ) c t ) | < Δ csc α 2 π g ( 0 ) Β d u A n ( t ) e j ϕ n ( t ) |   = | csc α 2 π g ( 0 ) | u csc α ( ϕ n ( t ) c t ) | < Δ ( ε Γ 1 ( t ) + ε ˜ ) d u | + | csc α 2 π g ( 0 ) | u csc α ( ϕ n ( t ) c t ) | < Δ Β d u A n ( t ) e j ϕ n ( t ) | Δ π g ( 0 ) ( ε Γ 1 ( t ) + ε ˜ ) + 0 = 2 Δ π g ( 0 ) ε ˜
Further, let C = 2 Δ π g ( 0 ) ; then, it will be proven that
| lim λ 0 | ω ϕ n ( t ) | ε ˜ F R S S T f λ , ε ˜ ( t , ω ) d ω A n ( t ) e j ϕ n ( t ) | C ε ˜

References

  1. Bracewell, R. The Fourier Transform and Its Applications; McGraw-Hill: New York, NY, USA, 1965. [Google Scholar]
  2. Cooley, J.W.; Lewis, P.A.W.; Welch, P.D. The fast Fourier transform and its applications. IEEE Trans. Educ. 1969, 12, 27–34. [Google Scholar] [CrossRef]
  3. Namias, V. The fractional order Fourier transform and its application to quantum mechanics. J. Inst. Math. Appl. 1980, 25, 241–265. [Google Scholar] [CrossRef]
  4. Almeida, L.B. The fractional Fourier transform and time-frequency representations. IEEE Trans. Signal Process. 1994, 42, 3084–3091. [Google Scholar] [CrossRef]
  5. Cohen, L. Time Frequency Analysis; Prentice Hall: Englewood Cliffs, NJ, USA, 1995. [Google Scholar]
  6. Gabor, D. Theory of communication. J. Inst. Electr. Eng. 1946, 93, 429–457. [Google Scholar] [CrossRef]
  7. Morlet, J.; Arens, G.; Fourgeau, E.; Glard, D. Wave propagation and sampling theory-Part I: Complex signal and scattering in multilayered media. Geophysics 1982, 47, 203–221. [Google Scholar] [CrossRef]
  8. Morlet, J.; Arens, G.; Fourgeau, E.; Glard, D. Wave propagation and sampling theory-Part II: Sampling theory and complex waves. Geophysics 1982, 47, 222–236. [Google Scholar] [CrossRef]
  9. Grossmann, A.; Morlet, J. Decomposition of Hardy functions into square integrable wavelets of constant shape. SIAM J. Math. Anal. 1984, 15, 723–736. [Google Scholar] [CrossRef]
  10. Stockwell, R.G.; Mansinha, L.; Lowe, R. Localization of the complex spectrum: The S transform. IEEE Trans. Signal Process. 1996, 44, 998–1001. [Google Scholar] [CrossRef]
  11. Gao, J.; Chen, W.; Li, Y.; Tian, F. Generalized S transform and seismic response analysis of thin interbeds. Chin. J. Geophys. 2003, 46, 526–532. [Google Scholar]
  12. Wignaer, E. On the quantum correction for thermodynamic equilibrium. Phys. Rev. 1932, 40, 749–759. [Google Scholar] [CrossRef]
  13. Ville, J. Theorie et applications de la notion de signal analytique. Cables Trans. 1948, 2A, 61–74. [Google Scholar]
  14. Mendlovic, D.; Zalevsky, Z.; Lohmann, A.W.; Dorsch, R.G. Signal spatial-filtering using localized fractional Fourier transform. Opt. Commun. 1996, 126, 14–18. [Google Scholar] [CrossRef]
  15. Zalevsky, Z.; Mendlovic, D.; Caulfield, J.H. Localized, partially space invariant filtering. Appl. Opt. 1997, 36, 1086–1092. [Google Scholar] [CrossRef] [PubMed]
  16. Ozaktas, H.M.; Kutay, M.A.; Zalevsky, Z. Applications of the fractional Fourier transform to matched filtering, detection, and pattern recognition. In The Fractional Fourier Transform: With Applications Optics and Signal Processing; Wiley: New York, NY, USA, 2000; pp. 455–460. [Google Scholar]
  17. Mendlovic, D.; Zalevsky, Z.; Mas, D.; García, J.; Ferreira, C. Fractional wavelet transform. Appl. Opt. 1997, 36, 4801–4806. [Google Scholar] [CrossRef] [PubMed]
  18. Shi, J.; Liu, X.; Zhang, N. Multiresolution analysis and orthogonal wavelets associated with fractional wavelet transform. Signal Image Video Process. 2015, 9, 211–220. [Google Scholar] [CrossRef]
  19. Ranjan, R.; Jindal, N.; Singh, A.K. Fractional S-Transform and Its Properties: A Comprehensive Survey. Wirel. Pers. Commun. 2020, 113, 2519–2541. [Google Scholar] [CrossRef]
  20. Daubechies, I.; Maes, S. A nonlinear squeezing of the continuous wavelet transform based on auditory nerve models. In Wavelets in Medicine and Biology; CRC Press: Boca Raton, FL, USA, 1996; pp. 527–546. [Google Scholar]
  21. Daubechies, I.; Lu, J.; Wu, H.T. Synchrosqueezed wavelet transform: An empirical mode decomposition-like tool. Appl. Comput. Harmon. Anal. 2011, 30, 243–261. [Google Scholar] [CrossRef]
  22. Auger, F.; Flandrin, P. Improving the readability of time-frequency and time-scale representations by the reassignment method. IEEE Trans. Signal Process. 1995, 43, 1068–1089. [Google Scholar] [CrossRef]
  23. Thakur, G.; Wu, H.T. Synchrosqueezing-based Recovery of Instantaneous Frequency from Nonuniform Samples. SIAM J. Math. Anal. 2012, 43, 2078–2095. [Google Scholar] [CrossRef]
  24. Oberlin, T.; Meignen, S.; Perrier, V. The Fourier-based synchrosqueezing transform. In Proceedings of the IEEE International Conference on Acoustics, Florence, Italy, 4–9 May 2014; pp. 315–319. [Google Scholar]
  25. Huang, Z.; Zhang, J.; Zou, Z. Synchrosqueezing S-transform and its application in seismic spectral decomposition. IEEE Trans. Geosci. Remote Sens. 2016, 54, 817–825. [Google Scholar] [CrossRef]
  26. Wang, Q.; Gao, J.; Liu, N.; Jiang, X. High-Resolution Seismic Time-Frequency Analysis Using the Synchrosqueezing Generalized S-Transform. IEEE Geosci. Remote Sens. Lett. 2018, 15, 374–378. [Google Scholar] [CrossRef]
  27. He, D.; Cao, H.; Wang, S.; Chen, X. Time-reassigned synchrosqueezing transform: The algorithm and its applications in mechanical signal processing. Mech. Syst. Signal Process. 2019, 117, 255–279. [Google Scholar] [CrossRef]
  28. Yu, G. A Concentrated Time-Frequency Analysis Tool for Bearing Fault Diagnosis. IEEE Trans. Instrum. Meas. 2020, 69, 371–381. [Google Scholar] [CrossRef]
  29. Li, Z.; Gao, J.; Wang, Z. A Time-Synchroextracting Transform for the Time-Frequency Analysis of Seismic Data. IEEE Geosci. Remote Sens. Lett. 2020, 17, 864–868. [Google Scholar] [CrossRef]
  30. Li, Z.; Gao, J.; Wang, Z.; Liu, N.; Yang, Y. Time-Synchroextracting General Chirplet Transform for Seismic Time-Frequency Analysis. IEEE Trans. Geosci. Remote Sens. 2020, 58, 8626–8636. [Google Scholar] [CrossRef]
  31. Oberlin, T.; Meignen, S.; Perrier, V. Second-order synchrosqueezing transform or invertible reassignment? Towards ideal time-frequency representations. IEEE Trans. Signal Process. 2015, 63, 1335–1344. [Google Scholar] [CrossRef]
  32. Oberlin, T.; Meignen, S. The second-order wavelet synchrosqueezing transform. In Proceedings of the IEEE ICASSP, New Orleans, LA, USA, 5–9 May 2017. [Google Scholar]
  33. Behera, R.; Meignen, S.; Oberlin, T. Theoretical analysis of the second-order synchrosqueezing transform. Appl. Comput. Harmon. Anal. 2016, 34, 1009. [Google Scholar] [CrossRef]
  34. Han, B.; Zhou, Y.; Yu, G. Second-order synchroextracting wavelet transform for nonstationary signal analysis of rotating machinery. Signal Process. 2021, 186, 108123. [Google Scholar] [CrossRef]
  35. Yu, G.; Lin, T. Second-order transient-extracting transform for the analysis of impulsive-like signals. Mech. Syst. Signal Process. 2021, 147, 107069. [Google Scholar] [CrossRef]
  36. Pham, D.; Meignen, S. High-order synchrosqueezing transform for multicomponent signals analysis—With an application to gravitational-wave signal. IEEE Trans. Signal Process. 2017, 65, 3168–3178. [Google Scholar] [CrossRef]
  37. Lv, S.; Lv, Y.; Yuan, R.; Li, H. High-order synchroextracting transform for characterizing signals with strong AM-FM features and its application in mechanical fault diagnosis. Mech. Syst. Signal Process. 2022, 172, 108959. [Google Scholar] [CrossRef]
  38. Yu, G.; Yu, M.; Xu, C. Synchroextracting Transform. IEEE Trans. Ind. Electron. 2017, 64, 8042–8054. [Google Scholar] [CrossRef]
  39. Yu, G.; Wang, Z.; Zhao, P. Multisynchrosqueezing Transform. IEEE Trans. Ind. Electron. 2019, 66, 5441–5455. [Google Scholar] [CrossRef]
  40. Dong, H.; Yu, G.; Lin, T.; Li, Y. An energy-concentrated wavelet transform for time-frequency analysis of transient signal. Signal Process. 2023, 206, 108934. [Google Scholar] [CrossRef]
  41. Li, Z.; Gao, J.; Li, H.; Zhang, Z.; Liu, N.; Zhu, X. Synchroextracting transform: The theory analysis and comparisons with the synchrosqueezing transform. Signal Process. 2020, 166, 107243. [Google Scholar] [CrossRef]
  42. Zhu, X.; Zhang, Z.; Li, Z.; Gao, J.; Huang, X.; Wen, G. Multiple squeezes from adaptive chirplet transform. Signal Process. 2019, 163, 26–40. [Google Scholar] [CrossRef]
  43. Yu, G.; Lin, R.; Wang, Z.; Li, Y. Time-Reassigned Multisynchrosqueezing Transform for Bearing Fault Diagnosis of Rotating Machinery. IEEE Trans. Ind. Electron. 2021, 68, 1486–1496. [Google Scholar] [CrossRef]
  44. Chen, X.; Chen, H.; Hu, Y.; Li, R. A statistical instantaneous frequency estimator for high-concentration time-frequency representation. Signal Process. 2023, 204, 108825. [Google Scholar] [CrossRef]
  45. Zeyani, A.R. Instantaneous Frequency Estimation and Signal Separation Using Fractional Continuous Wavelet Transform. Ph.D. Dissertation, Univ. Missouri St. Louis, St. Louis, MO, USA, 2021. [Google Scholar]
  46. Shi, J.; Chen, G.; Zhao, Y.; Tao, R. Synchrosqueezed Fractional Wavelet Transform: A New High-Resolution Time-Frequency Representation. IEEE Trans. Signal Process. 2023, 71, 264–278. [Google Scholar] [CrossRef]
  47. Zhao, Z.; Li, G. Synchrosqueezing-Based Short-Time Fractional Fourier Transform. IEEE Trans. Signal Process. 2023, 71, 279–294. [Google Scholar] [CrossRef]
  48. Shi, J.; Zheng, J.; Liu, X.; Xiang, W.; Zhang, Q. Novel Short-Time Fractional Fourier Transform: Theory, Implementation, and Applications. IEEE Trans. Signal Process. 2020, 68, 3280–3295. [Google Scholar] [CrossRef]
  49. Zhang, F.; Bi, G.; Chen, Y.Q. Chip signal analysis by using adaptive short-time fractional Fourier transform. In Proceedings of the 10th European Signal Processing Conference, Tampere, Finland, 4–8 September 2000; pp. 1–4. [Google Scholar]
  50. Stankovi’c, L.; Alieva, T.; Bastiaans, M.J. Time-frequency signal analysis based on the windowed fractional Fourier transform. Signal Process. 2003, 83, 2459–2468. [Google Scholar] [CrossRef]
  51. Tao, R.; Lei, Y.; Wang, Y. Short-time fractional Fourier transform and its applications. IEEE Trans. Signal Process. 2010, 58, 2568–2580. [Google Scholar] [CrossRef]
Figure 1. Illustration of the time–frequency representations for signal f 11 ( t ) obtained by the (a) STFT, (b) FSST, (c) VSST, (d) STFRFT, and (e) FRSST.
Figure 1. Illustration of the time–frequency representations for signal f 11 ( t ) obtained by the (a) STFT, (b) FSST, (c) VSST, (d) STFRFT, and (e) FRSST.
Remotesensing 16 01173 g001aRemotesensing 16 01173 g001b
Figure 2. Illustration of the time–frequency representations for signal f 12 ( t ) obtained by the (a) STFT, (b) FSST, (c) VSST, (d) STFRFT, and (e) FRSST.
Figure 2. Illustration of the time–frequency representations for signal f 12 ( t ) obtained by the (a) STFT, (b) FSST, (c) VSST, (d) STFRFT, and (e) FRSST.
Remotesensing 16 01173 g002aRemotesensing 16 01173 g002b
Figure 3. Illustration of the time–frequency representations for signal f 13 ( t ) obtained by the (a) STFT, (b) FSST, (c) VSST, (d) STFRFT, and (e) FRSST.
Figure 3. Illustration of the time–frequency representations for signal f 13 ( t ) obtained by the (a) STFT, (b) FSST, (c) VSST, (d) STFRFT, and (e) FRSST.
Remotesensing 16 01173 g003aRemotesensing 16 01173 g003b
Figure 4. Illustration of the time–frequency representations for signal f 2 ( t ) obtained by the (a) STFT, (b) FSST, (c) STFRFT, and (d) FRSST with a suitable window width (number of window samples).
Figure 4. Illustration of the time–frequency representations for signal f 2 ( t ) obtained by the (a) STFT, (b) FSST, (c) STFRFT, and (d) FRSST with a suitable window width (number of window samples).
Remotesensing 16 01173 g004
Figure 5. Illustration of the time–frequency representations for signal f 2 ( t ) obtained by the (a) STFT, (b) FSST, (c) STFRFT, and (d) FRSST with a wide window width.
Figure 5. Illustration of the time–frequency representations for signal f 2 ( t ) obtained by the (a) STFT, (b) FSST, (c) STFRFT, and (d) FRSST with a wide window width.
Remotesensing 16 01173 g005aRemotesensing 16 01173 g005b
Figure 6. Illustration of the time–frequency representations for signal f 2 ( t ) obtained by the (a) STFT, (b) FSST, (c) STFRFT, and (d) FRSST with a narrow window width.
Figure 6. Illustration of the time–frequency representations for signal f 2 ( t ) obtained by the (a) STFT, (b) FSST, (c) STFRFT, and (d) FRSST with a narrow window width.
Remotesensing 16 01173 g006
Figure 7. Time–frequency representations of signal f 3 ( t ) from the (a) STFRFT, (b) FRSST with α = arccot ( k 2 ) , (c) STFRFT, and (d) FRSST with α = arccot ( k 1 ) .
Figure 7. Time–frequency representations of signal f 3 ( t ) from the (a) STFRFT, (b) FRSST with α = arccot ( k 2 ) , (c) STFRFT, and (d) FRSST with α = arccot ( k 1 ) .
Remotesensing 16 01173 g007
Figure 8. Result of signal f 4 ( t ) obtained using the FRSST.
Figure 8. Result of signal f 4 ( t ) obtained using the FRSST.
Remotesensing 16 01173 g008
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, Z.; Gao, Z.; Chen, L.; Gao, J.; Xu, Z. The Synchrosqueezed Method and Its Theory-Analysis-Based Novel Short-Time Fractional Fourier Transform for Chirp Signals. Remote Sens. 2024, 16, 1173. https://doi.org/10.3390/rs16071173

AMA Style

Li Z, Gao Z, Chen L, Gao J, Xu Z. The Synchrosqueezed Method and Its Theory-Analysis-Based Novel Short-Time Fractional Fourier Transform for Chirp Signals. Remote Sensing. 2024; 16(7):1173. https://doi.org/10.3390/rs16071173

Chicago/Turabian Style

Li, Zhen, Zhaoqi Gao, Liang Chen, Jinghuai Gao, and Zongben Xu. 2024. "The Synchrosqueezed Method and Its Theory-Analysis-Based Novel Short-Time Fractional Fourier Transform for Chirp Signals" Remote Sensing 16, no. 7: 1173. https://doi.org/10.3390/rs16071173

APA Style

Li, Z., Gao, Z., Chen, L., Gao, J., & Xu, Z. (2024). The Synchrosqueezed Method and Its Theory-Analysis-Based Novel Short-Time Fractional Fourier Transform for Chirp Signals. Remote Sensing, 16(7), 1173. https://doi.org/10.3390/rs16071173

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop