1. Introduction
Recently, passive bistatic radar (PBR) has received renewed and increasing interest due to its capability of silent surveillance [
1]. The absence of a transmitter enables PBR to avoid spectrum occupancy and realize target detection by exploiting the existing illuminators of opportunity (IOs), such as frequency-modulated (FM)-based broadcast [
2], as well as digital transmissions, such as global systems for mobile communication (GSMs) [
3], digital audio broadcasting (DAB) [
4], digital video broadcasting—terrestrial (DVB-T) [
5], digital video broadcasting—satellite (DVB-S) [
6], global navigation satellite system (GNSS) signal [
7], and the 5G network [
8]. Various PBR systems have been developed and employed for shorter-range monitoring applications to detect small drones, vehicles, and people, or for remote area surveillance [
1]. When the IOs exhibit several regular frequency bands emitted by a single transmitter, further performance improvements can be achieved via exploiting multi-frequency integration (MFI) [
9].
So far, MFI techniques have been widely applied in various IOs, such as FM broadcast signals [
10], DVB-T signals [
11], and DVB-S signals [
12]. Among them, DVB-S, as a satellite-based IO, can provide a high range resolution of several meters and continental coverage [
13]. Therefore, it is a promising IO and has been widely applied to detect unmanned aerial vehicles (UAVs) [
14], offshore vessels [
15], and ground vehicles [
16,
17]. Hence, this article selects the DVB-S signal as the IO for investigation.
The main challenge of the DVB-S-based PBR is its extremely low power density on the Earth’s surface [
18]. To cope with this limitation and achieve a robust detection of moving targets, long time integration and increasing the number of fusion channels are required to enhance the SNR of the weak echo. However, both of these will result in the energy misalignment [
19], which can be divided into two parts: range cell migration (RCM) and Doppler frequency migration (DFM) [
20]. Specifically, the target’s energy will disperse in multiple range cells due to the effect of RCM. Abundant solutions have been proposed to address the RCM, such as keystone transform (KT) [
21], Hough transform (HT) [
22], and their variants [
23]. However, in the case of MFI, RCM occurs mainly due to the time-varying bandwidth, and RCM is particularly evident in FM-based PBR [
9]. To circumvent this effect, a number of channels with consistent bandwidth are selected so that the target will locate in the same range bin at different frequency bands, due to the same physical path and range resolution. On the other hand, the conventional DFM is generated by the maneuverability (i.e., acceleration or jerk) of a moving target [
20]. Typical methods for solving the DFM effect could be the phase matching (PM) approach [
24], de-chirp method [
25], chirp-Fourier transform [
26], and fractional Fourier transform (FRFT) [
27], etc.
However, different from the conventional DFM, the DFM in MFI, called MF-DFM, imposes great challenges to MTD which need to be accounted for. According to [
28], MF-DFM is caused by the frequency-hopping characteristic of the transmitted signal. If the same coherent processing interval (CPI) is employed in each frequency channel, the MF-DFM effect will result in the target appearing in different Doppler frequency bins, although the target moves with a constant velocity during the observations. Furthermore, when the radial velocity of the target is too high, or the CPI is too long, MF-DFM will become more evident, resulting in significant Doppler migration, which is also known as Doppler spread. This kind of migration cannot be eliminated by the conventional time–frequency method [
28]. To address the MF-DFM, ref. [
11] has proposed a practical solution, where different CPI in each frequency channel is allowed, thus enabling fusion with the same velocity resolution. Rather than fusion in range-Doppler mapping (RDM), ref. [
11] performs fusion in the range–velocity mapping (RVM). However, there are two main limitations of using the approach in [
11]. First, the CPI of each channel is specially selected, so it is non-trivial to generate multiple uniform RVMs for MF-based centralized detection. Interpolation or zero-padding is required at the cost of computational load. Second, ref. [
11] combines multiple RVMs via non-coherent integration (NCI), which inevitably achieves less processing gain than the coherent ones.
Based on the principle of whether the phase information of the radar returns is used or not, the long-time integration methods can be divided into non-coherent integration and coherent integration. By exploiting the phase information, coherent integration can outperform non-coherent integration [
29]. As an approach of coherent integration, Radon–Fourier transform (RFT) achieves moving target detection (MTD) with a long CPI [
30,
31]. Unlike the existing methods, RFT can be viewed as a generalized Doppler filter bank and processes signals jointly in the space–time–frequency domain [
30]. Due to its outstanding performance, RFT and its variants have been extensively studied in various radar systems, such as offshore-based linear frequency-modulated (LFM) radar [
32], and GNSS-based PBR [
33,
34]. However, thus far, there are limited studies that propose an RFT-based solution for migrating MF-DFM in MF-PBR. Moreover, RFT-based processing requires the nearly consistent phase of the target unit within the integration domain; otherwise, it will suffer from coherent integration loss if the standard deviation of the phase estimate exceeds a certain degree [
35]. Consequently, it is imperative that the phase of the target in MF-RDMs should be estimated and compensated for prior to the coherent integration.
Motivated by the previous works, in this paper, we consider the quasi-coherent integration problem for MTD in MF-based PBR with an equal and long CPI in each frequency channel. According to our analysis, MF-DFM is likely to occur prior to the RCM, as the CPI increases. To focus on the issues in MF integration, including MF-DFM and residual phase errors, we primarily consider the detection scenario of a single point-like target with a constant velocity. The main contributions of this work are summarized as follows:
- 1.
To eliminate the MF-DFM, a novel approach based on MF-based RFT (MF-RFT) is proposed. Specifically, a set of MF-Doppler filter banks (MF-DFBs) is dedicatedly designed, which is realized via conducting a thorough velocity search in the range/slow-time domain. By implementing this technique, the reflections of the moving target in the MF-RDMs can be focused on the Doppler centroid (DC) of the target, ultimately achieving the correction of the MF-DFM.
- 2.
To remove the residual phase errors following the MF-RFT, a phase-compensation-based method is also developed by formulating an optimization problem based on the minimum-entropy criterion. The particle swarm optimization (PSO) algorithm is then employed to solve the optimization problem for estimating the residual phase errors. Combining with MF-RFT, the proposed method could allow effective phase compensation, and quasi-coherent MF integration is then robustly achieved, improving the SNR of the weak target significantly.
Both simulated and field test results based on DVB-S signals show that the proposed algorithm could greatly improve the detection performance in the presence of MF-DFM and substantial residual phase errors, achieving better detection performance at low-SNR conditions, as compared with the existing algorithms.
The remainder of this article is organized as follows:
Section 2 describes the signal model and the challenge in MFI, i.e., MF-DFM. The proposed method is then illustrated in
Section 3. The effectiveness of the proposed algorithm is evaluated through simulation and field test results in
Section 4. Finally, conclusions are drawn in
Section 5.
3. Proposed Algorithm
To overcome MF-DFM, we propose an MF-based RFT (MF-RFT) algorithm, which can be viewed as an extension of RFT in the multi-frequency domain. Specifically, to implement MF-RFT, we first design a set of MF-based DFB (MF-DFB), which can correct the MF-DFM of the target in the MF domain and enables the reflected energy to focus in the DC of the target. Then, in order to realize the quasi-coherent MF integration, an optimization problem for phase estimation is formulated based on the minimum-entropy criterion. Then, the PSO algorithm is employed to solve the optimization problem. Finally, the SNR of the target echo is greatly improved using MF synthesis. In the following, we investigate them accordingly.
3.1. Definition of MF-RFT
According to [
30], RFT achieves coherent integration of the target’s energy via DFB obtained by searching motion parameters. As an extension of RFT, MF-RFT enables the elimination of the MF-DFM effect by designing a sequence of MF-DFB. The derivation of MF-DFB is given in the following.
From (
2), we define the Doppler term of the target,
. By substituting (
5) into
,
can be rewritten as follows:
where
, is the Doppler centroid of the moving target, as shown in
Figure 4. As consequently, the coefficients of MF-DFB are defined as follows:
Obviously, given a set of selected frequency channels, i.e.,
, and a velocity of interest
, the coefficients of
are uniquely determined. In other words, leveraging the prior knowledge of the carrier frequency can effectively reduce the computational burden of the MF-DFB. In practice, the target’s velocity is usually unknown. However, it is possible to employ a velocity search to estimate the target’s velocity. This means the coherent synthesis of multiple RDMs, i.e.,
, reaches its maximum only when the searching parameter matches the true target’s velocity
, i.e.,
. The coherent synthesis of multiple RDMs, i.e.,
, is defined as follows:
where
is the
m-th filtered RDM, which is calculated as,
where
is the two-dimensional (2-D) matrix obtained by batch-based range compression and stacking along slow-time.
is the index of slow-time. As a result, the Doppler frequencies of the target in the
m-th frequency band can be corrected to the DC of the target because of the MF-DFB.
To implement the calculation of (
17), discrete Fourier transform (DFT) can be employed. Accordingly, Equation (
17) can be rewritten as follows:
where
denotes the DFT along the slow-time dimension. As a result, the estimation of the unknown target’s velocity is obtained by solving the following optimization problem as follows:
The above optimization problem can be solved by first fixing a small region of interest (ROI) r and then performing a parameter search of .
As shown in
Figure 4, the filter coefficients of MF-DFB are then be determined after the velocity search. The final output of MF-RFT is expressed as follows:
Using (
20), the MF-DFM effect can be eliminated by the proposed MF-RFT so that the target envelope can be locked in the same Doppler cell. However, the derivation above ignores the residual phase error in the target unit. The residual phase error will lead to coherent integration loss. In [
35], the authors have shown that the coherent integration loss depends on the distribution of the phase error. In the case of a uniform distribution, the coherent integration loss will exceed 2 dB when the standard deviation of the phase fluctuation exceeds 0.7 rad, and will reach 5 dB when the standard deviation of the phase exceeds 1 rad.
If the phase information in MF is unknown or difficult to compensate for, the NCI-based MF-RFT (MF-RFT-NCI) is a practical choice. The velocity search in MF-RFT-NCI is modified as follows:
Note that (
21) is quite different from (
19), since (
21) employs a squared magnitude operation and NCI-based summation, while (
20) performs coherent summation and then squares the magnitude. Phase synchronization is needed in MF-RFT. Accordingly, the MF-RFT-NCI can be obtained as
Based on the NCI-based processing, the final detection results are achieved by the generalized gamma-based constant false alarm rate (CFAR) detector [
38].
3.2. Me-Based PSO Algorithm for Phase Estimation
The processing gain of NCI-based processing is limited as compared with coherent processing. In the following, an ME-based phase estimation method is proposed to eliminate the effect of the residual phase error. In order to ensure the availability of coherence, it is intuitive to estimate and compensate for the residual phase for further improving the processing gain of MF-RFT processing.
Given a certain range and velocity, i.e.,
r and
, the output of MF-DFB with phase compensation can be expressed as,
where
is utilized to cancel the phase error. To determine
, we formulate it as an optimization problem based on the global minimum-entropy criterion [
39], as follows:
where
is the dimension of the Doppler domain, and
C is a normalized term, which is calculated as,
Consequently, finding
can be achieved by minimizing the optimization problem as,
To ensure the uniqueness of the solution, we usually constrain
= 0. The above optimization problem is high-dimensional and nonlinear, so it is non-trivial and NP-hard to prove its convexity. In the case when M is small, exhausted searching (ES) can be used to obtain the optimal minimum of (
26). However, in practical conditions, ES is not a desirable choice since its computational complexity increases with the exponential of M, i.e.,
. As a greedy algorithm, the dynamic program (DP) can solve the above optimization problem with a lower computational complexity but DP cannot guarantee the global optimal when the SNR is extremely low. To reduce the complexity of the algorithm as well as guaranteeing the optimality of the solution, we choose the PSO algorithm in [
40] to solve (
26). Compared with ES, PSO is an efficient algorithm that can converge within a certain number of iterations and achieves satisfactory accuracy, although the result is not necessarily the optimum.
The parameter notation in the ME-based PSO (ME-PSO) algorithm is summarized as follows:
- 1.
: The population of particles which is initialized, and i is its subscript index;
- 2.
M: The dimension of the particles’ state, which is the same as the number of the used fusion channel;
- 3.
: The maximum number of iterations; k is the iteration index;
- 4.
: The phase vectors of the i-th particle at the k-th iteration, where R is denoted as fields of a real number;
- 5.
: The velocity vectors of the i-th particle at the k-th iteration;
- 6.
w: The inertia weights, which are used to control global exploration and local exploration of the particles;
- 7.
: The two independent and uniformly distributed random numbers accounting for random movements of the particle. In experiments, we generally set = 0.5 and = 0.5. and are random numbers with intervals of [0,1], denoted by rand ([0,1]);
- 8.
: The personal best of the i-th particle at the k-th iteration;
- 9.
: The global best at the k-th iteration.
The procedures of the proposed ME-based PSO algorithm for phase estimation is shown in Algorithm 1.
Algorithm 1: ME-based PSO for phase estimation |
| Input: Intial phase vectors (also known as the initial state of the particles), inital velocity vectors of the particles , maximum loop times , and , for . |
| Output: Optimal/suboptimal phase estimation . |
1 | Initialize the random parameters, including , , and , , , , where fitness value using (24). |
2 | while do |
3 | | | | for do |
4 | | | | | | = rand([0, 1]), = rand([0, 1]), |
5 | | | | | | , |
6 | | | | | | ; |
7 | | | | | | if and else; |
8 | | | | | | if then |
9 | | | | | | | ; |
10 | | | | | | else |
11 | | | | | | | ; |
12 | | | | | | end |
13 | | | | | | if and else; |
14 | | | | | | if then |
15 | | | | | | | ; |
16 | | | | | | else |
17 | | | | | | | ; |
18 | | | | | | end |
19 | | | | end |
20 | | | | , ; |
21 | end |
3.3. Phase Compensation and MF Quasi-Coherent Integration
After the MF-RFT and ME-PSO-based phase estimation, the phase compensation should be performed for quasi-coherent MF integration. Since the signatures of the target are unknown, phase compensation cannot accurately be performed only to the target’s unit. Instead, phase compensation is required to be performed in each range-Doppler cell as,
The combination of MF-RFT and ME-PSO can be categorized as a quasi-coherent detector [
41], and thus it is denoted by MF-RFT-QCI for simplicity of notation. Using (
27), a target peak will be generated on the integrated RDM by simultaneously correcting the MF-DFM and the residual phase error. To confirm whether the target peak is the detected target or not, the biparametric CFAR detector employed in [
42] can form the Gaussian distributed test statistic using vast IID samples.
3.4. Implementation of the Proposed Algorithm
For a better understanding of the proposed algorithm,
Figure 5 gives the flowchart of the proposed algorithm, which consists of seven steps. The procedures of the proposed algorithm are illustrated step-by-step in the following.
Step 1: Carry out the demodulation and batch-based range compression to accumulate energy within each frequency channel.
Based on the MF coherent PBR receiver, the target returns are sampled in fast-time in the intermediate frequency (IF). Then, the sample data are digitally down-converted (DDC) into the signal of the baseband, which is also known as demodulation. With the use of corresponding signals of RC, the batch-based range compression [
43] is used for the first stage of coherent integration in the fast-time domain. The data, after batch-based range compression, are stored as a 2-D matrix in the range and slow-time domains, i.e.,
, for
,
. The signals at different frequency bands are also processed in parallel.
Step 2: Parameter initialization for MF-RFT and ME-PSO algorithm.
First, parameter initialization for the MF-RFT algorithm is given as follows: the coherent integration time
, the number of batches in slow-time
K, the range search scope
. Based on the relative prior information such as moving statues of the target to be detected, the expected search scope of the velocity
, and the velocity interval
is defined as,
Therefore, the values of the search range are
= round[(
)/
], where
denotes the range resolution as (
6), and round[] denotes the operation of rounding up to an integer. Similarly, the search value of the velocity is
= round[(
)/
]. In particular, the coherent integration time
should be specially selected, i.e.,
for avoiding the RCM.
Second, the parameter initialization of the ME-PSO algorithm is given as follows: According to [
44], the population of the particles
is set as 80. Most importantly, the particles
are initialized randomly and as uniformly distributed in the searching space as possible. The maximum iteration
.
Step 3: Apply the MF-RFT to eliminate the MF-DFM using a velocity search.
Given a search range
r, this step is performing the MF-DFB to estimate the target’s velocity
. Given the prior knowledge of the carrier frequency, the expected search scope of the velocity
, and velocity interval
, and the coefficients of MF-DFB, i.e.,
can be determined using (
15).
Step 4: Perform PSO algorithm for phase estimation.
Given a searching velocity
, this step is to find the estimate of the residual phase error by solving the optimization problem in (
26). It is noted that the accuracy of phase estimation is highly related to the dimension of the searching space of the range and Doppler frequency. To the best knowledge of the authors, the interesting range is as limited as possible.
Step 5: Go through all the searching parameters and obtain the estimates of the unknown parameters.
Go through all the searching scope of range, velocity, and phase. Repeat steps 3 and 4 to obtain a peak value in the range-Doppler domain, as
where
is calculated as (
27).
Step 6: Perform quasi-coherent integration and construct the integrated RDM.
With the estimation of range, velocity, and phase, the integrated RDM can be obtained using (
27). It is noted that the above operations will lead to power deviation, so a normalization in MF is required before quasi-coherent MF integration.
Step 7: Carry out the CFAR detection to confirm a target.
Take the squared magnitude of the integrated RDM in step 6 as the test statistic, and compare it with the adaptive threshold for a given expected false alarm rate as,
where
is the adaptive threshold obtained by the CFAR detector. If the test statistic is smaller than the threshold, there will be no moving target detected. The CFAR process goes through all the cells under test (CUTs) and yields the final detection results.
3.5. Consideration of Computational Complexity
Although the proposed method is reasonably superior to the existing methods in terms of detection capability via migrating MF-DFM and residual phase errors, the improved performance comes at the cost of computational complexity. Specifically, the increased complexity comes from several aspects: (1) the range search; (2) the velocity search in MF-DFB; and (3) the phase estimation by the ME-PSO algorithm. Fortunately, when the parameters of the radar system are given and some prior information (such as location) of the target to be detected can be obtained, the searching area in the parameter space can be greatly reduced [
32]. Specifically, the location information can be obtained from the previous tracking records or high-SNR results. The location information is not necessarily accurate before detection since the range search in the proposed MF-RFT can refine the location based on the coarse location information and reduce the scope of the range search, which also results in a decreased computational load. On the contrary, the scope of the range search should be extended to the maximum detection range of the target if the location information of the target is unavailable [
45]. In addition, many operations, such as MF-DFB, can be replaced by the fast Fourier transform (FFT) algorithm if the number of Doppler dimensions is an integer power of two. Moreover, the proposed ME-PSO algorithm for phase estimation can significantly alleviate the computational burden with acceptable performance. Therefore, the proposed approach is promising for real-world implementation, and its running time will be evaluated in the next section.