Next Article in Journal
A 3D-Printed Multichannel Viscometer for High-Throughput Analysis of Frying Oil Quality
Previous Article in Journal
Microfluidic Cultivation and Laser Tweezers Raman Spectroscopy of E. coli under Antibiotic Stress
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Quadratic Frequency Modulation Signals Parameter Estimation Based on Two-Dimensional Product Modified Parameterized Chirp Rate-Quadratic Chirp Rate Distribution

College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Sensors 2018, 18(5), 1624; https://doi.org/10.3390/s18051624
Submission received: 27 March 2018 / Revised: 15 May 2018 / Accepted: 16 May 2018 / Published: 19 May 2018
(This article belongs to the Section Remote Sensors)

Abstract

:
In an inverse synthetic aperture radar (ISAR) imaging system for targets with complex motion, the azimuth echo signals of the target are always modeled as multicomponent quadratic frequency modulation (QFM) signals. The chirp rate (CR) and quadratic chirp rate (QCR) estimation of QFM signals is very important to solve the ISAR image defocus problem. For multicomponent QFM (multi-QFM) signals, the conventional QR and QCR estimation algorithms suffer from the cross-term and poor anti-noise ability. This paper proposes a novel estimation algorithm called a two-dimensional product modified parameterized chirp rate-quadratic chirp rate distribution (2D-PMPCRD) for QFM signals parameter estimation. The 2D-PMPCRD employs a multi-scale parametric symmetric self-correlation function and modified nonuniform fast Fourier transform-Fast Fourier transform to transform the signals into the chirp rate-quadratic chirp rate (CR-QCR) domains. It can greatly suppress the cross-terms while strengthening the auto-terms by multiplying different CR-QCR domains with different scale factors. Compared with high order ambiguity function-integrated cubic phase function and modified Lv’s distribution, the simulation results verify that the 2D-PMPCRD acquires higher anti-noise performance and obtains better cross-terms suppression performance for multi-QFM signals with reasonable computation cost.

1. Introduction

The high-resolution inverse synthetic aperture radar (ISAR) imaging has been widely used in the field of civil and military in the past few decades. The ISAR image processing and relative algorithms are described in [1,2]. The primary procedures for ISAR imaging algorithm are the range alignment [3,4,5,6] and the phase adjustment after range compression. For targets with smooth motions, conventional range-Doppler (RD) method is effective in reconstructing ISAR images. For targets with the slow maneuvering, the azimuth echo signals are always modeled as the linear frequency modulation (LFM) signal. The RD method can not acquire a high quality image due to the Doppler frequency shift caused by the chirp rate. Therefore, many algorithms for LFM signal parameters estimation have been proposed, such as Wigner–Ville distribution (WVD) [7], fractional Fourier transform (FrFT) [8], cubic phase function (CPF) [9], Lv’s distribution (LVD) [10] and parameterized centroid frequency-chirp rate distribution (PCFCRD) [11]. However, the azimuth echoes of targets with complex motion should be modeled as the multicomponent quadratic frequency modulation (multi-QFM) signals, and aforementioned algorithms can not be applied for the complex maneuvering targets.
Existing QFM signal parameter estimation algorithms can be divided into non-correlation algorithms and correlation algorithms. Compared with correlation algorithms, two classical non-correlation algorithms, the maximum likelihood (ML) method [12] and the quantification-based method [13] have no cross-terms and perform better in low signal-to-noise ratios (SNR). However, due to their huge computations, the non-correlation algorithms are not suitable in real-time applications. Two representative correlation algorithms, the high order ambiguity function (HAF) [14] and cubic phase function (CPF) [9,15,16], reduce the order of the QFM signal by multilinear and bilinear transforms. They are effective for mono-QFM signal under the high SNR situation and suffer from the cross-term problem when multicomponent QFM (multi-QFM) signals are considered. In order to solve the cross-term problem, the product HAF (PHAF) [17] and the product CPF (PCPF) [18,19] are proposed. Compared with HAF and CPF, the PHAF and PCPF suppress the cross-terms and improve the threshold SNR by multiplying the different HAF and CPF, which are related to the delay variable. However, their estimation accuracy can not meet the requirements in low SNR and their cross-term suppression ability is still poor. Igor Djurovic proposed HAF-integrated CPF (HAF-ICPF) [15] by combining HAF with ICPF to estimate the parameters of the QFM signals. It improves the anti-noise performance to some extent and its threshold SNR is −2 dB [15,20]. However, the HAF-ICPF suffers from the error propagation due to the dechirp procedure. In 2015, Yanyan Li proposed the modified Lv’s distribution (MLVD) [21], which transforms the QFM signals into the chirp rate-quadratic chirp rate (CR-QCR) domain to estimate the CR and the QCR. MLVD solves the error propagation. Furthermore, MLVD improves the cross-term suppression ability further and decreases threshold SNR into −4 dB [21]. However, several disadvantages still exist in these two algorithms. Firstly, the anti-noise performance of the HAF-ICPF and MLVD is still poor. Secondly, the MLVD and HAF-ICPF suffer from the identifiability problem for multi-QFM signals with the same QCR.
In this paper, we propose two-dimensional product modified parameterized chirp rate-quadratic chirp rate distribution (2D-PMPCRD) to estimate the parameters of QFM signals. It combines a multi-scale parametric symmetric self-correlation function (PSSAF) with modified nonuniform fast Fourier transform-Fast Fourier transform (mNUFFT-FFT) to transform the signals into the chirp rate-quadratic chirp rate(CR-QCR) domains. By the operation of PSSAF and mNUFFT-FFT, the auto-terms of multi-QFM signals are transformed into different CR-QCR domains at the same position, while the cross-terms are transformed into different positions on CR-QCR domains. By multiplying all the CR-QCR domains, the 2D-PMPCRD can greatly suppress the cross-terms while strengthening the auto-terms. The operation of multiplying all the CR-QCR domains can also improve the anti-noise performance. Therefore, 2D-PMPCRD has a better cross-term suppression performance and a better anti-noise performance. In addition, the 2D-PMPCRD does not need brute-force search, by using FFT and NUFFT. Thus, the 2D-PMPCRD is suitable in the real-time ISAR imaging system.
The reminder of this paper is organized as follows. In Section 2, the QFM signal model and the principle of 2D-PMPCRD are introduced. In this section, the implementation is presented in discrete-time form. In Section 3, the cross-term suppression performance is discussed. The parameter selection criterion is also analyzed. In Section 4, anti-noise performance for mono-QFM signal and multi-QFM signals is analyzed. The computation of 2D-PMPCRD is also analyzed in this section. Finally, conclusions are given in Section 5.

2. The 2D-PMPCRD Method

The geometry for ISAR imaging of targets with complex motions used here is based on the model in [22]. The algorithms of the range alignment and the phase adjustment are described in [6,7,8,9,23,24]. In this paper, we mainly study the processing of the Doppler frequency shift. The ISAR usually transmits the LFM signals. According to [25,26], we can find that the azimuth echoes take the multi-QFM signals model:
s ( t ) = i = 1 P A i exp { j 2 π ( ϕ 1 , i t + 1 2 ϕ 2 , i t 2 + 1 6 ϕ 3 , i t 3 ) } + z ( t ) ,
where t ( T s N 2 t T s N 2 ) denotes the slow time. N and T s denote the signal length and sampling interval. P is the number of QFM signal components. A i , ϕ 1 , i , ϕ 2 , i , and ϕ 3 , i denote the amplitude, the centroid frequency, the CR and the QCR of the ith QFM signal, respectively. z ( t ) denotes the white Gaussian noise, which has a mean of zero and a variance of δ 2 .

2.1. The Principle of 2D-PMPCRD

In order to make the algorithm easily understandable, a noise-free QFM signal is presented as
s ( t ) = A exp { j 2 π ( ϕ 1 t + 1 2 ϕ 2 t 2 + 1 6 ϕ 3 t 3 ) } ,
where A, ϕ 1 , and ϕ 2 , ϕ 3 denote the amplitude, the centroid frequency, the CR and QCR of the mono-QFM signal, respectively.
Based on the analysis in [11,21], a novel PSSAF with multi-scaled factors for QFM signal parameters estimation is proposed. It can be defined as
R s ( t , τ , D ) = s [ t + D + ( τ + 1 2 h ) ] s [ t + D ( τ + 1 2 h ) ] s [ t D + ( τ + 1 2 h ) ] s [ t D ( τ + 1 2 h ) ] ,
where ∗ denotes the complex conjugation, and τ is the lag-time variable. D = { d i } , 1 i L denotes the set of multi-scale factors. According to [21], the scaled factor d i is introduced to complete the order reduction, which can benefit the anti-noise performance. h denotes the constant delay. It is introduced to improve the algorithm performance in low SNR [10,11]. Thus, the selection of d i and h is important for the proposed algorithm. The selection criterion of d i and h will be discussed in Section 3.2.
A new time-quadratic chirp rate analysis technique can be obtained by performing Fourier transform on R s ( t , τ , D ) with respect to τ :
TQC ( t , ω , D ) = τ R s ( t , τ , D ) exp [ j 2 π ω ( τ + 1 2 h ) 2 ] d τ .
By substituting Equation (2) into Equation (4), we can obtain
TQC ( t , ω , D ) = τ C ( D ) exp [ j 2 π ( 4 ϕ 2 D t + 2 ϕ 3 D t 2 ) ] exp [ j 2 π ( ω 2 ϕ 3 D ) ( τ + 1 2 h ) 2 ] d τ ,
where C ( D ) denotes
C ( D ) = A 4 exp { j 4 π ( 2 ϕ 1 D + 1 3 ϕ 3 D 3 ) } .
Equation (5) is similar to the time-chirp rate (TCR) analysis in [11]. Thus, it has a similar characteristic to the TCR technique and it concentrates along ω = 2 ϕ 3 D . However, TQC will not concentrate along the t-axis and it will cause poor cross-terms suppression and poor anti-noise performance. In order to make Equation (5) concentrate along the t-axis, the matrix H ( t , ω ) = exp ( j 2 π ω t 2 ) is firstly introduced to dechirp TQC . After the dechirp processing, we perform the Fourier transform for the dechirped TQC with respect to the t-axis. The modified parameterized chirp rate-quadratic chirp rate distribution (MPCRD) is obtained:
MPCRD ( r , ω , D ) = 0 + TQC ( t , ω , D ) exp ( j 2 π ω t 2 ) exp ( j 2 π r t ) d t = G p s i n c [ T 2 ( r 4 ϕ 2 D ) ] 0 + exp [ j 2 π ( ω 2 ϕ 3 D ) ( τ + 1 2 h ) 2 ] d τ ,
where G p , ω and r denote the amplitudes, quadratic chirp rate domain with respect to τ and chirp rate domain with respect to t, respectively. From the analysis of Equation (7), it is easy to see that it coherently accumulates at ( r , ω ) = ( 4 ϕ 2 D , 2 ϕ 3 D ) on chirp rate and quadratic chirp rate (CR-QCR) domains. QFM signal will be transformed into multi-peaks on CR-QCR domains. The peaks are related to the scale factors. We set d 1 as the reference scale factor, and the related peak as the reference peak. The relationships between peaks can be presented as
P 1 , i = ω 1 ω i = r 1 r i = d 1 d i , ( 1 i L ) ,
where P 1 , i is the zoom factors, and ω 1 and r 1 are the coordinates of reference peak. ω i and r i are the coordinates of peaks, which are related to scale factors d i . L denotes the number of the scale factors. From Equation (8), we can see that the peaks are related to the scale factors, which are selected by selection criteria. The selection criteria will be discussed in Section 3.2. According to the relationships between peaks and scale factors, the 2D-PMPCRD is proposed, which can be presented as
Q 2 D P M P C R D ( r , ω , D ) = i = 1 L M P C R D ( r , ω , d i ) .

2.2. Implementation of the 2D-PMPCRD

The key steps of the proposed algorithm are the Fourier transform with respect to τ and t. In this section, we propose mNUFFT-FFT to transform QFM signals into CR-QCR domains. The mNUFFT-FFT perform modified NUFFT along the τ -axis and modified FFT along the t-axis to speed up the implementation.
The discrete form of Equation (3) can be expressed as Equation (10) based on the sampling scheme of Classen and Mecklenbrauker [27] (CM):
R s ( n , m , D ) = s [ n + D + ( m + h 2 T s ) ] s [ n + D ( m + h 2 T s ) ] s [ n D + ( m + h 2 T s ) ] s [ n D ( m + h 2 T s ) ] ,
where T s denotes the sampling interval. n = N 2 , N 2 + 1 , , N 1 2 , m = N 2 , N 2 + 1 , , N 1 2 .
By performing the discrete Fourier transform for Equation (10) with respect to m, a new time-quadratic chirp rate technique with the optimal scale factor, which is presented as d 1 , can be represented as
T Q C ( n , ω , d 1 ) = m R s ( n , m , d 1 ) exp { j 2 π ω ( m T s + h 2 ) 2 } .
In Equation (11), the order of the integration variable is two. Thus, FFT can not be used to speed up the implement. However, through the analysis of [11,28,29], we can use NUFFT to speed up the Fourier transform along the m-axis without accuracy loss. The processing of the NUFFT can be described as
T Q C ( n , ω , d 1 ) = N U F F T m [ R s ( n , m , d 1 ) ] ,
where N U F F T m [ ] denotes the NUFFT process with respect to the m-axis.
Then, the matrix H ( n , ω ) = exp ( j 2 π ω n 2 ) is used to dechirp TQC. After that, FFT is used to speed up the Fourier transform implement with respect to n-axis. The processing can be described as
M P C R D ( r , ω , d 1 ) = F F T n [ T Q C ( n , ω , d 1 ) H ( n , ω ) ]
From Equation (9), we can see that 2D-PMPCRD needs to transform the QFM signal into the same position. However, the auto-terms will be transformed into different positions with different scale factors. Thus, this paper proposes mNUFFT-FFT to speed up the implement and transform the auto-terms into the same position.
In the mNUFFT-FFT, in order to transform the QFM signal into the same position along the m axis, the NUFFT with respect to m axis can be rewritten as follows:
T Q C ( n , ω , d i ) = m R s ( n , m , d 1 ) exp { j 2 π ω Δ ( m T s + h 2 ) 2 } ,
where ω Δ = ω 1 / P 1 , i ( 1 i L ) denotes the modified QCR domain. ω 1 denotes the reference QCR domain. Equation (14) is called mNUFFT, the auto-terms with different scale factors will be transformed into the same position along the m-axis after the mNUFFT. We can use mFFT with respect to the n-axis to transform the auto-terms with different scale factors into the same position along the n-axis after the dechirp processing. The processing of mFFT can be presented as
M P C R D ( r , ω , d i ) = n T Q C ( n , ω , d 1 ) exp ( j 2 π ω n 2 ) exp ( j 2 π r Δ n ) ,
where r Δ = r 1 / P 1 , i ( 1 i L ) denotes the modified CR domain. r 1 denotes the reference CR domain.
Finally, the discrete 2D-PMPCRD can be obtained
Q 2 D P M P C R D ( r , ω , D ) = i = 1 L M P C R D ( r , ω , d i ) ,
where L is the number of scale factors.

3. Cross-Term Suppression Performance Analysis

In this section, the cross-term suppression of 2D-PMPCRD and MLVD are analyzed. The parameter selection criterion is also discussed in this section.

3.1. Cross-Term Suppression Comparison

In this section, the cross-term suppression for 2D-PMPCRD and MLVD is discussed under multi-QFM signals. In order to explain the cross-term problem, two QFM signals are considered firstly. It can be presented as
s m u l t i ( t ) = i = 1 2 A i exp { j 2 π ( ϕ 1 , i t + 1 2 ϕ 2 , i t 2 + 1 6 ϕ 3 , i t 3 ) } + z ( t ) = A 1 exp { j 2 π ( ϕ 1 , 1 t + 1 2 ϕ 2 , 1 t 2 + 1 6 ϕ 3 , 1 t 3 ) } + A 2 exp { j 2 π ( ϕ 1 , 2 t + 1 2 ϕ 2 , 2 t 2 + 1 6 ϕ 3 , 2 t 3 ) } + z ( t ) .
In order to make the proposed algorithm more understandable, Equation (3) that denotes PSSAF of 2D-PMPCRD can be rewritten as
R s ( t , τ , D ) = R ( t + ( τ + h 2 ) , D ) R ( t ( τ + h 2 ) , D ) ,
where
R ( t , D ) = s ( t + D ) s ( t D ) .
Submitting Equations (17) into (19), we can obtain
R ( t , D ) = R a u t o ( t , D ) + R c r o s s ( t , D ) ,
where R a u t o ( t , D ) are the auto-terms, R c r o s s ( t , D ) are the cross-terms. The proposed algorithm with one scale factor can be described as
R ( t , d i ) = R a u t o ( t , d i ) + R c r o s s ( t , d i ) .
R a u t o ( t , d i ) and R c r o s s ( t , d i ) can be presented as
R a u t o ( t , d i ) = A 1 2 exp { j 2 π ( 2 ϕ 1 , 1 d i + 1 3 ϕ 3 , 1 d i 3 ) } × exp { j 2 π ( 2 ϕ 2 , 1 d i t + ϕ 3 , 1 d i t 2 ) } + A 2 2 exp { j 2 π ( 2 ϕ 1 , 2 d i + 1 3 ϕ 3 , 2 d i 3 ) } × exp { j 2 π ( 2 ϕ 2 , 2 d i t + ϕ 3 , 2 d i t 2 ) } ,
R c r o s s ( t , d i ) = A 1 A 2 exp { j 2 π [ ϕ 1 , 1 d i + ϕ 1 , 2 d i + 1 2 ϕ 2 , 1 d i 2 1 2 ϕ 2 , 2 d i 2 + 1 6 ϕ 3 , 1 d i 3 + 1 6 ϕ 3 , 2 d i 3 ] } × exp { j 2 π [ ( ϕ 1 , 1 ϕ 1 , 2 + ϕ 2 , 1 d i + ϕ 2 , 2 d i + 1 2 ϕ 3 , 1 d i 2 1 2 ϕ 3 , 2 d i 2 ) t + 1 2 ( ϕ 2 , 1 ϕ 2 , 2 + ϕ 3 , 1 d i + ϕ 3 , 2 d i ) t 2 + 1 6 ( ϕ 3 , 1 ϕ 3 , 2 ) t 3 ] } + A 1 A 2 exp { j 2 π [ ϕ 1 , 1 d i + ϕ 1 , 2 d i + 1 2 ϕ 2 , 2 d i 2 1 2 ϕ 2 , 1 d i 2 + 1 6 ϕ 3 , 1 d i 3 + 1 6 ϕ 3 , 2 d i 3 ] } × exp { j 2 π [ ( ϕ 1 , 2 ϕ 1 , 1 + ϕ 2 , 1 d i + ϕ 2 , 2 d i + 1 2 ϕ 3 , 2 d i 2 1 2 ϕ 3 , 1 d i 2 ) t + 1 2 ( ϕ 2 , 2 ϕ 2 , 1 + ϕ 3 , 1 d i + ϕ 3 , 2 d i ) t 2 + 1 6 ( ϕ 3 , 2 ϕ 3 , 1 ) t 3 ] } .
Equation (18) and the PSSAF in [11] have similar forms. Thus, Equation (18) follows the characteristic of PCFCRD [11]. If Equation (23) takes the LFM signal model, the cross-terms will form spurious peaks, which will influence the detection of the auto-terms. Equation (23) takes the LFM form when ϕ 3 , 1 = ϕ 3 , 2 . Let Δ ϕ 1 = ϕ 1 , 1 ϕ 1 , 2 , Δ ϕ 2 = ϕ 2 , 1 ϕ 2 , 2 , Δ ϕ 3 = ϕ 3 , 1 ϕ 3 , 2 . Through the analysis of Equation (23), two cases will be proposed to explain the cross-terms influences. They are listed as follows:
  • Δ ϕ 1 0 , Δ ϕ 2 0 , Δ ϕ 3 = 0 ,
  • Δ ϕ 1 0 , Δ ϕ 2 = 0 , Δ ϕ 3 = 0 .
In these two cases, the spurious peaks will appear on CR-QCR domains for the MPCRD. However, 2D-PMPCRD can greatly suppress the spurious peaks by introducing the multi-scale factor PASSF and mNUFFT-FFT. We will explain how the proposed algorithm suppresses the spurious peaks as follows.

3.1.1. Case One

When Δ ϕ 1 0 , Δ ϕ 2 0 , Δ ϕ 3 = 0 , the R c r o s s ( t , τ , d i ) can be presented as follows:
R c r o s s ( t , d i ) = A 1 A 2 exp { j 2 π [ ϕ 1 , 1 d i + ϕ 1 , 2 d i + 1 2 ϕ 2 , 1 d i 2 1 2 ϕ 2 , 2 d i 2 + 1 6 ϕ 3 , 1 d i 3 + 1 6 ϕ 3 , 2 d i 3 ] } × exp { j 2 π [ ( ϕ 1 , 1 ϕ 1 , 2 + ϕ 2 , 1 d i + ϕ 2 , 2 d i ) t + 1 2 ( ϕ 2 , 1 ϕ 2 , 2 + ϕ 3 , 1 d i + ϕ 3 , 2 d i ) t 2 ] } + A 1 A 2 exp { j 2 π [ ϕ 1 , 1 d i + ϕ 1 , 2 d i + 1 2 ϕ 2 , 2 d i 2 1 2 ϕ 2 , 1 d i 2 + 1 6 ϕ 3 , 1 d i 3 + 1 6 ϕ 3 , 2 d i 3 ] } × exp { j 2 π [ ( ϕ 1 , 2 ϕ 1 , 1 + ϕ 2 , 1 d i + ϕ 2 , 2 d i ) t + 1 2 ( ϕ 2 , 2 ϕ 2 , 1 + ϕ 3 , 1 d i + ϕ 3 , 2 d i ) t 2 ] } .
From Equation (24), we can see that the R c r o s s takes two LFM signals. Therefore, the cross-terms will form two spurious peaks. The spurious peaks coordinates are presented as
r i c r o s s 1 = 2 ( ϕ 1 , 1 ϕ 1 , 2 + ϕ 2 , 1 d i + ϕ 2 , 2 d i ) , ω i c r o s s 1 = ϕ 2 , 1 ϕ 2 , 2 + ϕ 3 , 1 d i + ϕ 3 , 2 d i ,
r i c r o s s 2 = 2 ( ϕ 1 , 2 ϕ 1 , 1 + ϕ 2 , 1 d i + ϕ 2 , 2 d i ) , ω i c r o s s 2 = ϕ 2 , 2 ϕ 2 , 1 + ϕ 3 , 1 d i + ϕ 3 , 2 d i .
From Equation (22), it is easily seen that the auto-terms take two LFM signals form, which means that the auto-terms will form two true peaks. The coordinates of true peaks are presented as
r i a u t o 1 = 4 ϕ 2 , 1 d i , ω i a u t o 1 = 2 ϕ 3 , 1 d i ,
r i a u t o 2 = 4 ϕ 2 , 2 d i , ω i a u t o 2 = 2 ϕ 3 , 2 d i .
From the analysis of the coordinates of the true peaks and the spurious peaks, we can find that the coordinates of true peaks are proportional to the scale factors. It can be presented as
P 1 , 2 = ω 1 a u t o 1 ω 2 a u t o 1 = r 1 a u t o 1 r 2 a u t o 1 = ω 1 a u t o 2 ω 2 a u t o 2 = r 1 a u t o 2 r 2 a u t o 2 .
However, the spurious peaks coordinates do not satisfy Equation (29). From Section 2.2, we can see that mNUFFT-FFT can be used to transform the auto-terms into the same position and the cross-terms into different positions on the CR-QCR domains. After performing the mNUFFT-FFT, we can enhance the true peaks and suppress the spurious peaks by multiplying all the CR-QCR domains. In order to prove the cross-term suppression performance, we consider the noiseless and noisy condition.
Example 1.
Two QFM signals P 1 , P 2 are considered to show the good cross-term suppression performance of the 2D-PMPCRD compared with MLVD in this example. The sampling frequency f s is set to 256 Hz. The signal length N and effective signal length N e are set as 624 and 512. The effective signal length N e is the length of the signal after the autocorrelation. Signal parameters are set as follows: A 1 = 1 , ϕ 1 , 1 = 10 , ϕ 2 , 1 = 10 , ϕ 3 , 1 = 4 for P 1 ; A 2 = 1 , ϕ 1 , 2 = 40 , ϕ 2 , 2 = 50 , ϕ 3 , 2 = 4 for P 2 . The constant delay is set as 2 s. In this example, two scale factors are set as d 1 = 56 , d 2 = 64 for 2D-PMPCRD, which are selected by parameter selection criterion and will be discussed in Section 3.2. Figure 1 gives simulation results of 2D-PMPCRD. Figure 2 gives the simulation results of MLVD with the scale factor equal to d 1 = 56 .
In Figure 1 and Figure 2 , Cr1, Cr2 and Au1, Au2 denote the spurious peaks and the true peaks. The CR and QCR axis denote the chirp rate and quadratic chirp rate of QFM signals. From Figure 2, we can see that there are four peaks on the CR-QCR domain by using MLVD. It is not hard to see that the spurious peaks are high enough to influence the detection of the true peaks. It is a great challenge for MLVD. Thus, the MLVD can not be used to estimate parameters of the QFM signals when multi-QFM signals have the same QCR. The 2D-PMPCRD overcomes the identifiability problem. From Figure 1, we can see that the true peaks are strengthened and the spurious peaks are greatly weakened after the 2D-PMPCRD operator. The simulation results have proven the theoretical analysis.
Example 2.
In this example, we analyze the cross-terms suppression under noisy multi-QFM signals. The parameters of QFM signals are set the same as Example 1. The input SNR is set as 0 dB. Figure 3 gives simulation results of 2D-PMPCRD. Figure 4 gives the simulation results of MLVD.
In Figure 3 and Figure 4, we can see that the true peaks are much higher than spurious peaks for the 2D-PMPCRD under noisy condition. However, the spurious peaks for the MLVD are high enough to influence the detection of the true peaks. Thus, the 2D-PMPCRD has better cross-term suppression ability than MLVD.

3.1.2. Case Two

When Δ ϕ 1 0 , Δ ϕ 2 = 0 , Δ ϕ 3 = 0 , the R c r o s s ( t , τ , d i ) can be presented as follows:
R c r o s s ( t , d i ) = A 1 A 2 exp { j 2 π [ ϕ 1 , 1 d i + ϕ 1 , 2 d i + 1 6 ϕ 3 , 1 d i 3 + 1 6 ϕ 3 , 2 d i 3 ] } × exp { j 2 π [ ( ϕ 1 , 1 ϕ 1 , 2 + ϕ 2 , 1 d i + ϕ 2 , 2 d i ) t + 1 2 ( ϕ 3 , 1 d i + ϕ 3 , 2 d i ) t 2 ] } + A 1 A 2 exp { j 2 π [ ϕ 1 , 1 d i + ϕ 1 , 2 d i + 1 6 ϕ 3 , 1 d i 3 + 1 6 ϕ 3 , 2 d i 3 ] } × exp { j 2 π [ ( ϕ 1 , 2 ϕ 1 , 1 + ϕ 2 , 1 d i + ϕ 2 , 2 d i ) t + 1 2 ( ϕ 3 , 1 d i + ϕ 3 , 2 d i ) t 2 ] } .
It is not hard to see that the coordinates of spurious peaks can be described as follows:
r i c r o s s 1 = 2 ( ϕ 1 , 2 ϕ 1 , 1 + ϕ 2 , 1 d i + ϕ 2 , 2 d i ) , ω i c r o s s 1 = ϕ 3 , 1 d i + ϕ 3 , 2 d i ,
r i c r o s s 2 = 2 ( ϕ 1 , 1 ϕ 1 , 2 + ϕ 2 , 1 d i + ϕ 2 , 2 d i ) , ω i c r o s s 2 = ϕ 3 , 1 d i + ϕ 3 , 2 d i .
Because ϕ 3 , 1 is equal to ϕ 3 , 2 and ϕ 2 , 1 is equal to ϕ 2 , 2 , we see that the auto-term will form a higher peak, which is different from case one. The position of the true peak is ( 4 ϕ 2 : d i , 2 ϕ 3 : d i ), where ϕ 2 : = ϕ 2 , 1 = ϕ 2 , 2 and ϕ 3 : = ϕ 3 , 1 = ϕ 3 , 2 , and it meets Equation (29). However, the coordinates of the spurious peaks do not meet Equation (29). Thus, the process to enhance the true peak and suppress the spurious peaks are the same as case one. In this case, we also consider the noiseless and noisy condition.
Example 3.
Two QFM signals P 3 , P 4 are considered to show the good cross-term suppression performance of the 2D-PMPCRD compared with MLVD in this example. The sampling frequency f s is set as 256 Hz. The signal length N and effective signal length N e are set as 624 and 512. Signal parameters are set as follows: A 3 = 1 , ϕ 1 , 3 = 10 , ϕ 2 , 3 = 10 , ϕ 3 , 3 = 4 for P 3 ; A 4 = 1 , ϕ 1 , 4 = 40 , ϕ 2 , 4 = 10 , ϕ 3 , 4 = 4 for P 4 . The constant delay is set as 2 s. In this example, two scale factors, which are d 1 = 56 and d 2 = 64 , are selected for 2D-PMPCRD. Figure 5 gives simulation results of 2D-PMPCRD. Figure 6 gives the simulation results of MLVD with the scale factor equal to d 1 = 56 .
In Figure 5 and Figure 6, Cr3, Cr4 and Au3, Au4 denote the spurious peaks and the true peaks. From Figure 6, we can see that two spurious peaks appear on the CR-QCR domain, which will influence the detection of the true peak. Thus, MLVD can not be used under this condition. From the analysis of Equation (22), we can see that the true peaks will appear on the same position on the CR-QCR domain when the multi-QFM signals have the same QCR and CR. From Figure 6, we can see that the simulation results have proven the theoretical analysis.
Example 4.
In this example, we analyze the cross-terms suppression under noisy multi-QFM signals. The parameters of QFM signals are set the same as Example 3. The input SNR is set as 0 dB. Figure 7 gives simulation results of 2D-PMPCRD. Figure 8 gives the simulation results of MLVD.
In Figure 7 and Figure 8, we can see that the simulation results are the same as Example 3. From Figure 5 and Figure 7, we can see that the difference between Figure 5 and Figure 7 is not obvious. In fact, there are differences between Figure 5 and Figure 7 if we calculate the peak to mean background ratio (PMR), which is the ratio of the max value of the modulus of Q 2 D P M P C R D ( r , w , D ) to the mean value of the modulus of Q 2 D P M P C R D ( r , w , D ) . The PMRs of Figure 5 and Figure 7 are about 42.07 dB and 33.24 dB, respectively. We can see that the 2D-PMPCRD also has good cross-term suppression performance under noisy environment. From the above simulation analysis, it is easy to see that the 2D-PMPCRD has better cross-term suppression ability than MLVD and can solve the identifiability problems of MLVD.

3.2. Parameter Selection Criterion

In this section, the selection criterion of the constant delay h, the scale factor d i and the number of scale factors L are analyzed.

3.2.1. Selection of Constant Delay

According to the analysis in [10,11], we know that the constant delay h is related to signal length and anti-noise performance. It can benefit the anti-noise ability if we set a suitable value. Thus, in this section, we discuss the select of the constant delay h.
With the analysis in [11], we can find that the anti-noise ability achieves its best when h N e T s . Since the effective length N e of the signal is finite in realistic application, h should not be increased without limit. Here, considering the anti-noise performance and the effective length of the signal, the constant delay h is set as
h = N e T s .
In realistic applications, we have much data that are stored in the storage. Therefore, we can use them to satisfy the constant delay [10].

3.2.2. Selection of the Scales Factors and Number of Scale Factors

Through the analysis in [21], we can see that the scale factors can not only reduce the signal order, but also benefit the anti-noise performance. The selection criteria of scale factor d i is to obtain the smallest MSE of QCR and CR according to [15]. Through the analysis in [15], the optimal d i , which is denoted as d o p t , can be presented as
d o p t 0.089 N ,
where denotes the round up function. N denotes the signal length.
According to [17], we can see that the optimal choice of L lags are d 1 = d 2 = = d L 1 = d o p t . Thus, the optimal scale factors of 2D-PMPCRD are d 1 = d 2 = = d L 1 = 0.089 N . However, in Section 3.1, we can see that the cross-terms form spurious peaks if the scale factors are set as the same. The spurious peaks influence the detection of the true peaks. To solve this problem, the simple method is to use different scale factors. Thus, the scale factors are usually selected as different ones in realistic application. Considering the accuracy of CR and QCR estimation, the sub-optimal scale factors should be selected around the optimal one [17].
From the above analysis, we can see that the selection of the number of scale factors L is also very important for the performance of 2D-PMPCRD. According to [17], estimation performance will be improved as the number of scale factors L increases. However, we can see that the anti-noise performance is improved slightly when L 2 . In this paper, from Section 3.1, we can see that the proposed algorithm can acquire good cross-term suppression performance when L is set to 2. Furthermore, from Section 2, we can see that the computation cost will increase rapidly as the number of scale factors L increases. Thus, considering the computation cost and performance, L is usually selected as 2.

4. Anti-Noise Performance and Computation Cost Analysis

In this section, anti-noise performance and computation will be analyzed for 2D-PMPCRD. Both the mono-component QFM signals and multi-QFM signals are considered to prove the good anti-noise performance of 2D-PMPCRD.

4.1. Anti-Noise Performance Analysis

In this section, we propose Examples 5 and 6 to illustrate the anti-noise performance of 2D-PMPCRD.
Example 5.
One QFM signal that denotes P 5 is considered. The sampling frequency f s is set as 256 Hz. The signal length N and effective signal length N e are set as 624 and 512. Parameters for P 5 are set as follows: A 5 = 1 , ϕ 1 , 5 = 10 , ϕ 2 , 5 = 10 , ϕ 3 , 5 = 4 . The set of scale factors are set to d 1 = 56 , d 2 = 64 . The constant delay h is set to 2 s. The test input SNRs in figures are SNR = [−8:1:−2]. In this example, 100 simulations are run for each SNR value. The input–output SNR [21] is used as a measurement and the result is shown in Figure 5a. The observed mean square error (MSE) and the Cramer–Rao Lower Bound (CRLB) of quadratic chirp rate and chirp rate in different SNRs are shown in Figure 5b,c, respectively.
From Figure 9, we can see that the anti-noise performance of HAF-ICPF is the worst. The anti-noise performance of MLVD is better than the HAF-ICPF. However, the threshold SNR of MLVD is still high. The anti-noise performance of 2D-PMPCRD is the best.
The HAF-ICPF uses HAF to reduce the coefficient order of QFM signals. However, HAF is sensitive to noise and suffers from the error propagation. Thus, from Figure 9a, we can see that the threshold SNR of HAF-ICPF is only −2 dB. The evidence of the simulation results can also be found in [15,20]. The MLVD introduces a novel PSSAF and the keystone transform to transform the QFM signals into CR-QCR domain. The MLVD can not only improve the anti-noise performance, but also overcome the error propagation by estimating the CR and QCR together on the CR-QCR domain. However, the MLVD only uses one scale factor, which is not suitable in low SNR. From Figure 9a, we can see that the threshold SNR of MLVD is −4 dB. The evidence of the simulation result can also be found in [21]. The 2D-PMPCRD uses a constant delay h and multi-scale factors D to improve the performance in low SNR. In addition, the multiplying operation of different CR-QCR domains can also improve the anti-noise performance. Therefore, the anti-noise performance of 2D-PMPCRD is the best. The threshold SNR of 2D-PMPCRD is −6 dB.
In Figure 9b,c, the MSEs of CR and QCR estimations are plotted as functions of SNR. From the Figure 9b,c, we can see that, for the 2D-PMPCRD, the MSEs of CR and QCR estimations increase abruptly at −6 dB. This is because, if the SNR is lower than the threshold SNR, there is high probability that the maximum peak on the CR-QCR domain are some random peaks, unrelated to ( ϕ 2 , 5 , ϕ 3 , 5 ) of the QFM signal. This will cause the parameter estimation algorithm to fail. Therefore, the MSEs of CR and QCR increase abruptly at the threshold SNR.
Example 6.
Two QFM signals P 6 , P 7 are considered to show the good anti-noise performance of the 2D-PMPCRD compared with MLVD under noisy multi-QFM signals. The sampling frequency f s is set as 256 Hz. The signal length N and the effective signal length N e are set as 624 and 512. Signal parameters are set as follows: A 6 = 1 , ϕ 1 , 6 = 10 , ϕ 2 , 6 = 10 , ϕ 3 , 6 = 4 for P 6 ; A 6 = 1 , ϕ 1 , 7 = 40 , ϕ 2 , 7 = 50 , ϕ 3 , 7 = 12 for P 7 . The constant delay is set as 2 s. In this example, two scale factors, which are d 1 = 56 and d 2 = 64 , are selected for 2D-PMPCRD. SNR is set as −3 dB. Figure 10a gives simulation results of 2D-PMPCRD. Figure 10b gives the simulation results of MLVD with the scale factor equal to d 1 = 56 .
From Figure 10, we can see that 2D-PMPCRD can distinguish these two QFM signals. The true peaks of MLVD are immersed in the noise. Therefore, 2D-PMPCRD has better anti-noise performance than MLVD when noisy multi-QFM signals are considered.

4.2. Computation Cost Analysis

Computation cost is an important factor that should be considered in realistic application. In this section, the computation cost of 2D-PMPCRD will be discussed and the computation cost of the comparison algorithms HAF-ICPF and MLVD will also be analyzed.
For HAF-ICPF, the main procedures are HAF and ICPF, and their computation costs are ( O ( N ) ) [14] and ( O ( N 3 ) ) [30,31], respectively. Thus, the computation cost of HAF-ICPF is ( O ( N 3 ) ) . For MLVD, the main procedures are PSSAF and keystone transform. The computation of PSSAF is ( O ( N 2 ) ) [21]. The keystone transform can be divided into FFT and IFFT [21]. Thus, the computation cost of keystone transform is similar to FFT. As we all know, the computation of FFT is ( O ( N 2 l o g 2 N ) ) . Thus, the computation cost of MLVD is ( O ( N 2 l o g 2 N ) ) [21]. The main procedures of 2D-PMPCRD are PSSAF, dechirp operation, mNUFFT-FFT and L 1 products of MPCRD. The computation cost of the PSSAF of 2D-PMPCRD is similar to MLVD, thus its computation cost is ( O ( N 2 ) ) . The computation cost of dechirp operation is ( O ( N 2 ) ) [11]. From the analysis of Section 3.1, we know that the mNUFFT-FFT can be divided into NUFFT and FFT. Thus, the computation cost of the mNUFFT-FFT is the same as NUFFT and FFT, whose computation costs are ( O ( N 2 l o g 2 N ) ) [11,28,29]. In realistic application, L is much smaller than the signal effective length (e.g., 2). Thus, the computation of 2D-PMPCRD is ( O ( N 2 l o g 2 N ) ) . The computation costs of these three algorithms are listed in Table 1.
From Table 1, we can see that the computational cost of HAF-ICPF is the worst. The computational cost of 2D-PMPCRD is equivalent to MLVD. Therefore, 2D-PMPCRD can obtain better cross-terms suppression performance and anti-noise performance with reasonable computational cost. Compared with HAF-ICPF and MLVD, the proposed algorithm is more suitable for the real-time ISAR imaging system.

5. Conclusions

In this paper, we propose the 2D-PMPCRD to estimate CR and QCR of the QFM signals by introducing a novel multi-scale PSSAF and the mNUFFT-FFT. The PSSAF utilizes the multi-scale factors and the constant delay to improve the anti-noise performance. The mNUFFT-FFT transforms the auto-terms into the same position and the cross-terms into different positions on CR-QCR domains. By multiplying all the CR-QCR domains, 2D-PMPCRD can greatly weaken the cross-terms while strengthening the auto-terms. Meanwhile, the operation of multiplying can also improve the anti-noise performance. Furthermore, the 2D-PMPCRD can be easily implemented by using the multi-scale PSSAF, the mNUFFT-FFT and the complex multiplication. The simulation results verify that the 2D-PMPCRD has obvious superiorities in cross-term suppression and improves the identifiability ability under multi-QFM signals’ situation. The 2D-PMPCRD can greatly improve the anti-noise performance with reasonable computation cost, and its threshold SNR reaches −6 dB.

Author Contributions

Conceptualization, Z.Q., F.Q. and C.H.; Methodology, Z.Q., F.Q and C.H.; Software, F.Q. and F.J.; Validation, F.Q. and F.J.; Resources, F.Q. and F.J.; Data Curation, F.Q. and F.j.; Writing-Original Draft Preparation, F.Q.; Writing-Review & Editing, F.Q., Z.Q. and F.J.; Visualization, F.Q; Supervision, Z.F.; Project Adiministration, Z.Q.; Funding Acquistion, Z.Q.

Funding

This work was supported by the China NSF Grant (61671168), the Natural Science Foundation of Heilongjiang Province of China (QC2016085) and the Fundamental Research Funds for the Central Universities (HEUCF 170802).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Lazarov, A.; Minchev, C. ISAR geometry, signal model, and image processing algorithms. IET Radar Sonar Navig. 2017, 11, 1425–1434. [Google Scholar] [CrossRef]
  2. Lazarov, A. ISAR signal formation and image reconstruction as complex spatial transforms. In Digital Image Processing; InTech: London, UK, 2012; pp. 27–50. [Google Scholar]
  3. Xing, M.; Bao, Z. High resolution ISAR imaging of high speed moving targets. IEE Proc. Radar Sonar Navig. 2005, 152, 58–67. [Google Scholar] [CrossRef]
  4. Wang, J.; Kasilingam, D. Global range alignment for ISAR. IEEE Trans. Aerosp. Electron. Syst. 2003, 39, 351–357. [Google Scholar] [CrossRef]
  5. Zhu, D.; Li, Y.; Zhu, Z. A keystone transform without interpolation for SAR ground moving-target imaging. IEEE Geosci. Remote Sens. Lett. 2007, 4, 18–22. [Google Scholar] [CrossRef]
  6. Xing, M.; Wu, R.; Lan, J.; Zheng, B. Migration through resolution cell compensation in ISAR imaging. IEEE Geosci. Remote Sens. Lett. 2004, 1, 141–144. [Google Scholar] [CrossRef]
  7. Xing, M.; Wu, R.; Li, Y.; Bao, Z. New ISAR imaging algorithm based on modified Wigner–Ville distribution. IET Radar Sonar Navig. 2009, 3, 70–80. [Google Scholar] [CrossRef]
  8. Almeida, L.B. The fractional fourier transform and time-frequency representations. IEEE Trans. Signal Process. 1994, 42, 3084–3091. [Google Scholar] [CrossRef]
  9. Shea, P.O. A new technique for instantaneous frequency rate estimation. IEEE Signal Process. Lett. 2002, 9, 251–252. [Google Scholar] [CrossRef] [Green Version]
  10. Lv, X.; Bi, G.; Wan, C.; Xing, M. Lv’s distribution: Principle, implementation, properties, and performance. IEEE Trans. Signal Process. 2011, 59, 3576–3591. [Google Scholar] [CrossRef]
  11. Zheng, J.; Liu, H.; Liu, Q.H. Parameterized centroid frequency-chirp rate distribution for LFM signal analysis and mechanisms of constant delay introduction. IEEE Trans. Signal Process. 2017, 65, 6435–6447. [Google Scholar] [CrossRef]
  12. Abatzoglou, T.J. Fast maximum likelihood joint estimation of frequency and frequency rate. IEEE Trans. Aerosp. Electron. Syst. 1986, 22, 708–715. [Google Scholar] [CrossRef]
  13. Zheng, J. Fast Parameter Estimation Algorithm for Cubic Phase Signal Based on Quantifying Effects of Doppler Frequency Shift. Prog. Electromagn. Res. 2013, 142, 57–74. [Google Scholar] [CrossRef]
  14. Barbarossa, S.; Petrone, V. Analysis of polynomial-phase signals by the integrated generalized ambiguity function. IEEE Trans. Signal Process. 1997, 45, 316–327. [Google Scholar] [CrossRef]
  15. Djurovic, I.; Simeunovic, M.; Djukanovic, S.; Wang, P. A hybrid CPF-HAF estimation of polynomial-phase signals: Detailed statistical analysis. IEEE Trans. Signal Process. 2012, 60, 5010–5023. [Google Scholar] [CrossRef]
  16. Shea, P.O. A fast algorithm for estimating the parameters of a quadratic FM signal. IEEE Trans. Signal Process. 2004, 52, 385–393. [Google Scholar] [CrossRef] [Green Version]
  17. Barbarossa, S.; Scaglione, A.; Giannakis, G.B. Product high-order ambiguity function for multicomponent polynomial-phase signal modeling. IEEE Trans. Signal Process. 1998, 46, 691–708. [Google Scholar] [CrossRef]
  18. Wang, P.; Yang, J. Multicomponent chirp signals analysis using product cubic phase function. Digit. Signal Process. 2006, 16, 654–669. [Google Scholar] [CrossRef]
  19. Wang, Y.; Jiang, Y. Inverse synthetic aperture radar imaging of maneuvering target based on the product generalized cubic phase function. IEEE Geosci. Remote Sens. Lett. 2011, 8, 958–962. [Google Scholar] [CrossRef]
  20. Zheng, J.; Su, T.; Zhu, W.; Zhang, L.; Liu, Z.; Liu, Q.H. ISAR imaging of nonuniformly rotating target based on a fast parameter estimation algorithm of cubic phase signal. IEEE Trans. Geosci. Remote Sens. 2015, 53, 4727–4740. [Google Scholar] [CrossRef]
  21. Li, Y.; Su, T.; Zheng, J.; He, X. ISAR imaging of targets with complex motions based on modified Lv’s distribution for cubic phase signal. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 2015, 8, 4775–4784. [Google Scholar] [CrossRef]
  22. Li, X.; Kong, L.; Cui, G.; Yi, W.; Yang, Y. ISAR imaging of maneuvering target with complex motions based on ACCF-LVD. Digit. Signal Process. 2015, 46, 191–200. [Google Scholar] [CrossRef]
  23. Li, X.; Liu, G.; Ni, J. Autofocusing of ISAR images based on entropy minimization. IEEE Trans. Aerosp. Electron. Syst. 1999, 35, 1240–1252. [Google Scholar] [CrossRef]
  24. Wahl, D.E.; Eichel, P.H.; Ghiglia, D.C.; Jakowatz, C.V. Phase gradient autofocus-a robust tool for high resolution SAR phase correction. IEEE Trans. Aerosp. Electron. Syst. 1994, 30, 827–835. [Google Scholar] [CrossRef]
  25. Bai, X.; Tao, R.; Wang, Z.; Wang, Y. ISAR imaging of a ship target based on parameter estimation of multicomponent quadratic frequency-modulated signals. IEEE Trans. Geosci. Remote Sens. 2014, 52, 1418–1429. [Google Scholar] [CrossRef]
  26. Wu, L.; Wei, X.; Yang, D.; Wang, H.; Li, X. ISAR imaging of targets with complex motion based on discrete chirp fourier transform for cubic chirps. IEEE Trans. Geosci. Remote Sens. 2012, 50, 4201–4212. [Google Scholar] [CrossRef]
  27. Claasen, T.A.C.M.; Mecklenbräuker, W.F.G. The wigner distribution—A tool for time-frequency signal analysis-Part II: Discrete time signals. Philips J. Res. 1980, 35, 276–300. [Google Scholar]
  28. Nguyen, N.; Liu, Q.H. The regular Fourier matrices and nonuniform fast Fourier transforms. SIAM J. Sci. Comput. 1999, 21, 283–293. [Google Scholar] [CrossRef]
  29. Liu, Q.H.; Nguyen, N.; Tang, X.Y. Accurate algorithms for nonuniform fast forward and inverse Fourier transforms and their applications. In Proceedings of the 1998 IEEE International Geoscience and Remote Sensing Symposium (1998 IGARSS ’98), Seattle, WA, USA, 1998; Volume 1, pp. 288–290. [Google Scholar]
  30. Su, J.; Tao, H.H.; Rao, X.; Xie, J.; Guo, X.L. Coherently integrated cubic phase function for multiple LFM signals analysis. Electron. Lett. 2015, 51, 411–413. [Google Scholar] [CrossRef]
  31. Zheng, J.B.; Liu, H.W.; Liao, G.S.; Su, T.; Liu, Z.; Liu, Q.H. ISAR imaging of targets with complex motions based on a noise-resistant parameter estimation algorithm without nonuniform axis. IEEE Sens. J. 2016, 16, 2509–2518. [Google Scholar] [CrossRef]
Figure 1. Cross-terms suppression of 2D-PMPCRD.
Figure 1. Cross-terms suppression of 2D-PMPCRD.
Sensors 18 01624 g001
Figure 2. Cross-terms suppression of MLVD.
Figure 2. Cross-terms suppression of MLVD.
Sensors 18 01624 g002
Figure 3. Cross-terms suppression of 2D-PMPCRD ( S N R = 0 dB).
Figure 3. Cross-terms suppression of 2D-PMPCRD ( S N R = 0 dB).
Sensors 18 01624 g003
Figure 4. Cross-terms suppression of MLVD ( S N R = 0 dB).
Figure 4. Cross-terms suppression of MLVD ( S N R = 0 dB).
Sensors 18 01624 g004
Figure 5. Cross-terms suppression of 2D-PMPCRD.
Figure 5. Cross-terms suppression of 2D-PMPCRD.
Sensors 18 01624 g005
Figure 6. Cross-terms suppression of MLVD.
Figure 6. Cross-terms suppression of MLVD.
Sensors 18 01624 g006
Figure 7. Cross-terms suppression of 2D-PMPCRD ( S N R = 0 dB).
Figure 7. Cross-terms suppression of 2D-PMPCRD ( S N R = 0 dB).
Sensors 18 01624 g007
Figure 8. Cross-terms suppression of MLVD ( S N R = 0 dB).
Figure 8. Cross-terms suppression of MLVD ( S N R = 0 dB).
Sensors 18 01624 g008
Figure 9. Anti-noise performance analysis for mono-QFM signal. (a) Input–output SNR; (b) MSEs of the CR estimation; (c) MSEs of the QCR estimation.
Figure 9. Anti-noise performance analysis for mono-QFM signal. (a) Input–output SNR; (b) MSEs of the CR estimation; (c) MSEs of the QCR estimation.
Sensors 18 01624 g009
Figure 10. Anti-noise performance analysis for multi-QFM signals ( S N R = −3 dB). (a) Anti-noise performance of 2D-PMPCRD; (b) anti-noise performance of MLVD.
Figure 10. Anti-noise performance analysis for multi-QFM signals ( S N R = −3 dB). (a) Anti-noise performance of 2D-PMPCRD; (b) anti-noise performance of MLVD.
Sensors 18 01624 g010
Table 1. Computation cost of algorithms.
Table 1. Computation cost of algorithms.
Estimation AlgorithmComputation Cost
HAF-ICPF O ( N 3 )
MLVD O ( N 2 l o g 2 N )
2D-PMPCRD O ( N 2 l o g 2 N )

Share and Cite

MDPI and ACS Style

Qu, Z.; Qu, F.; Hou, C.; Jing, F. Quadratic Frequency Modulation Signals Parameter Estimation Based on Two-Dimensional Product Modified Parameterized Chirp Rate-Quadratic Chirp Rate Distribution. Sensors 2018, 18, 1624. https://doi.org/10.3390/s18051624

AMA Style

Qu Z, Qu F, Hou C, Jing F. Quadratic Frequency Modulation Signals Parameter Estimation Based on Two-Dimensional Product Modified Parameterized Chirp Rate-Quadratic Chirp Rate Distribution. Sensors. 2018; 18(5):1624. https://doi.org/10.3390/s18051624

Chicago/Turabian Style

Qu, Zhiyu, Fuxin Qu, Changbo Hou, and Fulong Jing. 2018. "Quadratic Frequency Modulation Signals Parameter Estimation Based on Two-Dimensional Product Modified Parameterized Chirp Rate-Quadratic Chirp Rate Distribution" Sensors 18, no. 5: 1624. https://doi.org/10.3390/s18051624

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