# Applications of an Improved Time-Frequency Filtering Algorithm to Signal Reconstruction

Authors: Junbo Long; Haibin Wang; Daifeng Zha; Hongshe Fan; Zefeng Lao; Huajie Wu
Journal: Mathematical Problems in Engineering
 (2017)

---

## Abstract

The short time Fourier transform time-frequency representation (STFT-TFR) method degenerates, and the corresponding short time Fourier transform time-frequency filtering (STFT-TFF) method fails underα stable distribution noise environment. A fractional low order short time Fourier transform (FLOSTFT) which takes advantage of fractional p order moment is proposed for α stable distribution noise environment, and the corresponding FLOSTFT time-frequency representation (FLOSTFT-TFR) algorithm is presented in this paper. We study vector formulation of the FLOSTFT and inverse FLOSTFT (IFLOSTFT) methods and propose a FLOSTFT time-frequency filtering (FLOSTFT-TFF) method which takes advantage of time-frequency localized spectra of the signal in time-frequency domain. The simulation results show that, employing the FLOSTFT-TFR method and the FLOSTFT-TFF method with an adaptive weight function, time-frequency distribution of the signals can be better gotten and time-frequency localized region of the signal can be effectively extracted from α stable distribution noise, and also the original signal can be restored employing the IFLOSTFT method. Their performances are better than the STFT-TFR and STFT-TFF methods, and MSEs are smaller in different α and GSNR cases. Finally, we apply the FLOSTFT-TFR and FLOSTFT-TFF methods to extract fault features of the bearing outer race fault signal and restore the original fault signal from α stable distribution noise; the experimental results illustrate their performances.


---

## Body

## 1. Introduction

The time-frequency analysis method is an effective tool for nonstationary signal processing, which has been broadly used in communication, acoustics, mechanical signal processing, medical signal processing, and others [1–5]. Short time Fourier transform time-frequency representation (STFT-TFR) has a rich structure with dependencies along both the time and frequency axes, which is widely applied in speech [6, 7], communication [8, 9], and others [10, 11]. A speech enhancement algorithm employing the STFT-TFR method is presented in [6], which takes advantage of the time and frequency dependencies of speech signals. An improved method which can reconstruct the spectral phase of the speech signal is proposed in [7]; the method only depends on the fundamental frequency and the noisy observation from the STFT domain. An interference excision algorithm is proposed for direct-sequence spread spectrum communication systems [8, 9], which analyze the interference in STFT time-frequency domain and detect and estimate the high-power jamming signal employing inverse STFT (ISTFT). Abdullah et al. apply the STFT-TFR method to analyze the switches faults of three-phase voltage source inverter [10]. Zhang et al. propose a time-frequency MUSIC algorithm employing the STFT-TFR method in [11], which is applied to estimate the DOAs of the closely spaced sources.The time-frequency filtering technology which takes advantage of time-frequency localized spectra of the data provides an adaptive filtering method for the nonstationary signals. The time-frequency filtering method applies an adaptive weighting function to separate out the signals from the noise. The higher weighting parts localize the regions which are expected to be the signal components, and the lower weighting parts attenuate the noise in the time-frequency domain. The inverse transform of time-frequency representation is used to reconstruct the original signals. Recently, an adaptive time-frequency filtering method employing the Stockwell transform time-frequency representation (ST-TFR) method and its inverse transform are used to analyze the earthquake data [12, 13]; WANG et al. propose a new time-frequency filtering method employing normalized window S transform and TT transform in [14], which is applied to attenuate high frequency noise and random noise for the radar echo signal. An adaptive filtering method employing generalized S transform is presented in [15], which is constructed by a new adaptive time-frequency filtering factor, and the method is applied to restore the LFM signals from the noise. A generalized S transform is presented in [16], which is used to extract the special signal components and filter out the noise. CHI et al. propose an adaptive time-frequency filtering method based on the STFT-TFR method and apply it to filter out the noise in FM signal; the results demonstrate that the time-frequency filtering method is effective for FM signal filtering [17]. A FM interference suppression method employing the STFT-TFR and time-frequency filtering is presented in [18], which is applied to suppress the interference in the FM signals and improve the correlation output. Yang proposed an inverse STFT method and studied its vector formulation in [19].The Gaussian noise is assumed in the above time-frequency representation methods and time-frequency filtering methods, and second-order statistics is applied to analyze the signals. In general cases, Gaussian hypothesis is reasonable, and the above methods are effective. However, in some actual signals such as the mechanical bearing fault signals, electroencephalogram, and radar signal, the noise has obvious pulsing characteristics, and the noise is non-Gaussian and nonstationaryα stable distribution [20–26]. When α=2, the noise belongs to Gaussian distribution, and when 0<α<2, it is low order α stable distribution. In low-order α stable distribution environment, the mentioned methods in [12–19] are based on second-order statistics, and their performance will degenerate when Gaussian model is employed to analyze the non-Gaussian signals. Recently, α stable distribution model is used for the bearing fault signals diagnosis in [27–30]. Fractional lower order statistic is applied to extract the evoked potential in [31, 32]. In α stable distribution environment, the STFT-TFR method in the literature [8–11] degrades and even fails. Therefore, the corresponding time-frequency filtering method employing the STFT-TFF method in [17–19] degenerates. Hence, we propose fractional lower order short time Fourier transform and its inverse transform and propose a fractional lower order short time Fourier transform time-frequency representation (FLOSTFT-TFR) method for α stable distribution noise environment. Based on the proposed FLOSTFT-TFR and IFLOST methods, we present a novel fractional lower order short time Fourier transform time-frequency filtering (FLOSTFT-TFF) algorithm which takes advantage of time-frequency localized spectra of the signal in time-frequency domain in this paper. The simulations show that the FLOSTFT-TFR method can better demonstrate time-frequency distribution of the signals, the FLOSTFT-TFF method can effectively restore the original signal under α stable distribution noise environment, their performances are better than the STFT-TFR and STFT-TFF methods, and their MSEs are smaller under different α and GSNR. We apply the FLOSTFT-TFR and FLOSTFT-TFF methods to extract fault features of the bearing outer race fault signal and restore the original fault signal from α stable distribution noise, which illustrate their performances. Hence, the FLOSTFT-TFR method provides an approach for the special time-frequency analysis cases. IFLOSTFT is inverse transform of FLOSTFT, which provides a computational efficient way to restore the original signal from its time-frequency distribution when the undesired parts are removed.In this paper, an improved time-frequency representation method employing fractional low order moment is proposed forα stable distribution noise environment, and a novel time-frequency filtering method is presented. The paper is structured in the following manner. α stable distribution is introduced in Section 2. In Section 3 we demonstrate a fractional low order short time Fourier transform and its inverse transform, the vector formulation of FLOSTFT and IFLOSTFT are derived, and the improved time-frequency representation is studied. The improved fractional lower order time-frequency filtering method is demonstrated in Section 4. The simulations are performed to demonstrate justifiability of the proposed time-frequency representation and time-frequency filtering methods based on FLOSTFT and IFLOSTFT, and the simulations of the outer race fault signals diagnosis are demonstrated in Section 5. Finally, the discussions and conclusions are given in Sections 6 and 7, respectively.


## 2.α Stable Distribution

The characteristic function ofα stable distribution can be defined as [20, 21](1a)φt=exp⁡jμt-γtα1+jβsign⁡tωτ,α(1b)ωτ,α=tan⁡απ2ifα≠12πlog⁡τifα=1,sign⁡t=1t>00t=0-1t<0,where α∈(0,2] is the characteristic index; it determines the pulse degree of α stable distribution. If α=2, X is Gaussian distribution; if α∈(0,2), X is non-Gaussian fractional lower order distribution. Parameter γ is the dispersion coefficient, parameter μ is the location parameter, and parameter β is the symmetry coefficient. If the parameter β=0, X is called symmetric α stable distribution (SαS), its characteristic function can be expressed as (2), and when α=2, which is the same as the characteristic function of Gaussian distribution,(2)ϕt=exp⁡jμt-γtα.Probability density functions (PDFs) of SαS are given under α=0.5, α=1.0, α=1.5, and α=2.0 in Figure 1.Figure 1
PDFs of SαS stable distribution in different α.


## 3. FLOSTFT and Its Inverse Transform

### 3.1. FLOSTFT

Fractionalp order moment of the signal x(t) is defined as (3)x~t=xpt,where p is p order moment operation of x(t). When x(t) is a real signal, xpt=xtp-1·sign[x(t)], and when x(t) is a complex signal, xp(t)=x(t)p-1·x∗(t). p is a real parameter, and 1≤p≤2 [21, 22], ∗ demonstrate conjugate. Both sides of (3) are multiplied by a real window function h(t) centered at time τ=t, and localized spectrum of x~(t) at τ=t is obtained, as shown in (4)S~ht,τ=x~thτ-t=xpthτ-t.After (4) has taken Fourier transform to time τ, we obtain(5)FLOSTFTxt,f=Fτ→fx~thτ-t=Fτ→fxpthτ-t(6)FLOSTFTxt,f=∫-∞+∞xpthτ-te-j2πfτdτ.Equation (6) is called fractional low order short time Fourier transform (FLOSTFT); the corresponding discrete FLOSTFT can be written as(7)FLOSTFTxn,ω=∑mxpmhm-ne-jωn.


### 3.2. Computation of FLOSTFT

The discrete form ofx(t) can be expressed as x(n), n=0,1,…,N-1; then its discrete fractional p order moment in (3) is written as(8)x~n=xpn,n=0,1,…,N-1,x~=x~0,x~1,…,x~N-1T.We divide x~ into M overlapping parts employing a real weighted function h=[h(0),h(0),…,h(L-1)]; then the length of each part is L, and the shift length from part to part is S. The mth part of x~ can be written as(9)x~m=x~mS,x~mS+1,…,x~mS+L-1T,where m=0,1,…,M-1. We define matrices  IL and Γ as(10)IL=11⋯111⋯1⋮⋮⋱⋮11⋯1Γ=IL⋯⋯00⋯0↔SIL⋯0⋮⋮⋱⋮0←⋯M-1S0→IL,where IL is L×L identity matrix. Γ is a ML×N diagonal matrix, which is composed of MIL elements; the shift distance between IL and IL is S. From (8) to (10), we can get the relationship between x~ and x~m as(11)Γx~=x~0T,x~1T,…,x~M-1TT.We compute K (K≥L) points discrete Fourier transform to (9) and obtain(12)X~m=X~m0,X~m1,…,X~mK-1T.When all x~m(m=0,1,…,M-1) perform discrete Fourier transform, Fourier transform vector of x~ is gotten: (13)X~=X~0T,X~1T,…,X~M-1TT.We define K×K Fourier transform matrix Φ as (14)Φ=1e-jω1⋯e-jK-1ω11e-jω2⋮e-jK-1ω2⋮⋮⋱⋮1e-jωK-1⋯e-jK-1ωK-1.And let(15)Ψ=⟵L⟶11⋯1↑⋮⋮⋮⋮L11⋯1↓00⋯0↑⋮⋮⋮⋮K-L00⋯0↓.Ψ is K×L(K≥L) matrix. The weight function h=[h(0),h(0),…,h(L-1)] can be written as L×L diagonal matrix, as shown in (16)H=h00⋯00h1⋮0⋮⋮⋱⋮00⋯hL-1.By substituting (14)–(16) into (12), we can obtain (17)X~m=ΦΨHx~m.Similarly, (13) can be written as(18)X~=ΦΨH0⋯00ΦΨH0⋮⋮0⋱00⋯0ΦΨHx~0x~1⋮x~M-1=IM⊗ΦΨHΓx~=Βx~,where IM is L×L identity matrix, ⊗ denotes Kronecker tensor product, (ΦΨH) is K×L matrix, and IM⊗(ΦΨH) is (KM)×(LM) matrix. B=IM⊗(ΦΨH)Γ, and B is (KM)×N matrix. We call (18) fractional low order short time Fourier transform (FLOSTFT).


### 3.3. Computation of Inverse FLOSTFT

In this section, we introduce how to solve fractionalp order moments x~(n) of x(n) from FLOSTFT. Both sides of (18) are multiplied N×KM matrix  ΓHIM⊗(ΨHΦ-1); we can get (19)ΓHIM⊗ΨHΦ-1X~=ΓHIM⊗ΨHΦ-1IM⊗ΦΨHΓx~=ΓHIM·IM⊗ΨHΦ-1ΦΨHΓx~=ΓHIM⊗ΨHΦ-1ΦΨHΓx~=ΓHIM⊗HΓx~.Then(20)x~′=ΓHIM⊗HΓ-1ΓHIM⊗ΨHΦ-1X~=E-1ΛX~,where x~′ is the estimation of x~. E=ΓH(IM⊗H)Γ-1 is N×N matrix, and Λ=ΓHIM⊗(ΨHΦ-1) is N×KM matrix. We call (20) inverse fractional low order short time Fourier transform (IFLOSTFT).


### 3.4. FLOSTFT-TFR Method

The squared magnitude ofFLOSTFTx(t,f) in (7), denoted by FLOSTFT-TFRx(t,f), is(21)FLOSTFT-TFRxt,f=FLOSTFTxt,f2=∫-∞+∞xpthτ-te-j2πfτdτ2.And the corresponding discrete form is written as (22)FLOSTFT-TFRxn,ω=FLOSTFTxn,ω2=∑mxpmhm-ne-jωn2.Equations (21)-(22) are called fractional low order short time Fourier transform time-frequency representation (FLOSTFT-TFR). By solving (22), we can get time-frequency representation of x(t).


## 3.1. FLOSTFT

Fractionalp order moment of the signal x(t) is defined as (3)x~t=xpt,where p is p order moment operation of x(t). When x(t) is a real signal, xpt=xtp-1·sign[x(t)], and when x(t) is a complex signal, xp(t)=x(t)p-1·x∗(t). p is a real parameter, and 1≤p≤2 [21, 22], ∗ demonstrate conjugate. Both sides of (3) are multiplied by a real window function h(t) centered at time τ=t, and localized spectrum of x~(t) at τ=t is obtained, as shown in (4)S~ht,τ=x~thτ-t=xpthτ-t.After (4) has taken Fourier transform to time τ, we obtain(5)FLOSTFTxt,f=Fτ→fx~thτ-t=Fτ→fxpthτ-t(6)FLOSTFTxt,f=∫-∞+∞xpthτ-te-j2πfτdτ.Equation (6) is called fractional low order short time Fourier transform (FLOSTFT); the corresponding discrete FLOSTFT can be written as(7)FLOSTFTxn,ω=∑mxpmhm-ne-jωn.


## 3.2. Computation of FLOSTFT

The discrete form ofx(t) can be expressed as x(n), n=0,1,…,N-1; then its discrete fractional p order moment in (3) is written as(8)x~n=xpn,n=0,1,…,N-1,x~=x~0,x~1,…,x~N-1T.We divide x~ into M overlapping parts employing a real weighted function h=[h(0),h(0),…,h(L-1)]; then the length of each part is L, and the shift length from part to part is S. The mth part of x~ can be written as(9)x~m=x~mS,x~mS+1,…,x~mS+L-1T,where m=0,1,…,M-1. We define matrices  IL and Γ as(10)IL=11⋯111⋯1⋮⋮⋱⋮11⋯1Γ=IL⋯⋯00⋯0↔SIL⋯0⋮⋮⋱⋮0←⋯M-1S0→IL,where IL is L×L identity matrix. Γ is a ML×N diagonal matrix, which is composed of MIL elements; the shift distance between IL and IL is S. From (8) to (10), we can get the relationship between x~ and x~m as(11)Γx~=x~0T,x~1T,…,x~M-1TT.We compute K (K≥L) points discrete Fourier transform to (9) and obtain(12)X~m=X~m0,X~m1,…,X~mK-1T.When all x~m(m=0,1,…,M-1) perform discrete Fourier transform, Fourier transform vector of x~ is gotten: (13)X~=X~0T,X~1T,…,X~M-1TT.We define K×K Fourier transform matrix Φ as (14)Φ=1e-jω1⋯e-jK-1ω11e-jω2⋮e-jK-1ω2⋮⋮⋱⋮1e-jωK-1⋯e-jK-1ωK-1.And let(15)Ψ=⟵L⟶11⋯1↑⋮⋮⋮⋮L11⋯1↓00⋯0↑⋮⋮⋮⋮K-L00⋯0↓.Ψ is K×L(K≥L) matrix. The weight function h=[h(0),h(0),…,h(L-1)] can be written as L×L diagonal matrix, as shown in (16)H=h00⋯00h1⋮0⋮⋮⋱⋮00⋯hL-1.By substituting (14)–(16) into (12), we can obtain (17)X~m=ΦΨHx~m.Similarly, (13) can be written as(18)X~=ΦΨH0⋯00ΦΨH0⋮⋮0⋱00⋯0ΦΨHx~0x~1⋮x~M-1=IM⊗ΦΨHΓx~=Βx~,where IM is L×L identity matrix, ⊗ denotes Kronecker tensor product, (ΦΨH) is K×L matrix, and IM⊗(ΦΨH) is (KM)×(LM) matrix. B=IM⊗(ΦΨH)Γ, and B is (KM)×N matrix. We call (18) fractional low order short time Fourier transform (FLOSTFT).


## 3.3. Computation of Inverse FLOSTFT

In this section, we introduce how to solve fractionalp order moments x~(n) of x(n) from FLOSTFT. Both sides of (18) are multiplied N×KM matrix  ΓHIM⊗(ΨHΦ-1); we can get (19)ΓHIM⊗ΨHΦ-1X~=ΓHIM⊗ΨHΦ-1IM⊗ΦΨHΓx~=ΓHIM·IM⊗ΨHΦ-1ΦΨHΓx~=ΓHIM⊗ΨHΦ-1ΦΨHΓx~=ΓHIM⊗HΓx~.Then(20)x~′=ΓHIM⊗HΓ-1ΓHIM⊗ΨHΦ-1X~=E-1ΛX~,where x~′ is the estimation of x~. E=ΓH(IM⊗H)Γ-1 is N×N matrix, and Λ=ΓHIM⊗(ΨHΦ-1) is N×KM matrix. We call (20) inverse fractional low order short time Fourier transform (IFLOSTFT).


## 3.4. FLOSTFT-TFR Method

The squared magnitude ofFLOSTFTx(t,f) in (7), denoted by FLOSTFT-TFRx(t,f), is(21)FLOSTFT-TFRxt,f=FLOSTFTxt,f2=∫-∞+∞xpthτ-te-j2πfτdτ2.And the corresponding discrete form is written as (22)FLOSTFT-TFRxn,ω=FLOSTFTxn,ω2=∑mxpmhm-ne-jωn2.Equations (21)-(22) are called fractional low order short time Fourier transform time-frequency representation (FLOSTFT-TFR). By solving (22), we can get time-frequency representation of x(t).


## 4. FLOSTFT Time-Frequency Filtering Algorithm

Each signal has certain regions and feature in time-frequency domain. The problem is illustrated in Figure2, which shows that the FM signals gather in the time regions from t1 to t2 and the frequency regions from f1 to f2. Then, we can separate the signal from the noise or eliminate undesired parts of the signal in time-frequency domain. In this section, we will study the time-frequency filtering algorithm based on the ISTFT and IFLOSTFT method under α stable distribution noise.Figure 2
Time-frequency representation of FM signal employing the FLOSTFT-TFR method underα stable distribution noise.


### 4.1. STFT-TFF Algorithm

Short time Fourier transform (STFT) ofx(t) is defined as (23)STFT=∫-∞+∞xthτ-te-j2πfτdτ.And the corresponding short time Fourier transform time-frequency representation (STFT-TFR) is expressed as (24)STFT-TFRxt,f=STFTxt,f2=∫-∞+∞xthτ-te-j2πfτdτ2.When both sides of (24) are multiplied by a weight function F(t,f), we have (25)STFT-TFRx′t,f=STFT-TFRxt,fFt,f=STFTxt,f2Ft,f.F(τ,f) is designed according to time and frequency characteristics of the signal in time domain. From (25), we calculate inverse transform, yielding(26)STFTx′ti,fq=STFT-TFRx′ti,fq·sign⁡STFTxti,fq,where STFTx′(ti,fq) is the estimation of STFTx(ti,fq), which is filtered by the filtering function F(τ,f) in time-frequency domain. When all STFTx′(ti,fq) is solved, we obtain STFTx′(t,f). Following, we can calculate its inverse STFT employing the method in [19], and the estimated x′(t) is gotten. The time-frequency filtering method is called short time Fourier transform time-frequency filtering (STFT-TFF) algorithm.


### 4.2. FLOSTFT-TFF Algorithm

The STFT-TFR method fails underα stable distribution noise environment, and the STFT-TFF time-frequency filtering method based on the STFT-TFR method degenerates; hence, the FLOSTFT-TFR method has been demonstrated in Section 3. In this section, we will study how to restore the signal from its time-frequency representation employing the FLOSTFT-TFR method.We multiply a weight functionF(t,f) on both sides of (21) and then obtain (27)FLOSTFT-TFRx′t,f=FLOSTFT-TFRxt,fFt,f=FLOSTFTxt,f2Ft,f.F(τ,f) is a filter function, which is selected according to time-frequency characteristics of the signal. We define the estimation of FLOSTFTx(t,f) as (28)FLOSTFTx′ti,fq=FLOSTFT-TFRx′ti,fq·sign⁡FLOSTFTxti,fq,where (ti,fq) is ith time point and qth frequency point. When all points FLOSTFTx′(ti,fq) are calculated, we can obtain FLOSTFTx′(t,f). Then, we can solve x~(t) employing the IFLOSTFT method in Section 3.3. For the real signal x(t), we have(29)x~t=xpt=xtp-1·sign⁡xt.From (29), we obtain(30)x^t=x~′t1/p-1sign⁡x~′t.x~′t in (30) is the estimation of x(t). We call the filtering method fractional low order short time Fourier transform time-frequency filtering (FLOSTFT-TFF) algorithm.


### 4.3. FLOSTFT-TFF Algorithm Steps

Step 1.
Calculate FLOSTFT with (6).Step 2.
Compute FLOSTFT-TFR employing (21).Step 3.
Select appropriate filter functionF(τ,f) and extract the time-frequency regions of the signal employing (27).Step 4.
Calculate inverse FLOSTFT-TFR with (28), and compute IFLOSTFT employing (19)-(20).Step 5.
Perform inverse operation ofx~′t with (30).


## 4.1. STFT-TFF Algorithm

Short time Fourier transform (STFT) ofx(t) is defined as (23)STFT=∫-∞+∞xthτ-te-j2πfτdτ.And the corresponding short time Fourier transform time-frequency representation (STFT-TFR) is expressed as (24)STFT-TFRxt,f=STFTxt,f2=∫-∞+∞xthτ-te-j2πfτdτ2.When both sides of (24) are multiplied by a weight function F(t,f), we have (25)STFT-TFRx′t,f=STFT-TFRxt,fFt,f=STFTxt,f2Ft,f.F(τ,f) is designed according to time and frequency characteristics of the signal in time domain. From (25), we calculate inverse transform, yielding(26)STFTx′ti,fq=STFT-TFRx′ti,fq·sign⁡STFTxti,fq,where STFTx′(ti,fq) is the estimation of STFTx(ti,fq), which is filtered by the filtering function F(τ,f) in time-frequency domain. When all STFTx′(ti,fq) is solved, we obtain STFTx′(t,f). Following, we can calculate its inverse STFT employing the method in [19], and the estimated x′(t) is gotten. The time-frequency filtering method is called short time Fourier transform time-frequency filtering (STFT-TFF) algorithm.


## 4.2. FLOSTFT-TFF Algorithm

The STFT-TFR method fails underα stable distribution noise environment, and the STFT-TFF time-frequency filtering method based on the STFT-TFR method degenerates; hence, the FLOSTFT-TFR method has been demonstrated in Section 3. In this section, we will study how to restore the signal from its time-frequency representation employing the FLOSTFT-TFR method.We multiply a weight functionF(t,f) on both sides of (21) and then obtain (27)FLOSTFT-TFRx′t,f=FLOSTFT-TFRxt,fFt,f=FLOSTFTxt,f2Ft,f.F(τ,f) is a filter function, which is selected according to time-frequency characteristics of the signal. We define the estimation of FLOSTFTx(t,f) as (28)FLOSTFTx′ti,fq=FLOSTFT-TFRx′ti,fq·sign⁡FLOSTFTxti,fq,where (ti,fq) is ith time point and qth frequency point. When all points FLOSTFTx′(ti,fq) are calculated, we can obtain FLOSTFTx′(t,f). Then, we can solve x~(t) employing the IFLOSTFT method in Section 3.3. For the real signal x(t), we have(29)x~t=xpt=xtp-1·sign⁡xt.From (29), we obtain(30)x^t=x~′t1/p-1sign⁡x~′t.x~′t in (30) is the estimation of x(t). We call the filtering method fractional low order short time Fourier transform time-frequency filtering (FLOSTFT-TFF) algorithm.


## 4.3. FLOSTFT-TFF Algorithm Steps

Step 1.
Calculate FLOSTFT with (6).Step 2.
Compute FLOSTFT-TFR employing (21).Step 3.
Select appropriate filter functionF(τ,f) and extract the time-frequency regions of the signal employing (27).Step 4.
Calculate inverse FLOSTFT-TFR with (28), and compute IFLOSTFT employing (19)-(20).Step 5.
Perform inverse operation ofx~′t with (30).


## 5. Simulations

The real signaly(n) contaminated by the noise may be written as(31)yn=xn+vn.And two FM signals are expressed as (32)x1n=e-an-N12+jcn-N12+jωn-N1x2n=e-an-N22+jcn-N22+jωn-N2,where a=0.004, c=-0.025, ω=1.72, N1=420, N2=560, and v(t) is Gaussian noise or α stable distribution noise. We let x(n)=real[x1(n)]+real[x2(n)], n=0,1,2,…,N-1. When v(t) is Gaussian noise, signal to noise ratio (SNR) can be used, however. If v(t) is α stable distribution noise, SNR is unusable. Hence, we apply generalized signal noise ratio (GSNR) to substitute SNR, and GSNR=10log10⁡E[x(n)2]/γα. To measure the performance of the proposed methods, we define mixed mean square error (MSE) as(33)MSE=1K∑k=1K1N∑n=1Nx^1n-x1n2+1N∑n=1Nx^2n-x2n2,where K is the number of Monte-Carlo experiments and x^1(n) and x^2(n) denote the signals estimated by the STFT-TFF or FLOSTFT-TFF methods.


### 5.1. Study of the FLOSTFT-TFR and STFT-TFR Methods

In this simulation, we apply the FLOSTFT-TFR and STFT-TFR methods to demonstrate the time-frequency distribution of FM signals under Gaussian noise and SαS stable distribution noise environment, respectively. If v(n) is Gaussian noise (α=2), we set SNR=12dB, p=1.8. And if v(n) is SαS distribution noise, we set the characteristic index of SαS distribution noise α=0.8, fractional low order moment parameter p=1.1, GSNR=16dB, and length of the weighted function L=32. The experimental results are shown in Figures 3(a)–3(d).Figure 3
Time-frequency distributions ofx(n) employing the STFT-TFR and FLOSTFT-TFR methods. (a) Time-frequency distribution employing the STFT-TFR method under Gaussian noise environment. (b) Time-frequency distribution employing the FLOSTFT-TFR method under Gaussian noise environment. (c) Time-frequency distribution employing the STFT-TFR method under SαS distribution noise environment. (d) Time-frequency distribution employing the FLOSTFT-TFR method under SαS distribution noise environment.
(a)
(b)
(c)
(d)Figures3(a) and 3(b) are the time-frequency distributions of x(n) employing the STFT-TFR and FLOSTFT-TFR methods under Gaussian noise environment, respectively. The figures show that the methods can also obtain time-frequency distribution of x(n). Time-frequency distributions of x(n) employing the STFT-TFR and FLOSTFT-TFR methods under α stable distribution noise environment are shown in Figures 3(c) and 3(d), respectively. The results show that the STFT-TFR method fails, and the FLOSTFT-TFR method has good performance. Hence, the FLOSTFT-TFR method has better performance in demonstrating the time-frequency distribution of the signals than the STFT-TFR method under α stable distribution noise environment and is robust.


### 5.2. Study of the FLOSTFT-TFF and STFT-TFF Algorithm

In this simulation, we setv(n) as SαS distribution noise, α=0.8, p=1.2, GSNR=18dB, and L=32. We apply the FLOSTFT-TFF and STFT-TFF methods to reconstruct the original FM signals from SαS distribution noise; the simulations are shown in Figure 4.Figure 4
The filtered time-frequency representation employing the STFF-TFF and FLOSTFT-TFF method under SαS distribution noise environment. (a) Time-frequency representation of x(n) filtered by the STFF-TFF method. (b) Time-frequency representation of x(n) filtered by the FLOSTFF-TFF method.
(a)
(b)Figures4(a) and 4(b) are the time-frequency representations of x(n) filtered by the STFF-TFF and FLOSTFF-TFF methods under SαS distribution noise environment, respectively. The results show that the time-frequency representation filtered by the STFF-TFF method is incorrect, but the FLOSTFF-TFF method can better extract the time-frequency distribution of x(n). Hence, the FLOSTTF-TFF method has better performance in extracting time-frequency distribution of the signal under SαS distribution noise environment.In Figure5 we show from (a) to (d) the original FM signal, the original FM signal contaminated by SαS distribution noise, the estimated FM signal employing the STFT-TFF method, and the FM signal estimated by the FLOSTFT-TFF method. The experimental results show that the contaminated original signal is overwhelmed by SαS distribution noise. The restored signal employing the STFT-TFF method has larger deviation, but the signal reconstructed by the FLOSTFT-TFF method is similar to the original signal. Hence, the FLOSTFT-TFF method has a better quality of signal reconstruction under α stable distribution noise environment.Figure 5
The real waveforms of two FM signals in time domain. (a) The original signal. (b) The original signal contaminated by SαS distribution noise. (c) The estimated signal employing the STFT-TFF method. (d) The estimated signal employing the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)


### 5.3. MSE Analysis under Differentα and GSNR

In this simulation,v(n) is set as SαS distribution noise, α=0.8, p=1.2, GSNR=18dB, and L=32. We apply the FLOSTFT-TFF and STFT-TFF methods to restore the original FM signals and compare MSEs of the methods under different GSNR and α; the simulations are shown in Figures 6 and 7.Figure 6
The mixed MSEs employing the STFT-TFF and FLOSTFT-TFF methods under differentGSNR (14 dB–26 dB).Figure 7
The mixed MSEs employing the STFT-TFF and FLOSTFT-TFF methods under differentα (0–2).Figure6 is MSE analysis under different GSNR; the experimental results show that MSEs employing the STFT-TFF method vary from 8 dB to 80 dB when GSNR change from 26 dB to 14 dB, but MSEs employing the FLOSTFT-TFF method are in the range of −20 dB to −40 dB. Hence, the FLOSTFT-TFF method has obvious advantage to restore the original signals under different GSNR. In particular, the advantage of the FLOSTFT-TFF method is more obvious when GSNR<18dB.The MSE analysis of the STFT-TFF and FLOSTFT-TFF methods under differentα is shown in Figure 7. We see that MSEs of the STFT-TFF method have a large variation, which vary from −20 dB to 220 dB, but MSE of the FLOSTFT-TFF method is stable about −30 dB. Hence, the FLOSTFT-TFF method has better stability in reconstructing the original signals.


### 5.4. Applications of FLOSTFT-TFF Method to Machine Fault Signals

In this simulation, the experiment signal is adopted from the Case Western Reserve University (CWRU) bearing data center [33]. The faulted bearings with fault diameters of 0.007 inches are reinstalled into the test motor, and the motor speed is 1797 RPM (revolutions per minute). The digital data is collected at 12,000 samples per second, and 0.2-second data is selected as test signal from the outer race bearing fault in BA, DE, and FE; then N=2400. SαS distribution noise (α=0.8, GSNR=15dB) is added in the fault signals, which is assumed as the actual working environment background noise. The STFT-TFR and FLOSTFT-TFR methods are used to demonstrate time-frequency distribution of the fault signals for fault analysis. Similarly, the STFT-TFF and FLOSTFT-TFF methods are also applied to restore the original bearing outer race fault signals from SαS distribution noise. The experimental simulations are shown in Figures 8–13.Figure 8
Time-frequency representations of the machine fault signals in BA under SαS distribution noise environment. (a) Time-frequency representation of the machine fault signals in BA employing the STFT-TFR. (b) Time-frequency representation of the machine fault signals in BA employing the FLOSTFT-TFR. (c) The machine fault signals in BA restored by the STFT-TFF method. (d) The fault signals in BA reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 9
Time-frequency representations of the machine fault signals in DE under SαS distribution noise environment. (a) Time-frequency representation of the machine fault signals in DE employing the STFT-TFR method. (b) Time-frequency representation of the machine fault signals in DE employing the FLOSTFT-TFR method. (c) The machine fault signals in DE restored by the STFT-TFF method. (d) The fault signals in DE reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 10
Time-frequency representations of the machine fault signals in FE under SαS distribution noise environment. (a) Time-frequency representation of the machine fault signals in FE employing the STFT-TFR method. (b) Time-frequency representation of the machine fault signals in FE employing the FLOSTFT-TFR method. (c) The machine fault signals in FE restored by the STFT-TFF method. (d) The fault signals in FE reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 11
The waveforms of the machine fault signals in time domain. (a) The original bearing out race fault signals in BA. (b) The original bearing outer race fault signals in BA contaminated by SαS distribution noise. (c) The restored bearing outer race fault signals in BA employing the STFT-TFF method. (d) The bearing outer race fault signals in BA resconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 12
The waveforms of the machine fault signals in time domain. (a) The original bearing outer race fault signals in DE. (b) The original bearing outer race fault signals in DE contaminated by SαS distribution noise. (c) The restored bearing outer race fault signals in DE employing the STFT-TFF method. (d) The bearing outer race fault signals in DE reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 13
The waveforms of the machine fault signals in time domain. (a) The original bearing outer race fault signals in FE. (b) The original bearing outer race fault signals in FE contaminated by SαS distribution noise. (c) The restored bearing outer race fault signals in FE employing the STFT-TFF method. (d) The bearing outer race fault signals in FE reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figures8(a) and 8(b) are time-frequency distributions of the bearing outer race fault signal in BA employing the STFT-TFR and FLOSTFT-TFR methods, respectively. The STFT-TFR and FLOSTFT-TFR time-frequency distributions of the bearing outer race fault signals in DE and FE are shown in Figures 9(a), 10(a), 9(b), and 10(b), respectively. The figures show that the STFT-TFR method fails, but the FLOSTFT-TFR method can better demonstrate the time-frequency representations of the bearing outer race fault signals, which has good performance.Figures8(c)-10(c) and Figures 8(d)-10(d) are the time-frequency distributions filtered by the STFT-TFF and FLOSTFT-TFF methods, respectively. In the figures, we see that the extracted time-frequency representations employing the STFF-TFF method are incorrect, as shown in Figures 8(c)-10(c). But the FLOSTFT-TFF method in Figures 8(d)-10(d) can better fetch the time-frequency distribution of the fault signals. In Figures 8(d)-10(d) we may know that the gap regularly changes between the impacts, the fault vibration interval is approximately 30 ms, and the interval corresponds to the characteristic frequency of outer race which is 33.33 Hz. In Figure 8(d) the shock pulse is mainly distributed in low-frequency band from 500 Hz to 4500 Hz, and the transient harmonic vibration components of about 600 Hz, 2800 Hz, and 4200 Hz dominate frequency-domain. In Figure 9(d) the transient harmonic vibration components are about 600 Hz, 2800 Hz, and 4200 Hz, and the transient harmonic vibration components of about 600 Hz, 3400 Hz, 4500 Hz, and 5200 Hz are shown in Figure 10(d).In Figures11–13 we show from (a) to (d) the waveforms of the original bearing outer race fault signals in BA, DE, and FE, the original bearing outer race fault signals contaminated by SαS distribution noise, the bearing outer race fault signals reconstructed by the STFT-TFF method, and the reconstructed bearing outer race fault signals employing the FLOSTFT-TFF method, respectively. The simulations show that the contaminated bearing outer race fault signals in BA, DE, and FE are overwhelmed by SαS distribution noise in Figures 11(b)-13(b), the restored outer race fault signals employing the STFT-TFF method have larger deviation in Figures 11(c)-13(c), and the reconstructed outer race fault signals employing the FLOSTFT-TFF method are similar to the original signal in Figures 11(d)-13(d), respectively. Hence, the FLOSTFT-TFF method has a better quality of signal recovery for the bearing outer race fault signals.Combined with the results of upper experiments, we see that the FLOSTFT-TFF method can better demonstrate time-frequency distribution of the machine fault signals and extract their fault features than the existing STFT-TFF method under SαS distribution noise environment.


## 5.1. Study of the FLOSTFT-TFR and STFT-TFR Methods

In this simulation, we apply the FLOSTFT-TFR and STFT-TFR methods to demonstrate the time-frequency distribution of FM signals under Gaussian noise and SαS stable distribution noise environment, respectively. If v(n) is Gaussian noise (α=2), we set SNR=12dB, p=1.8. And if v(n) is SαS distribution noise, we set the characteristic index of SαS distribution noise α=0.8, fractional low order moment parameter p=1.1, GSNR=16dB, and length of the weighted function L=32. The experimental results are shown in Figures 3(a)–3(d).Figure 3
Time-frequency distributions ofx(n) employing the STFT-TFR and FLOSTFT-TFR methods. (a) Time-frequency distribution employing the STFT-TFR method under Gaussian noise environment. (b) Time-frequency distribution employing the FLOSTFT-TFR method under Gaussian noise environment. (c) Time-frequency distribution employing the STFT-TFR method under SαS distribution noise environment. (d) Time-frequency distribution employing the FLOSTFT-TFR method under SαS distribution noise environment.
(a)
(b)
(c)
(d)Figures3(a) and 3(b) are the time-frequency distributions of x(n) employing the STFT-TFR and FLOSTFT-TFR methods under Gaussian noise environment, respectively. The figures show that the methods can also obtain time-frequency distribution of x(n). Time-frequency distributions of x(n) employing the STFT-TFR and FLOSTFT-TFR methods under α stable distribution noise environment are shown in Figures 3(c) and 3(d), respectively. The results show that the STFT-TFR method fails, and the FLOSTFT-TFR method has good performance. Hence, the FLOSTFT-TFR method has better performance in demonstrating the time-frequency distribution of the signals than the STFT-TFR method under α stable distribution noise environment and is robust.


## 5.2. Study of the FLOSTFT-TFF and STFT-TFF Algorithm

In this simulation, we setv(n) as SαS distribution noise, α=0.8, p=1.2, GSNR=18dB, and L=32. We apply the FLOSTFT-TFF and STFT-TFF methods to reconstruct the original FM signals from SαS distribution noise; the simulations are shown in Figure 4.Figure 4
The filtered time-frequency representation employing the STFF-TFF and FLOSTFT-TFF method under SαS distribution noise environment. (a) Time-frequency representation of x(n) filtered by the STFF-TFF method. (b) Time-frequency representation of x(n) filtered by the FLOSTFF-TFF method.
(a)
(b)Figures4(a) and 4(b) are the time-frequency representations of x(n) filtered by the STFF-TFF and FLOSTFF-TFF methods under SαS distribution noise environment, respectively. The results show that the time-frequency representation filtered by the STFF-TFF method is incorrect, but the FLOSTFF-TFF method can better extract the time-frequency distribution of x(n). Hence, the FLOSTTF-TFF method has better performance in extracting time-frequency distribution of the signal under SαS distribution noise environment.In Figure5 we show from (a) to (d) the original FM signal, the original FM signal contaminated by SαS distribution noise, the estimated FM signal employing the STFT-TFF method, and the FM signal estimated by the FLOSTFT-TFF method. The experimental results show that the contaminated original signal is overwhelmed by SαS distribution noise. The restored signal employing the STFT-TFF method has larger deviation, but the signal reconstructed by the FLOSTFT-TFF method is similar to the original signal. Hence, the FLOSTFT-TFF method has a better quality of signal reconstruction under α stable distribution noise environment.Figure 5
The real waveforms of two FM signals in time domain. (a) The original signal. (b) The original signal contaminated by SαS distribution noise. (c) The estimated signal employing the STFT-TFF method. (d) The estimated signal employing the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)


## 5.3. MSE Analysis under Differentα and GSNR

In this simulation,v(n) is set as SαS distribution noise, α=0.8, p=1.2, GSNR=18dB, and L=32. We apply the FLOSTFT-TFF and STFT-TFF methods to restore the original FM signals and compare MSEs of the methods under different GSNR and α; the simulations are shown in Figures 6 and 7.Figure 6
The mixed MSEs employing the STFT-TFF and FLOSTFT-TFF methods under differentGSNR (14 dB–26 dB).Figure 7
The mixed MSEs employing the STFT-TFF and FLOSTFT-TFF methods under differentα (0–2).Figure6 is MSE analysis under different GSNR; the experimental results show that MSEs employing the STFT-TFF method vary from 8 dB to 80 dB when GSNR change from 26 dB to 14 dB, but MSEs employing the FLOSTFT-TFF method are in the range of −20 dB to −40 dB. Hence, the FLOSTFT-TFF method has obvious advantage to restore the original signals under different GSNR. In particular, the advantage of the FLOSTFT-TFF method is more obvious when GSNR<18dB.The MSE analysis of the STFT-TFF and FLOSTFT-TFF methods under differentα is shown in Figure 7. We see that MSEs of the STFT-TFF method have a large variation, which vary from −20 dB to 220 dB, but MSE of the FLOSTFT-TFF method is stable about −30 dB. Hence, the FLOSTFT-TFF method has better stability in reconstructing the original signals.


## 5.4. Applications of FLOSTFT-TFF Method to Machine Fault Signals

In this simulation, the experiment signal is adopted from the Case Western Reserve University (CWRU) bearing data center [33]. The faulted bearings with fault diameters of 0.007 inches are reinstalled into the test motor, and the motor speed is 1797 RPM (revolutions per minute). The digital data is collected at 12,000 samples per second, and 0.2-second data is selected as test signal from the outer race bearing fault in BA, DE, and FE; then N=2400. SαS distribution noise (α=0.8, GSNR=15dB) is added in the fault signals, which is assumed as the actual working environment background noise. The STFT-TFR and FLOSTFT-TFR methods are used to demonstrate time-frequency distribution of the fault signals for fault analysis. Similarly, the STFT-TFF and FLOSTFT-TFF methods are also applied to restore the original bearing outer race fault signals from SαS distribution noise. The experimental simulations are shown in Figures 8–13.Figure 8
Time-frequency representations of the machine fault signals in BA under SαS distribution noise environment. (a) Time-frequency representation of the machine fault signals in BA employing the STFT-TFR. (b) Time-frequency representation of the machine fault signals in BA employing the FLOSTFT-TFR. (c) The machine fault signals in BA restored by the STFT-TFF method. (d) The fault signals in BA reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 9
Time-frequency representations of the machine fault signals in DE under SαS distribution noise environment. (a) Time-frequency representation of the machine fault signals in DE employing the STFT-TFR method. (b) Time-frequency representation of the machine fault signals in DE employing the FLOSTFT-TFR method. (c) The machine fault signals in DE restored by the STFT-TFF method. (d) The fault signals in DE reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 10
Time-frequency representations of the machine fault signals in FE under SαS distribution noise environment. (a) Time-frequency representation of the machine fault signals in FE employing the STFT-TFR method. (b) Time-frequency representation of the machine fault signals in FE employing the FLOSTFT-TFR method. (c) The machine fault signals in FE restored by the STFT-TFF method. (d) The fault signals in FE reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 11
The waveforms of the machine fault signals in time domain. (a) The original bearing out race fault signals in BA. (b) The original bearing outer race fault signals in BA contaminated by SαS distribution noise. (c) The restored bearing outer race fault signals in BA employing the STFT-TFF method. (d) The bearing outer race fault signals in BA resconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 12
The waveforms of the machine fault signals in time domain. (a) The original bearing outer race fault signals in DE. (b) The original bearing outer race fault signals in DE contaminated by SαS distribution noise. (c) The restored bearing outer race fault signals in DE employing the STFT-TFF method. (d) The bearing outer race fault signals in DE reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figure 13
The waveforms of the machine fault signals in time domain. (a) The original bearing outer race fault signals in FE. (b) The original bearing outer race fault signals in FE contaminated by SαS distribution noise. (c) The restored bearing outer race fault signals in FE employing the STFT-TFF method. (d) The bearing outer race fault signals in FE reconstructed by the FLOSTFT-TFF method.
(a)
(b)
(c)
(d)Figures8(a) and 8(b) are time-frequency distributions of the bearing outer race fault signal in BA employing the STFT-TFR and FLOSTFT-TFR methods, respectively. The STFT-TFR and FLOSTFT-TFR time-frequency distributions of the bearing outer race fault signals in DE and FE are shown in Figures 9(a), 10(a), 9(b), and 10(b), respectively. The figures show that the STFT-TFR method fails, but the FLOSTFT-TFR method can better demonstrate the time-frequency representations of the bearing outer race fault signals, which has good performance.Figures8(c)-10(c) and Figures 8(d)-10(d) are the time-frequency distributions filtered by the STFT-TFF and FLOSTFT-TFF methods, respectively. In the figures, we see that the extracted time-frequency representations employing the STFF-TFF method are incorrect, as shown in Figures 8(c)-10(c). But the FLOSTFT-TFF method in Figures 8(d)-10(d) can better fetch the time-frequency distribution of the fault signals. In Figures 8(d)-10(d) we may know that the gap regularly changes between the impacts, the fault vibration interval is approximately 30 ms, and the interval corresponds to the characteristic frequency of outer race which is 33.33 Hz. In Figure 8(d) the shock pulse is mainly distributed in low-frequency band from 500 Hz to 4500 Hz, and the transient harmonic vibration components of about 600 Hz, 2800 Hz, and 4200 Hz dominate frequency-domain. In Figure 9(d) the transient harmonic vibration components are about 600 Hz, 2800 Hz, and 4200 Hz, and the transient harmonic vibration components of about 600 Hz, 3400 Hz, 4500 Hz, and 5200 Hz are shown in Figure 10(d).In Figures11–13 we show from (a) to (d) the waveforms of the original bearing outer race fault signals in BA, DE, and FE, the original bearing outer race fault signals contaminated by SαS distribution noise, the bearing outer race fault signals reconstructed by the STFT-TFF method, and the reconstructed bearing outer race fault signals employing the FLOSTFT-TFF method, respectively. The simulations show that the contaminated bearing outer race fault signals in BA, DE, and FE are overwhelmed by SαS distribution noise in Figures 11(b)-13(b), the restored outer race fault signals employing the STFT-TFF method have larger deviation in Figures 11(c)-13(c), and the reconstructed outer race fault signals employing the FLOSTFT-TFF method are similar to the original signal in Figures 11(d)-13(d), respectively. Hence, the FLOSTFT-TFF method has a better quality of signal recovery for the bearing outer race fault signals.Combined with the results of upper experiments, we see that the FLOSTFT-TFF method can better demonstrate time-frequency distribution of the machine fault signals and extract their fault features than the existing STFT-TFF method under SαS distribution noise environment.


## 6. Discussion

(i)
Fractionalp order moment xp(t) of the nonstationary signal x(t) is stationary and integrable within the time window h(t); however, the traditional STFT method is still no-stationary and integrable because when α<1, E[s]=∞.
(ii)
The shorter the length of weight functionL, the higher time resolution, but the lower the frequency resolution. In a practical application, we should set a reasonable balance value between time resolution and frequency resolution and select the proper length of window function.
(iii)
We can set the parameterp according to characteristic index of α stable distribution noise α; the smaller α, the smaller p. When p=2, the FLOSTFT method degenerates into the STFT method, and the corresponding IFLOSTFT evolves into the ISTFT method,;hence, the improved FLOSTFT is a generalized algorithm.
(iv)
The FLOSTFT and IFLOSTFT methods are a linear transformation, but the FLOSTFT-TFR algorithm is a nonlinear transformation.


## 7. Conclusions

In this paper, we considerα stable distribution noise as the background noise. Hence, the improved FLOSTFT and IFLOSTFT methods employing fractional p order moment are proposed, and FLOSTFT-TFR is presented for time-frequency analysis. We take advantage of time-frequency localized spectra of the signal and propose a novel FLOSTFT-TFF method, which can restore the original signal from α stable distribution noise. We apply the FLOSTFT-TFR method to get time-frequency distribution of two FM signals and use the FLOSTFT-TFF method to extract the time-frequency distribution of two FM signals from SαS distribution noise; finally, the IFLOSTFT algorithm is used to restore the original FM signals; the results demonstrate their effectiveness. We compare the performance of the STFT-TFF and FLOSTFT-TFF methods; the results show that the performance of the FLOSTFT-TFF method is better than the STFT-TFF method, which can effectively suppress SαS distribution noise and work in low GSNR. In practical applications, we analyze the fault features from time-frequency representation of the mechanical bearing fault signals employing FLOSTFT-TFR method, extract time-frequency region of the fault signals from α stable distribution noise employing FLOSTFT-TFF method, and reconstruct the original fault signal employing IFLOSTFT.



---

*Source: 1805091-2017-05-08.xml*