Skip to main content

Clutter cancellation in passive radar using batch-based CLEAN technique

Abstract

Passive radar (PR) systems need to detect the presence of a target response, which is many orders of magnitude weaker than the clutter (direct signal and multipath). Indeed, the clutter cancellation is a key stage within a PR processing scheme. One of the most effective techniques in this field is using the CLEAN approach. In this paper, the batch-based CLEAN technique based on GMP and FFT has been proposed, which can speed up the computational processing and have better cancellation gain. Furthermore, segmenting operation can be applied to the signal obtained over long time. It is helpful to enhance temporal or spatial efficiency and overcome effect of time-varying clutter. Experiment results with simulated and real passive radar data verify the effectiveness of the proposed algorithm.

Introduction

Passive radar (PR) is a special bistatic radar system, which exploits signals of opportunity (e.g., FM, DVB-T, GSM, Wi-Fi, etc.) designed for other applications [13]. At the last years, lots of literatures on passive radar have been published worldwide. PR systems have received much interest in military as well as commercial applications, mainly because of their covertness, low-cost implementation, and immunity to jamming, etc. [47].

A typical PR system consists of two receive channels. One receive channel would sample the signal received directly from the transmitter of opportunity. This is known as the “reference” channel. The other “surveillance” channel is used to detect echoes from targets. The surveillance channel also contains the small fraction of the direct signal and other stationary clutter. In general, the clutter causes serious degradation of dynamic range and masking of weak targets by sidelobes. It is great significance for passive radar signals processing to study clutter cancellation. Now, many solutions have been put forward and can be divided into two categories: (1) adaptive filtering methods and (2) fixed coefficient methods. Some evaluation of clutter cancellation methods also have been presented [812]. The adaptive filtering methods mainly included least mean squares (LMS), recursive least squares (RLS), and least square lattice (LSL). These adaptive techniques can automatically adjust to time-varying signal statistics [10]. Fixed coefficient filtering techniques assume that the clutter terms are fixed throughout the coherent processing interval (CPI). The sample matrix inversion (SMI) [12] is a typical coefficient filtering method. The filter output using the SMI technique in matrix form can be calculated by least squares (LS). In particular, the LS algorithm is very attractive due to its simplicity. Note that the cancellation performance of the fixed coefficient algorithms degraded significantly for time-varying scenario. Clearly, the selection of an appropriate method requires careful consideration of various factors according to the actual circumstance.

CLEAN is another commonly used fixed coefficient filtering method. It was initially developed as a deconvolution tool in the mid-1970s [13, 14]. Recently, some CLEAN-type algorithms have been widely employed to remove the sidelobe effect for the radar signal processing. The CLEAN can be carried out in the range-compressed domain [1517] or the time domain [18, 19]. The latter iteratively removes the direct signal and the echoes of stationary objects from the surveillance signal. The CLEAN technique is very similar to matching pursuit (MP), which chooses at each iteration an atom from the dictionary that is best adapted to approximate the residual [20]. The aim of MP is to build a sparse decomposition using an iterative procedure, which has been used in a wide variety of application areas [21, 22]. In this paper, we introduce an extension of the MP to pursue efficiency of clutter cancellation for passive radar. Our approach named GMP is literally a generalization of the MP in the sense that multiple atoms are identified per iteration and coefficients are estimated by use of LS. Based on GMP and fast Fourier transform (FFT), a batch-based CLEAN technique with a reasonable memory requirement and computational time is proposed. It can identify and remove the largest components of clutter at each iteration; in other words, the clutter cancellation method has a batch processing style.

This paper is organized as follows. In Section 2, the passive radar clutter signal model and CLEAN concept are described. In Section 3, we present GMP and discuss about how to carry out batch-based CLEAN. In Section 4, the performance of the proposed technique is verified by using simulated and real passive radar data. The last section concludes this paper.

Model and basis of CLEAN

Passive radar signal model

Typical passive radar geometry is depicted in Fig. 1. The transmitter illuminates a target and the reference antenna directs towards it. The surveillance antenna directs towards the target. We assume that the target moves with a given velocity, and s(t) is the transmit signal. Meanwhile, echoes of the reference channel and surveillance channel are denoted as sref(t) and ssurv(t), respectively.

Fig. 1
figure1

The passive radar scenario

Since, at the reference channel, the direct signal is received by the main lobe of the receiver antenna, it is possible to assume that the signal collected by the reference channel does not contain clutter. In other words, the scatterer contributions received from the sidelobes are usually negligible. And then, the reference signal can be written as

$$ s_{{ref}}(t)= A_{r} s(t-\tau_{r}) + n_{{ref}}(t) $$
(1)

where Ar and τr, respectively, are the complex amplitude and delay for the direct signal. The amplitude Ar represents propagation effect, and the delay τr, which equals to the bistatic baseline range over the speed of light, is generally assumed to be known and fixed. nnef(t) is the thermal noise. A more general model of the reference signal with noise and multipath interference is beyond the scope of this paper, and the detailed description can be found in [23, 24].

Assuming that there is only one target, the signal collected by the surveillance channel can be expressed as

$$ s_{{surv}}(t)= s_{{target}}(t) + s_{{clutter}}(t)+n_{{surv}}(t) $$
(2)

where

$$s_{{target}}(t)= A_{{mt}} s(t-\tau_{{mt}})exp(j2\pi f_{{mt}}t) $$
$$s_{{clutter}}(t)=\sum \limits_{i} A_{i} s(t-\tau_{i})=\sum \limits_{i} s_{{ci}}(t) $$

The complex amplitude, delay, and Doppler shift for the moving target are Amt,τmt, and fmt, respectively. Similarly, the ith path (direct or multipath) sci(t) results in its own unique complex amplitude Ai and delay τi. nsurv(t) is the thermal noise at the surveillance antenna.

To obtain target Doppler and range information, cross ambiguity function (CAF) between the surveillance and reference signals is an effective tool. The definition of CAF is

$$ s_{{CAF}}(\tau,f_{d})=\int_{T_{{int}}} s_{{surv}}(t)s^{\ast}_{{ref}}(t-\tau)exp(-j2\pi f_{d}t) dt $$
(3)

where Tint is the coherent processing interval (CPI), τ is the delay, fd is the Doppler frequency, and denotes the complex conjugate. By substituting Eq. (2) into Eq. (3), Eq. (3) can be approximated as follows:

$$\begin{array}{@{}rcl@{}} s_{{CAF}}(\tau,f_{d})&= s_{CAF,target}+s_{CAF,clutter}+s_{CAF,noise}\\ &\approx s_{CAF,target}+s_{CAF,clutter}\hspace{2cm} \end{array} $$
(4)

where

$$s_{CAF,target}(\tau,f_{d})=\int_{T_{{int}}} s_{{target}}(t)s^{\ast}_{{ref}}(t-\tau)exp(-j2\pi f_{d}t) dt $$
$$s_{CAF,clutter}(\tau,f_{d})=\sum \limits_{i} \int_{T_{{int}}} s_{{ci}}(t)s^{\ast}_{{ref}}(t-\tau)exp(-j2\pi f_{d}t) dt $$

It was concluded that the final range-Doppler surface can be written as the sum of the range-Doppler surfaces of each component. In many cases, the clutter signal is much stronger than the useful echo signal. Thus, without compensation, the sidelobe of these clutter components sCAF,clutter may mask weak moving target sCAF,target.

CLEAN processing

MP can be viewed in the radar context as a CLEAN algorithm: estimate iteratively the strongest components of the signal (in the correlation magnitude sense) and remove them from the original signal. We will then provide a brief description.

The goal of clutter cancellation is to remove sclutter(t) from the surveillance channel signal ssurv(t) by first estimating the unknown clutter sclutter(t) and then subtracting this estimated component. From Eqs. (1) and (2), we can obtain

$$ s_{{clutter}}(t)=\sum \limits_{i} s_{{ci}}(t)=\sum \limits_{i} w_{i} s_{{ref}}\left(t-\tau_{i}^{\prime}\right) $$
(5)

where wi=Ai/Ar and τi′=τiτr is the relative discrete time delay of the ith path between the reference channel and surveillance channel.

The CLEAN algorithm for the passive radar, as depicted in Fig. 2, is an iterative procedure using the following update formula:

$$ s_{{surv}}^{(k)}(t)= s_{{surv}}^{(k-1)}(t)-s_{ci\_{{max}}}(t) $$
(6)
Fig. 2
figure2

The CLEAN scheme

where superscript k denotes the iteration index, \(s_{{surv}}^{(0)}(t)=s_{{surv}}(t)\). \(s_{ci\_max}(t)=w_{p} s_{{ref}}\left (t-\tau _{p}^{\prime }\right)\) is the strongest component of clutter in the surveillance channel at present step. After the peak selection using cross-correlation calculation of the surveillance and reference signals, \(\tau _{p}^{\prime }\) and wp can be estimated during each iteration. \(s_{{surv}}^{(k)}(t)\) is the “CLEANed” signal of \(s_{{surv}}^{(k-1)}(t)\) in kth iteration. The process is executed repeatedly until a particular stopping criterion is met.

Batch-based CLEAN method

In this section, the discrete-time signal model of radar echo will be explained here as an introduction to the problem of clutter cancellation. Then, we extend the concept of MP to a generalization case and use it as a basis for batch-based CLEAN.

Vector-matrix form of clutter cancellation

In case of a digital receiver system, we consider the discrete form of the clutter sampled at interval Ts, such that t=nTs, n is time index. From Eq. (5), the clutter term sclutter(n) can be regarded as the weighted sum of all versions of reference sref(n) with different time delays. Considering that the moving target term and noise term are usually less significant, the discrete form of surveillance signal can be approximated as

$$ s_{{surv}}(n)\approx\sum \limits_{i=0}^{L-1} s_{{ci}}(n) =\sum \limits_{i=0}^{L-1} w_{i} s_{{ref}}(n-i) $$
(7)

The number of coefficients is set by length L, that is to say, the clutter components with i=0,1,,L−1 has been modeled. And we can rewrite this in vector-matrix form as

$$ \boldsymbol{s}_{{surv}}=\boldsymbol{S}_{r}\boldsymbol{w} $$
(8)

where \(\boldsymbol {s}_{{surv}}\in \mathbb {C}^{N}, \boldsymbol {S}_{r}\in \mathbb {C}^{N\times L}, \boldsymbol {w}\in \mathbb {C}^{L}\) denote the observed data vector, dictionary matrix, reflective coefficient vector, respectively. They have the form

$$ \boldsymbol{s}_{{surv}}=\left[\begin{array}{llll} s_{{surv}}(0) &s_{{surv}}(1) &\cdots\ &s_{{surv}}(N) \end{array}\right]^{\mathrm{T}} $$
(9)
$$ \begin{aligned} \boldsymbol{S}_{r}&=\left[\begin{array}{llll} s_{{ref}}(0) & 0 & \cdots\ &0\\ s_{{ref}}(1) & s_{{ref}}(0) & &\vdots\\ \vdots & s_{{ref}}(1) & \ddots & 0 \\ s_{{ref}}(N-L)& \vdots & &s_{{ref}}(0)\\ 0 &s_{{ref}}(N-L)& \ddots &s_{{ref}}(1)\\ \vdots & 0 & &\vdots\\ 0 & \cdots\ & 0 & s_{{ref}}(N-L)\\ \end{array}\right]\\ \end{aligned} $$
(10)
$$ \boldsymbol{w}=\left[\begin{array}{llll} w(0) & w(1) &\cdots\ & w(L-1) \end{array}\right]^{\mathrm{T}} $$
(11)

where N=Tint/Ts and T denotes transpose. The matrix Sr can be written as

$$ \begin{aligned} \boldsymbol{S}_{r}&=\left[\begin{array}{llll} \boldsymbol{s}_{ref,0}&\boldsymbol{s}_{ref,1} &\cdots\ &\boldsymbol{s}_{ref,(L-1)} \end{array}\right] \end{aligned} $$
(12)

where sref,l is an N×1 vector, with l=0,1,,L−1. In other words, the atom of dictionary matrix is time-delayed replicas of the reference waveform. The L-dimensional coefficient vector w can be evaluated by resorting to the least square (LS) approach that minimizes the power of the output, i.e.,

$$ \boldsymbol{\hat {w}}=\left(\boldsymbol{S}_{r}^{H} \boldsymbol{S}_{r}\right)^{-1} \boldsymbol{S}_{r}^{H} \boldsymbol{s}_{{surv}} $$
(13)

where H denotes conjugate transpose. The N-dimensional output vector yLS of clutter cancellation can be expressed as

$$ \boldsymbol{y}_{{LS}}=\boldsymbol{s}_{{surv}} - \boldsymbol{S}_{r} \boldsymbol{\hat {w}} $$
(14)

Generalized matching pursuit (GMP)

It should be noted that the vector w is amplitude scaling from the scatterers in finite range cells. In general, there are a few dominating scatterers, so w can be regarded as a sparse vector. However, when the measured signal ssurv contains not just clutter, but also a certain amount of noise and echo from moving target, some non-zero components w can occur to fit the non-ideal signal, which is called overfitting. Therefore, to deal with the overfitting problem, the sparse estimation of w is desirable and can be found by greedy method.

The MP algorithm is a greedy algorithm which chooses at each iteration an atom from the dictionary that is best adapted to approximate the residual signal. The absolute value of the inner product is used to measure the correlation between atoms and the residual signal. Thus, the basic CLEAN similar to MP can be regarded as projecting the surveillance signal ssurv to the dictionary Sr. The most relevant index can be obtained by

$$ \hat{l}=\mathop{\arg\max}_{l} \left\{\left|\langle\boldsymbol{s}_{ref,l}, \boldsymbol{s}_{{surv}}\rangle \right| \right\} $$
(15)

The surveillance signal obtained at the kth iteration can be expressed as

$$ \begin{aligned} \boldsymbol{s}_{{surv}}^{(k)} &= \boldsymbol{s}_{{surv}}^{(k-1)}-\frac{ \boldsymbol{S}_{r_{\varLambda}}^{H} \boldsymbol{s}_{{surv}}^{(k-1)} }{ \boldsymbol{S}_{r_{\varLambda}}^{H} \boldsymbol{S}_{r_{\varLambda}}} \boldsymbol{S}_{r_{\varLambda}}\\ &=\boldsymbol{s}_{{surv}}^{(k-1)}-\boldsymbol{S}_{r_{\varLambda}}\left(\boldsymbol{S}_{r_{\varLambda}}^{H} \boldsymbol{S}_{r_{\varLambda}}\right)^{-1} \boldsymbol{S}_{r_{\varLambda}}^{H} \boldsymbol{s}_{{surv}}^{(k-1)} \end{aligned} $$
(16)

where \(\phantom {\dot {i}\!}\varLambda =\left \{\hat {l}^{(k)}\right \}, \boldsymbol {S}_{r_{\varLambda }} = \left [\boldsymbol {s}_{ref,\hat {l}^{(k)}}\right ]\). After one or more subsequent iterations, the clutter can be suppressed and \(\boldsymbol {y}_{{MP}}=\boldsymbol {s}_{{surv}}^{(k) }\) is produced.

Here, we make a direct extension of the MP by choosing indices corresponding to Q(≥1) largest correlation in identification step of each iteration. Obviously, it embraces the MP as a special case (Q=1). Therefore, our method is referred to as generalized MP (GMP), which is similar to the ideas behind GOMP [25]. GMP reduces the number of iterations and has better calculation ability. The coefficients are calculated by LS in estimation step. The clutter cancellation in passive radar can be achieved by using GMP depicted in Fig. 3. In particular, we will care more about the residual \(\boldsymbol {s}_{{surv}}^{(k)}\) than the reconstruction performance of w.

Fig. 3
figure3

Pseudocode for GMP

Residual update will occur continuously, and then the final residual \(\boldsymbol {s}_{{surv}}^{(k)}\) is the cancellation output yGMP. Obviously, the clutter cancellation using GMP is equivalent to one using the LS when Q=L (see Eq. (14)), and it is equivalent to one using the MP when Q=1 (see Eq. (16)).

Batch-based CLEAN

The key point of the proposed GMP in computation and storage exists in two steps: one is the computation of the inner product \(\boldsymbol {S}_{r}^{H} \boldsymbol {s}_{{surv}}^{(k-1)}\), and the other is the preparation of the complete dictionary Sr. In order to handle high-dimension signal (N is too large), we present a batch-based CLEAN technique using fast Fourier transform (FFT).

Let Ssurv=FFT (ssurv) be a vector containing the Fourier transform of the surveillance signal, and Sref=FFT (sref,0) is a vector containing the Fourier transform of the reference signal. Based on the principle of matched filtering (MF), the inner product can be obtained by sMF=IFFT\(\left (\boldsymbol {S}_{{surv}} \boldsymbol {S}_{{ref}}^{\ast }\right)\). The locations of the maximum values of sMF correspond to the delay information of the strongest components of clutter, so the support set Λ and the corresponding partial dictionary \(\phantom {\dot {i}\!}\boldsymbol {S}_{r_{\varLambda }} \) can be determined, which is shown in Fig. 4. Due to the fact that the batch-based CLEAN method directly constructs a matrix \(\phantom {\dot {i}\!}\boldsymbol {S}_{r_{\varLambda }}^{N \times Q} \) of order Q without building a dictionary \(\boldsymbol {S}_{r}^{N \times L }\) of order L (where QL), this method greatly reduces the requirements on storage space. We analyze the computational complexity of the proposed batch-based CLEAN algorithm. Table 1 summarizes the computational complexity in term of complex multiplications.

Fig. 4
figure4

Illustration for identification of batch-based CLEAN (Q = 4)

Table 1 Computational complexity in term of complex multiplications

The CLEAN-type technique usually assumes that time-invariant clutter environment over the CPI, which may not hold in practice. In response to the time-variant characteristic of clutter, we present a batch-based CLEAN with segmentation. In our method, the recorded reference signal and surveillance signal are first divided into data segments with length of Nsub. In each signal segment, the amplitude and the time delay of clutter can be regarded as nearly constant. The next step is zero setting to the last L elements at the end of reference segment, and then FFT-based matched filtering is implemented to process the surveillance segment. The previous L elements in the following output vector can then be used in the identification of batch-based CLEAN. The illustration for proposed processing is shown in Fig. 5. One thing to note is that all segments can be processed in parallel.

Fig. 5
figure5

Illustration for segmentation of batch-based CLEAN

Experimental results and discussion

In this section, we present experimental results with simulated data and real data. The performance of the developed batch-based CLEAN technique is here analyzed.

Simulated data

We have conducted numerical experiments to investigate the performance of the proposed clutter cancellation method. The reference channel signal of digital television (DTV)-based passive radar is simulated. Chinese DTV standard (digital television terrestrial broadcasting (DTTB)) was published in 2006 [26]. The signal frame structure is given in Fig. 6, which explains that the signal frame consists of frame head (945 symbols) and frame body (3780 symbols). For surveillance channel signal simulation, we assume that there is no moving target. The radar and clutter parameters used in the simulation are listed in Tables 2 and 3. Thermal noise was modeled as complex Gaussian white noise.

Fig. 6
figure6

Signal frame structure of the DTTB signal

Table 2 Parameters of the radar system
Table 3 Parameters of the clutter

In order to quantitatively evaluate the performances of clutter cancellation methods, we use cancellation gain as a metric. The definition of gain Gc is

$$ G_{c} = 10log_{10}\frac{ \| \boldsymbol{s}_{{surv}}^{(0)} \|_{2}^{2} }{ \| \boldsymbol{s}_{{surv}}^{(k)} \|_{2}^{2}} \ $$
(17)

In general, the larger cancellation gain implies better clutter cancellation. The performances of clutter cancellation methods (L=128,K=6) are shown in Table 4. The run times are shown in the final row. Owing to the selection of multiple time-delayed replicas, the GMP is finished with smaller number of iterations when compared to the MP. The results show that the method by using proposed GMP is well done. It has good cancellation performance with fast processing speed. To enhance the feasibility of this clutter cancellation method, FFT is adopted to accomplish the speediness calculation, which is listed in Table 5.

Table 4 Comparison of clutter cancellation methods for simulated passive radar data I
Table 5 Comparison of clutter cancellation methods with FFT for simulated passive radar data

It should be noted that the main parameters to be selected are L, K, and Q, which affects the clutter cancellation. We must note that the optimal values are environment specific. Parameters will be set empirically for the data at hand. It needs to follow the below principles.

(i) The best L is exactly large enough to contain principal components of clutter. Figure 7 shows that smaller L results in decreased cancellation gain, while bigger L cannot achieve further improvements of cancellation gain. In the actual application, the value of L is usually set according to the scene of indoor or outdoor surveillance.

Fig. 7
figure7

The effect of parameter L on cancellation gain

(ii) K indicates sparsity of clutter, which is the number of principal components and is typically unknown. The termination criterion of the proposed batch-based CLEAN method is

$$ k \ge \lceil {K/Q} \rceil $$
(18)

Obviously, the bigger sparsity K means more iterations. As the sparsity increases, the cancellation gain increases firstly and tends to be stable finally, but the run time increases continuously. The results are shown in Fig. 8. Therefore, using the variation of cancellation gain, the termination criterion is modified as

$$ k \ge \lceil {K/Q}\rceil ~ or ~ \left| G_{c}^{(k)} -G_{c}^{(k-1)} \right| < Th $$
(19)
Fig. 8
figure8

The effect of the termination criterion Eq. (18). a Cancellation gain vs. parameter K. b Run time vs. parameter K

where \(G_{c}^{(k)}\) and \(G_{c}^{(k-1)}\) are cancellation gains in adjacent iterations and Th is a threshold. Obviously, a small variation of cancellation gain means that clutter cancellation is almost complete. Figure 9 shows the results using new termination criterion (Th=0.1), which can reduce unnecessary time consumption.

Fig. 9
figure9

The effect of the termination criterion Eq. (19). a Cancellation gain vs. parameter K. b Run time vs. parameter K

(iii) Q is not the larger the better. It is true that the number of iterations usually decreases for larger Q values, but the amount of calculation and storage in each iteration are larger simultaneously. Moreover, bigger Q may cause the selection of “incorrect” indices. Figure 10a demonstrates the degradation in cancellation gain when Q = 6. However, this is not a serious problem, which can be solved through the addition of iterations(see Fig. 10b). Thus, there is a tradeoff decided in accordance with actual condition.

Fig. 10
figure10

The effect of parameter Q on cancellation gain and run time. aK = 6. bK = 12

To further evaluate the performance of the proposed cancellation technique, the following simulated scenario will consist of one moving target echo and stationary distributed clutter. The moving target has the following parameters. The amplitude ratio Amt/A is 0.01, the range cell index (τmt) is 47, and the Doppler cell index (fmt) is −20. The other parameters are set to the same as that in previous simulated experiment. In an ideal situation (no clutter), the range-Doppler (RD) map obtained by the classical CAF is shown in Fig. 11. We select two specific clutter cases as reported in Fig. 12a and b. Case A and case B represent the moderate clutter and the severe clutter, respectively. And then, the RD maps obtained by the classical CAF are shown in Fig. 13. In the left figures, only zero-Doppler components are visible. It can be found from the right figures that the non-zero-Doppler component related to the moving target is still invisible after masking zero-Doppler.

Fig. 11
figure11

The RD map of a moving target

Fig. 12
figure12

The diagram of distributed clutter: a case A and b case B

Fig. 13
figure13

The RD maps: a before and b after masking zero-Doppler for case A; c before and d after masking zero-Doppler for case B

And then, we compare the proposed batch-based CLEAN method with basic CLEAN and SMI. The performance analysis of clutter cancellation methods is shown in Tables 6, 7, and 8, which correspond to cancellation gains, run times, and signal-to-noise ratios (SNRs), respectively. As is expected, the SMI method has a good cancellation capability, while it uses a longer running time than other CLEAN methods. For the two clutter cases, the CLEAN technique is still useful, but the performance has an obvious degradation. Compared with the basic CLEAN method, the proposed batch-based CLEAN has a better capability.

Table 6 Comparison of cancellation gains
Table 7 Comparison of run times
Table 8 Comparison of signal-to-noise ratios

The RD maps obtained by using SMI are presented in Fig. 14. It is clear that SMI exhibited high level of cancellation. Figure 15 depicts the results obtained by using batch-based CLEAN. These figures show that the CLEAN method has acceptable performances in terms of clutter cancellation. In other words, the moving target becomes visible, though the residual clutter is also visible. It is important to point out that the SMI method has to construct the complete dictionary (see Eq. (10)), and there will be a great space use. Because of high memory cost of the SMI method, it cannot be implemented in subsequent experiment. Owing to parameter Q, the proposed method leads to greater flexibility.

Fig. 14
figure14

The RD maps obtained by using SMI a before and b after masking zero-Doppler for case A; c before and d after masking zero-Doppler for case B

Fig. 15
figure15

The RD maps obtained by using the proposed method (Q = 3) a before and b after masking zero-Doppler for case A; c before and d after masking zero-Doppler for case B

Real data

The effectiveness of the proposed CLEAN technique with segmentation is demonstrated using a real data set derived from an experimental DTV-based PR system. The scene of data collection is shown in Fig. 16. The illuminator of opportunity considered in this paper is a terrestrial TV transmitter located in Beijing, China. The receiver is located on top of the library building in the LiangXiang campus of Beijing Institute of Technology (BIT). The experiment was conducted near Nanyuan Airport. The carrier frequency is 674MHz, the bandwidth is 7.56MHz, and the sampling rate is 10MHz.

Fig. 16
figure16

DTV-based PR system

The data set used in this paper is a 200-ms capture including an airborne target and several stationary targets. The CAF result without clutter cancellation is shown in Fig. 17, and the target is completely masked by sidelobes of clutter. The data has been processed offline by the proposed batch-based CLEAN with segmentation. Each segment of data takes the same time and can all be processed in parallel. The sample number of each segment Nsub will ensure that at least the output of matched filtering (MF) maintains an enough high correlation peak to ensure we get correct identification information. Here, we set main parameters as follows: Nsub=65536,L=4096.

Fig. 17
figure17

The CAF result without clutter cancellation

Figure 18 illustrates the effect of sparsity setting to cancellation gain and run time obtained by using basic CLEAN. According to the obtained result, we can conclude that there is dense clutter in the experimental scene (urban scene). We should set the parameter K in a reasonable range L/2≤KL. The performances of the batch-based CLEAN are demonstrated in Fig. 19. As the value of Q increases, the cancellation gain has increasing trend, but the run time decreases firstly and increases finally, so Q cannot be too large. The results show that the proposed clutter cancellation method (Q>1) has not only accelerated the computational speed, but also improved cancellation gain.

Fig. 18
figure18

The effect of parameter K to cancellation gain and run time obtained by using basic CLEAN

Fig. 19
figure19

The performances of batch-based CLEAN

After clutter cancellation, the coherent integration results are shown in Figs. 20 and 21, where the peak of the moving target is obvious. It can be seen that the moving target is submerged in the clutter signal before clutter cancellation, and the target can be detected after CLEAN processing. The SNRs of CAF results are listed in Table 9, which shows the proposed batch-based CLEAN technique gives better detection performance for passive radar.

Fig. 20
figure20

The CAF results on real data after a basic CLEAN (K = 2048) and b batch-based CLEAN (K = 2048, Q = 64)

Fig. 21
figure21

The CAF results on real data after a basic CLEAN (K = 4096) and b batch-based CLEAN (K = 4096, Q = 64)

Table 9 Signal-to-noise ratios of CAF

Conclusion

In passive radar, clutter cancellation is a key problem for weak signal detection, and the CLEAN algorithm is used for clutter cancellation. To speed up the computational processing and improve the cancellatio4 gain, a batch-based CLEAN using GMP and FFT is proposed. Furthermore, the effects of various parameters on performance are analyzed. Experiment results show that through the proposed scheme, the clutter is effectively suppressed and the weak target emerges. The batch-based CLEAN technique can serve as a good candidate for clutter cancellation in passive radar.

Availability of data and materials

The data that support the findings of this study are available from the corresponding author upon reasonable request.

Abbreviations

PR:

Passive radar

LMS:

Least mean square

RLS:

Recursive least square

MP:

Matching pursuit

GMP:

Generalized matching pursuit

FFT:

Fast fourier transform

LS:

Least square

CAF:

Cross ambiguity function CAF

CPI:

Coherent processing interval

GOMP:

Generalized orthogonal matching pursuit

DTV:

Digital television

DTTB:

Digital television terrestrial broadcasting

SNRs:

Signal-to-noise ratios

References

  1. 1

    G. Reitsma, FM radio based bistatic radar. IEE Proc.- Radar, Sonar Navig.152(3), 107–115 (2005).

    Article  Google Scholar 

  2. 2

    H. D. Griffiths, C. J. Baker, Passive coherent location radar systems. Part 1: performance prediction. IEE Proc.- Radar, Sonar Navig.152(3), 153–159 (2005).

    Article  Google Scholar 

  3. 3

    C. J. Baker, H. D. Griffiths, I. Papoutsis, Passive coherent location radar systems. Part 2: waveform properties. IEE Proc.- Radar, Sonar Navig.152(3), 160–168 (2005).

    Article  Google Scholar 

  4. 4

    H. Kuschel, in Proc. International Conference on Radar. Approaching 80 years of passive radar (IEEEAdelaide, 2013), pp. 213–217.

    Google Scholar 

  5. 5

    K. E. Olsen, W. Asen, Bridging the gap between civilian and military passive radar. IEEE Aerosp. Electron. Syst. Mag.32(2), 4–12 (2017).

    Article  Google Scholar 

  6. 6

    J. L. Garry, G. E. Smith, Passive ISAR part I: framework and considerations. IET Radar, Sonar Navig.13(2), 169–180 (2019).

    Article  Google Scholar 

  7. 7

    A. Manno-Kovacs, E. Giusti, F. Berizzi, L. Kovács, Image based robust target classification for passive ISAR. IEEE Sensors J.19(1), 268–276 (2019).

    Article  Google Scholar 

  8. 8

    M. Malanowski, in Proc. International Radar Symposium. Comparison of adaptive methods for clutter removal in PCL radar (IEEEKrakow, 2006), pp. 1–4.

    Google Scholar 

  9. 9

    R. Cardinali, F. Colone, C. Ferretti, P. Lombardo, in Proc. IEEE Radar Conf. (RadarConf). Comparison of clutter and multipath cancellation techniques for passive radar (IEEEBoston, 2007), pp. 469–474.

    Google Scholar 

  10. 10

    J. E. Palmer, S. J. Searle, in Proc. IEEE Radar Conf. (RadarConf). Evaluation of adaptive filter algorithms for clutter cancellation in passive bistatic radar (IEEEAtlanta, 2012), pp. 493–498.

    Google Scholar 

  11. 11

    J. L. Garry, G. E. Smith, C. J. Baker, in Proc. Signal Process. Symp. (SPSympo). Direct signal suppression schemes for passive radar (IEEEDebe, 2015), pp. 1–5.

    Google Scholar 

  12. 12

    T. Peto, R. Seller, in Proc. International Radar Symposium (IRS). Time domain filter comparison in passive radar systems (IEEEPrague, 2017), pp. 1–10.

    Google Scholar 

  13. 13

    V. J. Schwarz, Mathematical-statistical description of the iterative beam removing technique (method CLEAN). Astron. Astrophys.65:, 345–356 (1978).

    Google Scholar 

  14. 14

    A. Segalovitz, B. R. Friedene, A CLEAN-type deconvolution algorithm. Astron. Astrophys. 70:, 335–343 (1978).

    Google Scholar 

  15. 15

    K. Kulpa, P. Samczynski, M. Malanowski, L. Maslikowski, V. Kubica, in Proc. IEEE Radar Conf. (RadarConf). The use of CLEAN processing for passive SAR image creation (IEEEOttawa, 2013), pp. 1–6.

    Google Scholar 

  16. 16

    L. Maslikowski, P. Samczynski, M. Baczyk, P. Krysik, K. Kulpa, Passive bistatic SAR imaging—challenges and limitations. IEEE Aerosp. Electron. Syst. Mag.29(7), 23–29 (2014).

    Article  Google Scholar 

  17. 17

    D. Gromek, K. Kulpa, P. Samczynski, Experimental results of passive SAR imaging using DVB-T illuminators of opportunity. IEEE Geosci. Remote Sens. Lett.13(8), 1124–1128 (2016).

    Article  Google Scholar 

  18. 18

    K. S. Kulpa, Z. Czekała, Masking effect and its removal in PCL radar. IEE Proc.-Radar, Sonar Navig.152(3), 174–178 (2005).

    Article  Google Scholar 

  19. 19

    J. Palmer, S. Palumbo, A. Summers, D. Merrett, S. Searle, S. Howard, An overview of an illuminator of opportunity passive radar research project and its signal processing research directions. Digit. Sig. Process.21(5), 593–599 (2011).

    Article  Google Scholar 

  20. 20

    S. G. Mallat, Z. Zhang, Matching pursuits with time-frequency dictionaries. Trans. Acoust., Speech, Sig. Process.41(12), 3397–3415 (1993).

    Article  Google Scholar 

  21. 21

    S. F. Cotter, B. D. Rao, Sparse channel estimation via matching pursuit with application to equalization. IEEE Trans. Commun.50(3), 374–377 (2002).

    Article  Google Scholar 

  22. 22

    J. Bosse, O. Rabaste, Subspace rejection for matching pursuit in the presence of unresolved targets. IEEE Trans. Sig. Process.66(8), 1997–2010 (2018).

    MathSciNet  Article  Google Scholar 

  23. 23

    P. Krysik, Z. Gajo, in Proc. European Radar Conference. The impact and minimization of multipath propagation effects in the reference channel of a GSM based passive radar (IEEERome, 2014), pp. 116–120.

    Google Scholar 

  24. 24

    X. Zhang, J. Yi, X. Wan, Y. Liu, in Proc.IEEE Radar Conference. On the performance of multipath in reference signal for passive radar interference cancellation (IEEESeattle, 2017), pp. 1313–1316.

    Google Scholar 

  25. 25

    J. Wang, S. Kwon, B. Shim, Generalized orthogonal matching pursuit. IEEE Trans. Sig. Process.60(12), 6202–6216 (2012).

    MathSciNet  Article  Google Scholar 

  26. 26

    J. Feng, J. Liu, Zhou X., GB (Chinese National Standard) 20600-2006:‘Framing structure, channel coding and modulation for digital television terrestrial broadcasting system[J], SAC (Standardization Administration of the People’s Republic of China)’ (2006).

Download references

Acknowledgements

The authors are grateful to the National Science Foundation of China for its support of this research.

Funding

This work was supported in part by the National Natural Science Foundation of China (Grant 61771046, 61731023, 61421001).

Author information

Affiliations

Authors

Contributions

X. Bai and J. Han designed and performed the experiments. And then XB analyzed the results and wrote the manuscript. All authors discussed the results and revised the manuscript. The author(s) read and approved the final manuscript.

Corresponding author

Correspondence to Xia Bai.

Ethics declarations

Competing interests

The authors declare that they have no competing interests.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Bai, X., Han, J., Zhao, J. et al. Clutter cancellation in passive radar using batch-based CLEAN technique. EURASIP J. Adv. Signal Process. 2021, 63 (2021). https://doi.org/10.1186/s13634-021-00769-9

Download citation

Keywords

  • Clutter cancellation
  • Passive radar
  • CLEAN
  • Matching pursuit