Open Access

Reduced-dimension space-time adaptive processing based on angle-Doppler correlation coefficient

EURASIP Journal on Advances in Signal Processing20162016:97

https://doi.org/10.1186/s13634-016-0395-2

Received: 5 April 2016

Accepted: 2 September 2016

Published: 13 September 2016

Abstract

Traditional space-time adaptive processing (STAP) is a strategy for clutter suppression in airborne radar, which requires a large number of computational complexity and secondary data. In order to address the problem, reduced-dimension (RD) STAP is generally used. We propose a novel RD STAP through searching the best channels as the auxiliary channels to cancel the interference. Based on the estimation of the clutter Fourier basis vectors offline, a parameter named angle-Doppler correlation coefficient (ADC 2) is constructed to evaluate the capability of each auxiliary channel in clutter suppression, and the best sets of RD channels can be selected. The proposed algorithm can achieve the best detection performance with the fixed number of auxiliary channel. When the degrees of freedom (DOF) are restricted to a small value, only one auxiliary channel is needed to guarantee the SINR loss less than 3 dB. Therefore, the requirement of the training sample can be reduced, which makes the proposed approach more suitable for the heterogeneous clutter environments.

Keywords

Airborne radarSpace-time adaptive processingReduced-dimensionClutter covariance matrix

1 Introduction

Space-time adaptive processing (STAP) plays an important role in the areas of airborne radar and sonar systems, which collect signals linearly from an array to detect weak targets within severe clutter and jamming environments [1, 2]. The clutter-plus-noise covariance matrix (CCM) is employed to calculate the filter weights for clutter suppression. It has been long known that increasing the number of degrees of freedom (DOF) enables excellent detection performance, but since the computational complexity and the number of samples for estimation CCM are limited, it is difficult to be implemented in practical work [3]. In recent years, a large amount of productive works have been studied aiming at STAP with few DOF and secondary data and provide a better detection performance in heterogeneous clutter and strong jammer environment, including the knowledge-aided radar, the multiple-input multiple-output radar, and the jamming suppression in complex environment [46].

The foremost theory of STAP is to adjust the space-time filter weights to maximize output signal-to-interference-plus-noise ratio (SINR) adaptively with DOF as less as possible. Therefore, the dimensionality reduction and rank reduction techniques are explored extensively and addressed in the literature. When it comes to reduced-dimension (RD) STAP, some typical suboptimal approaches like the factor approach [7], the joint domain localized (JDL) [8], and the space-time multiple-beam (STMB) [9] have been proposed, which employ a fixed dimension reducing transformation prior to the processing. Lately, a modified RD STAP was proposed by selecting auxiliary channels near the clutter ridge [10]. However, none of the traditional RD STAP can select auxiliary channels adaptively. A multistage multiple-beam (MSMB) technique is proposed in [11, 12], based on the principle of selecting auxiliary channels to cancel the interference components in the main channel clearly. But it is not appropriate for engineering applications because a large amount of calculation is needed.

On the other hand, reduced-rank (RR) STAP approaches make use of data-dependent transformations, such as the principal components (PC) inverse [13], the cross-spectral metric (CSM) [14], and multistage Wiener filter (MSWF) [15, 16]. However, the performance of the RR STAP algorithm aforementioned drops rapidly when the processing DOFs decrease less than the clutter rank. For the purpose of reducing the DOF during interference processing, a reconfigurable array beamforming approach is proposed in [17], and [18] extends this approach to an antenna-pulse selection strategy. According to the authors described in [19], a thinned STAP method is proposed and generates even better SINR loss performance for slow-moving target compared to the full configuration STAP, but the SINR will never exceed the full one because of the decreased amount of antenna and pulse.

In this article, a novel RD STAP approach consisting of an auxiliary channel selection strategy based on a parameter referred to as ADC 2 is proposed. To construct the mode of CCM offline, the clutter Fourier basis can be achieved by the geometry of airborne array, and the amplitude of each basis can be calculated by estimating the ratio of clutter to noise utilizing a least squares method. Furthermore, ADC 2 will be formulated after a serious transformation of CCM, which is in direct proportion to detection performance. The best channels will be found by selecting the maximum ADC 2 in both angular and Doppler domains, and the general transformation matrix will be derived. We process the radar data in the localized region after RD processing, so that a sub-optimal detection performance and low calculated amount can be achieved.

The paper is organized as follows. In Section 2, we formulate the signal mode and review the STAP approach in the transform domain. We transform the clairvoyant CCM and derive the ADC 2 parameter in Section 3. The principle of selecting auxiliary channels is presented in Section 4. The contrastive simulations and performance analysis are provided in Section 5. Finally, we conclude this paper in Section 6.

2 Signal mode and reduced-dimension processor

2.1 Detection performance of airborne radar

In airborne radar system travelling at velocity v p , let us suppose the antenna array has a side-looking uniform linear arrays, consisting of N-spaced antennas and transmits M pulses in one coherent processing interval. Under the signal absence hypothesis H 0 and signal presence hypothesis H 1, the N M×1 received signal x can be expressed as
$$ \begin{array}{l} {H_{0}}:\mathbf{x} = \mathbf{c} + \mathbf{n}\\ {H_{1}}:\mathbf{x} = \alpha \mathbf{s} + \mathbf{c} + \mathbf{n}, \end{array} $$
(1)
where c+n denotes the interference matrix which is composed of clutter and noise components, respectively, and has a complex Gaussian distribution with zero mean and covariance matrix R. s is the target space-time steering vector with an unknown complex amplitude α
$$ \mathbf{s}=\mathbf{s}_{d}\otimes\mathbf{s}_{s}, $$
(2)
where denotes the Kronecker product and s d and s s are the temporal steering vector and spatial steering vector, respectively. The adaptive matched filter (AMF) [20] detector under the assumption is given by
$$ \frac{\left | \mathbf{s}^{H}\mathbf{R}^{-1}\mathbf{x} \right |^{2}}{\mathbf{s}^{H}\mathbf{R}^{-1}\mathbf{s}} \underset{{H_{0}}}{\overset{{H_{1}}}{{~\!\!}_{<}^{>}}} \tau, $$
(3)
where τ is the threshold with a constant false alarm probability. According to [21], the probability distribution of detection statistic is chi-square distribution
$$ \begin{array}{l} T_{s}\left| {{H_{0}} \sim \frac{1}{2}} {\chi_{2}^{2}}\right.\\ T_{s}\left| {{H_{1}}} \right. \sim \frac{1}{2}{\chi_{2}^{2}}\left({2{{\left| \alpha \right|}^{2}}{\mathbf{s}^{H}}{\mathbf{R}^{- 1}}\mathbf{s}} \right), \end{array} $$
(4)

where \({\chi _{2}^{2}} \) denotes the chi-square distribution whose DOF is 2. In case of target present, the non-centrality parameter is 2|α|2 s H R −1 s. Note that the detection probability is a monotone-increasing function of the non-centrality parameter. In case of target present, a method for comparing detection performance of radar systems is proposed by evaluating its non-centrality parameter. As a consequence, we can draw a conclusion that maximizing the parameter \({\left | \alpha \right |^{2}}\mathbf {s}_{}^{H}\mathbf {R}_{}^{- 1}{\mathbf {s}_{}}\) leads to better detection performance.

2.2 RD STAP processor

According to the RD STAP algorithm, the received signal after matched filtering should be transformed to the angle-Doppler domain firstly; the transform vector of the nth angular channel and the mth Doppler channel is
$$ \begin{aligned} \mathbf{T}(m,n) = \ & {\mathbf{s}_{d}}\left(f_{dm}\right) \otimes {\mathbf{s}_{s}}\left(f_{sn} \right),n \in \left\{ 0,1, \cdots,\right.\\ &\left.\times N - 1 \right\},m \in \left\{ {0,1, \cdots,M - 1} \right\}, \end{aligned} $$
(5)
where \( \mathbf {T}(m,n)\in {\mathbb {C}^{NM \times 1}}\) represents the m N+nth column of the transform matrix T. We define f dt and f st as the spatial frequency and Doppler frequency of the target. s d (f dm ) is the temporal steering vector with the Doppler frequency f dm =f dt +m/M, and s s (f sn ) is the spatial steering vector with the spatial frequency f sn =f st +n/N respectively.
$$ \begin{array}{l} {\mathbf{s}_{d}}\left({{f_{dm}}} \right) = {\left[ {1,{e^{j2\pi {f_{dm}}}}, \cdots,{e^{j2\pi (M - 1){f_{dm}}}}} \right]^{T}}\\ {\mathbf{s}_{s}}\left({{f_{sn}}} \right)\; = {\left[ {1,{e^{j2\pi {f_{sn}}}}, \cdots,{e^{j2\pi (N - 1){f_{sn}}}}} \right]^{T}}, \end{array} $$
(6)
so that each angular-Doppler channel which corresponds to the steering vector above will be used to form each column of the transform matrix T, and the first column of T corresponds to the detected channel which can be written as follows:
$$ \mathbf{T}\left({0,0} \right) = {\mathbf{s}_{d}}\left({{f_{d0}}} \right) \otimes {\mathbf{s}_{s}}\left({{f_{s0}}} \right) $$
(7)

and is set as the main channel, while all other angular-Doppler channels are used to construct other columns of T. In the practical application, the main channel is used for detecting target signals embedded in the interference, and the auxiliary channels receive the interference and are correlated to those in the main channel. Assume that the dimension of receiving data after dimension reduced is D; thus, the transform matrix can be formed by arranging the main channel followed by D−1 auxiliary channels.

Consequently, many RD approaches are provided to select only few channels to achieve a good detection performance. The difference among RD STAP algorithms is that different column sets of T are selected. For the JDL approaches [8], the auxiliary channels are selected around the detection channel as a localized processing region, which has different sizes such as 3×3, 5×3, or other else. One kind of the STMB approach [9] selects auxiliary channels near the detected one in four different directions. These two modes of eight auxiliary channels are illustrated in Fig. 1. It is easy to see that the transform matrix of the two approach have the same dimension. However, a fixed sets of RD channels is not optimal in practice. Hence, we have to seek a new approach which not only selects auxiliary channels adaptively but also achieves better performance with dimension as lower as possible.
Fig. 1

Mode of nine angular-Doppler channels

3 Angle-Doppler correlation coefficient based on CCM estimation in the transform domain

3.1 A prior mode of CCM

Suppose that all components of received signal x are mutually uncorrelated. The CCM of one range cell is the sum of the clutter and noise covariance matrices
$$ {\mathbf{R}_{}} = E\left[ {\left({\textbf{c} + \mathbf{n}} \right){{\left({\mathbf{c} + \mathbf{n}} \right)}^{H}}} \right] = {\mathbf{R}_{c}} + {\sigma_{n}^{2}}{\mathbf{I}_{NM}}, $$
(8)
where \({\sigma _{n}^{2}}\) is the noise power, \({\textbf {R}_{c}}\in {\mathbb {C}^{NM \times NM}}\) represents the clutter covariance matrix whose clutter rank is estimated to be [22]
$$ {N_{r}} = \left \lceil N+\gamma\left (M-1 \right) \right \rceil. $$
(9)
Note that rounds up to the next integer. The clutter energy is concentrated about a line on the normalized space-time plane with the slope γ=2v p T r /d, where d is the inner space of antennas and T r is the pulse repetition interval. Through eigen decomposition, the clutter covariance matrix can be expressed in terms of its eigenvalues and eigenvectors as follows:
$$ {\mathbf{R}_{c}} = \sum\limits_{j = 1}^{{N_{r}}} {{\lambda_{j}}{\mathbf{e}_{j}}} \mathbf{e}_{j}^{H}, $$
(10)
where λ j and e j are the jth eigenvalue and the corresponding eigenvector of R c . However, it is not applicable in practice for the reason that the estimation of clutter eigenvectors requires training data to make eigen decomposition and is computationally complex. For the clutter intensity heavy enough, the Fourier basis is also defined in [23] to span the clutter subspace and can be used to construct CCM offline, whose number is approximate to the clutter rank
$$ {\mathbf{R}_{c}} = \sum\limits_{i = 1}^{{N_{r}}} {{\varepsilon_{i}^{2}}{\mathbf{v}_{i}}} \mathbf{v}_{i}^{H} = {\mathbf{V}_{I}}{{\mathbf\Sigma}_{I} }\mathbf{V}_{I}^{H}, $$
(11)

where v i is called the Fourier basis with voltage coefficients ε i , composes the Fourier matrix \({\mathbf {V}_{I}} = \left [ {{\textbf {v}_{1}},{\textbf {v}_{2}}, \cdots,{\textbf {v}_{{N_{r}}}}} \right ]\in {\mathbb {C}^{NM \times N_{r}}}\), and arranges each power coefficient into a diagonal matrix \({\mathbf {\Sigma }_{I}} = \text {diag}\left ({{\varepsilon _{1}^{2}},{\varepsilon _{2}^{2}}, \cdots,\varepsilon _{{N_{r}}}^{2}} \right)\). Therefore, the clutter subspace can be spanned by either clutter basis vectors or eigenvectors; each eigenvector can be obtained by a linear combination of Fourier basis, i.e., \({\textbf {e}_{j}} = \sum \limits _{i = 1}^{{N_{r}}} {{\eta _{i}^{j}}{\textbf {v}_{i}}}\).

In order to construct the CCM offline, we can estimate the Fourier basis instead of eigen decomposition. Based on the known angle of flight and antenna, the trajectory of the clutter spectrum can be deduced. For a side-looking array, the clutter ridge is a straight line which concentrates most of the clutter energy, and the Brennans rule [24] implies that there are at most N r clutter eigenvalues larger than the noise floor. An approximate set of Fourier basis of clutter subspace is given as follows:
$$ {\mathbf{v}_{i}} = {e^{j2\pi \mathbf{m}{f_{d}^{i}}}} \otimes {e^{j2\pi \textbf{n}{f_{s}^{i}}}},i = 1,2, \cdots,{N_{r}}, $$
(12)

where the Doppler frequency and spatial frequency of each Fourier basis are \({f_{d}^{i}} = \frac {{4{v_{p}}{T_{r}}}}{\lambda } \cdot \frac {i}{{{N_{r}}}},{f_{s}^{i}} = \frac {{2d}}{\lambda } \cdot \frac {i}{{{N_{r}}}}\) by dividing the clutter spectrum into N r basis averagely.

Assume that the received data in the cell under test is x with target absent, which can be written using the Fourier basis as
$$ \mathbf{x} = \sum\limits_{i = 1}^{{N_{r}}} {{\varepsilon_{i}}{\mathbf{v}_{i}}} + \mathbf{n} = {\mathbf{V}_{I}}{\mathbf{\varepsilon }_{I}} + \mathbf{n}. $$
(13)
Given the collection of space-time Fourier basis, then the major objective is to estimate the voltage of each Fourier basis. A least squares estimate of ε I satisfies [25]
$$ \mathop {\min }\limits_{{\mathbf{\varepsilon }_{I}}} \left\| {{\mathbf{x}_{}} - {\mathbf{V}_{I}}{\mathbf{\varepsilon }_{I}}} \right\|_{2}^{2}, $$
(14)

where \({\mathbf {\varepsilon }_{I}} = {\left [ {{\varepsilon _{1}},{\varepsilon _{2}}, \cdots,{\varepsilon _{{N_{r}}}}} \right ]^{T}}\) is a vector composed by complex scalars. As a consequence, the set of the clutter Fourier basis is achieved and receiving data is required. In the sample deficient case, the proposed method provides a more effective approach for CCM estimating, using the a priori knowledge of the clutter basis. In some practical scenarios, V I should be represented by eigenvectors through decomposition, because the characterization of clutter subspace and clutter rank may be inaccurate. Therefore, the proposed representation of CCM is applicative especially under the condition of few samples, which leads to a more accurate selection of RD channels.

3.2 Angle-Doppler correlation coefficient

The RD processing which can transform the radar received data x by a subset of the transform matrix defined in Eq. 5 yields a vector \({\mathbf {x}_{T}} = {\mathbf {T}_{D}^{H}}\textbf {x}\in {\mathbb {C}^{D\times 1}}\) in the transform domain where \(\mathbf {T}_{D}\in {\mathbb {C}^{NM \times D}}\) denotes the matrix composed by D selected columns of T. Similarly, the CCM in the transform domain can be expressed as follows:
$$ {\mathbf{R}_{T}} = {\mathbf{T}_{D}^{H}}\mathbf{R}\mathbf{T}_{D}. $$
(15)
Substituting Eqs. 8 and 11 into Eq. 15, it has
$$ \begin{aligned} {}{\mathbf{R}_{T}} \,=\, {\mathbf{T}_{D}^{H}}\left(\sum\limits_{i = 1}^{{N_{r}}} {{\varepsilon_{i}^{2}}{\mathbf{v}_{i}}\mathbf{v}_{i}^{H}} \,+\, {\sigma_{n}^{2}}\mathbf{I}\right)\!\mathbf{T}_{D}\,=\,\left({\mathbf{T}_{D}^{H}}{\mathbf{V}_{I}}\right){\mathbf{\Sigma }_{I}}{\left({\mathbf{T}_{D}^{H}}\mathbf{V}_{I}^{}\right)^{H}} \,+\, {\sigma_{n}^{2}}{\mathbf{T}_{D}^{H}}\mathbf{T}_{D}. \end{aligned} $$
(16)
The columns of T D are orthogonal to each other and have the effect of concentrating energy. Assume that the RD matrix consists of D columns, by replacing \({\mathbf {T}_{D}^{H}}\mathbf {T}_{D}\) in (16) with N M I D , we can derive
$$ {}{\mathbf{R}_{T}} = {\mathbf{V}_{T}}{\mathbf{\Sigma }_{I}}\mathbf{V}_{T}^{H} + NM{\sigma_{n}^{2}}{\mathbf{I}_{D}} = {\mathbf{V}_{T}}{\mathbf{\Sigma }_{I}}\mathbf{V}_{T}^{H} + {\sigma_{T}^{2}}{\mathbf{I}_{D}\in{\mathbb{C}^{D\times D}}}, $$
(17)
where \({\mathbf {V}_{T}} = {\mathbf {T}_{D}^{H}}{\mathbf {V}_{I}}\in {\mathbb {C}^{D \times N_{r}}}\)denotes the clutter Fourier basis matrix in the transform domain and \({\sigma _{T}^{2}} = NM{\sigma _{n}^{2}}\) is the noise power with a gain of NM by RD processing. The matrix inversion lemma yields
$$ \begin{array}{l} \mathbf{R}_{T}^{- 1} = \frac{1}{{{\sigma_{T}^{2}}}}\left({\mathbf{I}_{D}} - {\mathbf{V}_{T}}{\left({\sigma_{T}^{2}}\mathbf{\Sigma }_{I}^{- 1} + \mathbf{V}_{T}^{H}{\mathbf{V}_{T}}\right)^{- 1}}\mathbf{V}_{T}^{H}\right)\\ \;\;\;\;\;\;\;\; = \frac{1}{{{\sigma_{T}^{2}}}}\left({\mathbf{I}_{D}} - {\mathbf{V}_{T}}{\left({\mathbf{\Phi }_{I}} + \mathbf{V}_{T}^{H}{\mathbf{V}_{T}}\right)^{- 1}}\mathbf{V}_{T}^{H}\right), \end{array} $$
(18)

where \({\mathbf {\Phi }_{I}} = {\sigma _{T}^{2}}\mathbf {\Sigma }_{I}^{- 1} = NM{\sigma _{n}^{2}}\text {diag} \Big ({1/{{\varepsilon _{1}^{2}}}},{1 / {{\varepsilon _{2}^{2}}}}, \cdots, {1/ {\varepsilon _{{N_{r}}}^{2}}} \Big)\) arranged by the ratio of concentrated noise power to each power of Fourier basis.

As discussed in Section 2, the detection performance is directly related to the parameter \({\left | \alpha \right |^{2}}\mathbf {s}_{}^{H}\mathbf {R}_{}^{- 1}{\mathbf {s}_{}}\). In the domain of RD transformation, the desired signal and CCM have been dimension reduced, which has the following form:

$$ {}{\left| \alpha \right|^{2}}\mathbf{s}_{T}^{H}\mathbf{R}_{T}^{- 1}{\mathbf{s}_{T}} = \frac{{{{\left| \alpha \right|}^{2}}}}{{{\sigma_{T}^{2}}}}\mathbf{s}_{T}^{H}\left({{\mathbf{I}_{D}} - {\mathbf{V}_{T}}{{\left({\mathbf{\Phi }_{I}} + \mathbf{V}_{T}^{H}{\mathbf{V}_{T}}\right)}^{- 1}}\mathbf{V}_{T}^{H}} \right){\mathbf{s}_{T}}, $$
(19)

where \({\mathbf {s}_{T}} = {\mathbf {T}_{D}^{H}}\mathbf {s}\in {\mathbb {C}^{D \times 1}}\) is the desired signal steering vector in the transform domain and \(\text {SNR} = {{{{\left | \alpha \right |}^{2}}} / {{\sigma _{n}^{2}}}}\). It can be inferred from Eq. 19 that the detection performance depends on two factors: the signal-to-noise ratio and the following term:

$$ a = \mathbf{s}_{T}^{H}\left({{\mathbf{I}_{D}} - {\mathbf{V}_{T}}{{({\mathbf{\Phi }_{I}} + \mathbf{V}_{T}^{H}{\mathbf{V}_{T}})}^{- 1}}\mathbf{V}_{T}^{H}} \right){\mathbf{s}_{T}} $$
(20)

Since the number of auxiliary channels is fixed, the optimal performance can be achieved by changing the form of s T and V T to maximize the ADC 2, i.e., selecting the appropriate auxiliary channels.

However, the expression given in Eq. 20 is not in a convenient form for auxiliary channel selection; a concise formula in terms of matrix determinants is derived as follows:

The middle term in Eq. 20 is denoted with G T and is expressed as:
$$ {\mathbf{G}_{T}} = \mathbf{V}_{T}^{H}{\mathbf{V}_{T}} + {\mathbf{\Phi }_{I}} $$
(21)

By embedding the desired signal in the clutter-plus-noise cross-correlation matrix, \(\mathbf {G}_{T}\in {\mathbb {C}^{N_{r}\times N_{r}}}\) in the transform domain yields

$$ {\mathbf{G}_{sT}} = \left[ {\begin{array}{*{20}{c}} {{r_{\text{ss}}}}&{\mathbf{s}_{T}^{H}{\mathbf{V}_{T}}}\\ {\mathbf{V}_{T}^{H}{\mathbf{s}_{T}}}&{{\mathbf{G}_{T}}} \end{array}} \right] $$
(22)
where \({r_{\text {ss}}} = \mathbf {s}_{T}^{H}{\mathbf {s}_{T}}= {\left ({NM} \right)^{2}}\) denotes the self-correlation of the desired signal in the transform domain. Furthermore, due to the fact that T T H =N M I NM , utilizing the determinant of block matrix results in
$$ \begin{aligned} {} \left| {{\mathbf{G}_{sT}}} \right| =\! \left| {{\mathbf{G}_{T}}} \right|\left({{r_{\text{ss}}} \,-\, \mathbf{s}_{T}^{H}{\mathbf{V}_{T}}\mathbf{G}_{T}^{- 1}\mathbf{V}_{T}^{H}{\mathbf{s}_{T}}} \right) = {r_{\text{ss}}}\left| {{\mathbf{G}_{T}} - \frac{1}{{{r_{\text{ss}}}}}\mathbf{V}_{T}^{H}{\mathbf{s}_{T}}\mathbf{s}_{T}^{H}{\mathbf{V}_{T}}} \right|. \end{aligned} $$
(23)
It is evident that
$$ {}\mathbf{s}_{T}^{H}{\mathbf{V}_{T}}{\left({{\mathbf{\Phi }_{I}} \,+\, \mathbf{V}_{T}^{H}{\mathbf{V}_{T}}} \right)^{\! - 1}}\mathbf{V}_{T}^{H}{\mathbf{s}_{T}} \,=\, \mathbf{s}_{T}^{H}{\mathbf{V}_{T}}\mathbf{G}_{T}^{- 1}\mathbf{V}_{T}^{H}{\mathbf{s}_{T}} \,=\, {r_{\text{ss}}} - \frac{{\left| {{\mathbf{G}_{sT}}} \right|}}{{\left| {{\mathbf{G}_{T}}} \right|}}. $$
(24)

Substituting Eq. 24 into Eq. 20, the ADC 2 can be simplified as

$$ a = \frac{{\left| {{\mathbf{G}_{sT}}} \right|}}{{\left| {{\mathbf{G}_{T}}} \right|}} $$
(25)

It will be shown that the more DOF exists, the more computing times is necessary for calculating the ADC 2.

From the analysis above, the detection performance can be expressed as a function of RD matrix which is decided by the selected auxiliary channels. In the next section, an approach for finding the most appropriate auxiliary channels is provided, utilizing the ADC 2.

4 The best channels in the transform domain

4.1 The flow of selecting the best channels

As discussed already, different RD matrix corresponds to a different output of ADC 2, the main goal of maximizing the ADC 2 is to achieve the optimum RD matrix. However, we cannot select the best angular-Doppler channels at one time, for the reason that there are so many combinations of auxiliary channels which are used to compose the RD matrix T.

Therefore, we select the best channels step by step. First of all, only the desired signal is already known to set as the main channel, that is set as s. Assume that the current number of selected optimal channels is d, naturally, there are d−1 auxiliary channels. We denote a d (m,n) as the dth ADC 2 corresponding to each angular-Doppler channel to evaluate the effect of clutter cancellation and can be represented as
$$ \begin{aligned} {}{a_{d}}(m,n) \,=\, {\left({NM} \right)^{2}}{{\left| {\mathbf{G}_{T}^{(d)} -\! {{\left({\frac{1}{{NM}}} \right)}^{2}}{{\left({\mathbf{V}_{T}^{(d)}} \right)}^{H}}\mathbf{s}_{T}^{(d)}{{\left({\mathbf{s}_{T}^{(d)}} \right)}^{H}}\mathbf{V}_{T}^{(d)}} \right|} / {\left| {\mathbf{G}_{T}^{(d)}} \right|}} \end{aligned} $$
(26)
which could be inferred from Section 3 with the fact that
$$ \begin{array}{l} \mathbf{V}_{T}^{(d)}\left({m,n} \right) = \mathbf{T}_{d}^{H}(m,n){\mathbf{V}_{I}},\mathbf{s}_{T}^{(d)}\left({m,n} \right) = \mathbf{T}_{d}^{H}\left({m,n} \right)\mathbf{s}\\ \mathbf{G}_{T}^{(d)}\left({m,n} \right) = {\left({\mathbf{V}_{T}^{(d)}\left({m,n} \right)} \right)^{H}}\mathbf{V}_{T}^{(d)}\left({m,n} \right) + {\mathbf{\Phi }_{I}}, \end{array} $$
(27)
where \(\mathbf {T}_{d}^{}(m,n)\) is the transform matrix of dth step composed by the matrix T d−1 derived from the former d−1 steps. Before the selection of the next auxiliary channel, the influence of the current RD channels should be considered through updating the RD matrix, and then selecting the next optimal channel by evaluating each transform vector s d (f dm )s s (f sn ) that corresponds to each angular and Doppler frequency, which has the form
$$ {\mathbf{T}_{d}}(m,n) = \left[ {{\mathbf{T}_{d - 1}},{\mathbf{s}_{d}}\left({{f_{dm}}} \right) \otimes {\mathbf{s}_{s}}\left({{f_{sn}}} \right)} \right]\in{\mathbb{C}^{NM \times d}}. $$
(28)

Note that the first transform vector corresponds to the desired signal, i.e., T 1=s. Then, we select the channel with maximum a d (m,n) as the current optimal channel, so that the transform matrix of dth step is achieved and denoted by T d . For adding the effect of the former selected channels, the ADC 2 should be updated until the optimal channel selection progress is finished.

After the RD matrix T d with D auxiliary channels has been achieved, the transformation of the received signal x by the operation T d defined in Eq. 5 yields a lower dimensional vector x T . The CCM in the transform domain can be obtained by 15; therefore, the weight vector in the transform domain is given by
$$ {\mathbf{w}_{T}} = \mu \mathbf{R}_{T}^{- 1}{\mathbf{s}_{T}}, $$
(29)

where \(\mu ={\left ({{\mathbf {s}_{T}}\mathbf {R}_{T}^{- 1}{\mathbf {s}_{T}}} \right)^{- 1}}\) is a non-zero constant that does not affect the output SINR.

Comparing the proposed methods with MSMB presented in [14], both of them select auxiliary channels adaptively in the RD STAP. We summarise the computational complexities (Fig. 2) of the step that selects the dth channel: for MSMB, the computational complexity is about
$$ O\left({{J^{4}} + {J^{3}} + (d + 1)\left({J^{2}} + Jd + {d^{2}}\right)} \right), $$
(30)
Fig. 2

Comparison of computational complexity between two adaptive RD methods

where J=N M is the dimension of received data, and there exists a time-consuming eigen decomposition of MSMB at the beginning of this algorithm. While the computational complexity of the proposed method is
$$ O\left({J\left({N_{r}^{3}}+N_{r}d^{2}+{N_{r}^{2}}d\right)+J^{2}(N_{r}+1)} \right). $$
(31)

We can see that the proposed method is calculated much easier than MSMB. However, because of the increased step of channel selection, the computational complexity of the proposed method is higher than the RD STAP of fixed channels, but better performance is achieved.

4.2 Prediction for the possible location of auxiliary channels

According to the generalized sidelobe canceler, the principle of RD STAP can be treated as a process that cancels the interference components in the main channel by a weighted summation of the interference components in auxiliary channels, which can be expressed as
$$ {\mathbf{x}_{T}} = \mathbf{T}_{D}^{H}\mathbf{x} = {\left[ {\mathbf{s},{\mathbf{T}_{D - 1}}} \right]^{H}}\mathbf{x}\in{\mathbb{C}^{D \times NM}} $$
(32)
All the columns of T D−1 correspond to the orthogonal channels which are orthogonal to the desired signal, i.e., \(\mathbf {T}_{D - 1}^{H}\mathbf {s} = {\mathbf {0}}\). In order to facilitate the analysis, assume that only one clutter Fourier basis with voltage is taken into consideration, the vectors of the signal and clutter components in the transform domain, respectively, are
$$ {\mathbf{s}_{T}} = \left[ {\begin{array}{*{20}{c}} {{\mathbf{s}^{H}}}\\ {\mathbf{T}_{D - 1}^{H}} \end{array}} \right]\mathbf{s} = \left({\begin{array}{*{20}{c}} {{\alpha_{0}}}\\ \mathbf{\alpha } \end{array}} \right),{\mathbf{v}_{T}} = \left[ {\begin{array}{*{20}{c}} {{\mathbf{s}^{H}}}\\ {\mathbf{T}_{D - 1}^{H}} \end{array}} \right]\mathbf{v} = \left({\begin{array}{*{20}{c}} {{\beta_{0}}}\\ \mathbf{\beta } \end{array}} \right), $$
(33)
where α 0=N M, \(\mathbf {\alpha } = \mathbf {T}_{D - 1}^{H}\mathbf {s} = {\mathbf {0}}\), β 0=s H v is already known due to the prior estimation of clutter basis, and \(\mathbf {\beta } = \mathbf {T}_{D - 1}^{H}\mathbf {v}\in {\mathbb {C}^{(D-1)\times N_{r}}}\) depends on the closeness of clutter basis and the selected channels. Substituting Eq. 32 into Eq. 20, the expression of ADC 2 can be written as
$$ \begin{aligned} {}a &= \left({\alpha_{0}^{*}\;{\mathbf{\alpha }^{H}}} \right)\left[ {{\mathbf{I}_{D}} \,-\, \left({\begin{array}{*{20}{c}} {{\beta_{0}}}\\ \mathbf{\beta } \end{array}} \right){{\left({\Phi \,+\, \left({\beta_{0}^{*}\;{\mathbf{\beta }^{H}}} \right)\left({\begin{array}{*{20}{c}} {{\beta_{0}}}\\ \mathbf{\beta } \end{array}} \right)} \right)}^{- 1}}\left(\!{\beta_{0}^{*}\;{\mathbf{\beta }^{H}}} \right)} \right]\left({\begin{array}{*{20}{c}} {{\alpha_{0}}}\\ \mathbf{\alpha } \end{array}} \right)\\ \;\;\; {}&= \left({\alpha_{0}^{*}\;{\mathbf{\alpha }^{H}}} \right)\left[ {{\mathbf{I}_{D}} - \frac{1}{{\Phi + {\beta_{0}^{2}} + {\mathbf{\beta }^{H}}\mathbf{\beta }}}\left({\begin{array}{*{20}{c}} {{\beta_{0}^{2}}}&{{\beta_{0}}{\mathbf{\beta }^{H}}}\\ {\mathbf{\beta }\beta_{0}^{*}}&{\mathbf{\beta }{\mathbf{\beta }^{H}}} \end{array}} \right)} \right]\left({\begin{array}{*{20}{c}} {{\alpha_{0}}}\\ \mathbf{\alpha } \end{array}} \right)\\ \;\;\; {}&= {\alpha_{0}^{2}} - \frac{{{\alpha_{0}^{2}}{\beta_{0}^{2}}}}{{\Phi + {\beta_{0}^{2}} + {\mathbf{\beta }^{H}}\mathbf{\beta }}} = \frac{{{\alpha_{0}^{2}}\left({\Phi + {\mathbf{\beta }^{H}}\mathbf{\beta }} \right)}}{{\Phi + {\beta_{0}^{2}} + {\mathbf{\beta }^{H}}\mathbf{\beta }}}, \end{aligned} $$
(34)

where \(\Phi = NM{{{\sigma _{n}^{2}}} / {{\varepsilon ^{2}}}}\) is scalar. From the last row of Eq. 34, we can infer that the ADC 2 is directly proportional to β H β and inversely proportional to β 0, which means that the inner product of β plays a driving role to the detection performance. Furthermore, we can draw a conclusion that the more transform vectors similar to clutter basis are, and the better detection performance is achieved. This further demonstrates the conclusion in [10], and a more reasonable explanation and flexible method of channel selection is proposed.

In addition, the power of β 0 plays a blocking effect on the detection performance, which is easy to understand by slow-moving target detection: when the radial velocity of target is low, the clutter power becomes bigger because the target gets closer to the clutter ridge and then leads to a larger power of β 0. So that the correctness of ADC 2 can be further proved.

5 Simulations

In this section, we illustrate the validity of the effectiveness of the proposed method by presenting the simulation results. The basic parameters used in the following simulations are listed in Table 1. It is assumed that the receiving noise after matched filtering is Gaussian white noise whose power is calculated according to the thermal noise. In all simulations, we assume that the target is in broadside, that is, it has an azimuth of 0.
Table 1

Basic radar system parameters

Symbol

Description

Value

N

Number of antenna elements

16

M

Number of pulses

16

f c

Carrier frequency

1200 MHz

f r

Pulse repetition frequency

2400 Hz

d

Space between antenna elements

0.5 m

v p

Radar platform velocity

150 m/s

H

Platform altitude

5000 m

R

Detection range

100 km

CNR

Clutter-to-noise ratio

50 dB

Firstly, we describe the calculation ratio of the proposed method to MSMB [11, 12] as a function of the number of RD channels, using the formula provided in Eqs. 30 and 31. It is obvious that the proposed method has less complexity, especially in the scenario that RD channels is less and further confirms that the proposed method is more applicable in the sample deficient cases.

Figure 3 shows the SINR performance of the three RD STAP methods, the JDL3×3 approach, STMB approach, and the proposed approach, respectively. The normalized Doppler frequency sweeps over the range [−0.5,0.5], and the best channels are calculated at each frequency point. It is clear to see that the proposed RD approach shows better capability of suppressing clutter than the other two, even if they have the same dimension of RD matrix. In detail, they exhibit similar performance when the velocity of target is low, but the proposed approach generates better SINR output compared to the two stationary RD approaches when the target is away from the clutter ridge. Under the condition that there is no target ambiguity in Doppler, we can infer that a larger performance gap will be generated when the velocity of target becomes larger.
Fig. 3

Output SINR loss of each RD method

In the second experiment, we evaluate the performance of the proposed approach for different numbers of auxiliary channels, which is a partial enlarged picture exhibited in Fig. 4. We can conclude that the proposed method has a slight output SINR improvement as the number of auxiliary channels increases. By detailed observation, the proposed approach with only one auxiliary channel can achieve a SINR loss about less than 3 dB, and a little performance improvement is achieved for eight auxiliary channels compared with three auxiliary channels. As a result, an excellent performance can be achieved by using only few channels to cancel the interference, then computational amount and the secondary data used to estimate the CCM can be decreased.
Fig. 4

Output SINR loss of the proposed method with different numbers of auxiliary channels

We illustrate the relationship between the output SINR loss and the number of freedom with a fixed testing Doppler channel 4, i.e., the normalized Doppler frequency is 3/16. The results, shown in Fig. 5, compare the proposed method with the RR approach such as PC inverse algorithm [9], the cross-spectral metric algorithm (CSM) [10], and the multistage Wiener filter algorithm (MSWF) [11], as a function of Wiener filter order (adaptive DOF). One can see that the PC and CSM approaches have poorer convergence property to the optimal SINR and lower SINR while the MSWF has better convergence performance, and the proposed approach has the fastest convergence rate. On the other hand, in the case that the DOF is low, that is, only few auxiliary channels are selected, the output SINR of the proposed approach is less than 3 dB, while the other approaches cannot achieve the same performance and result in poorer clutter suppression. Only when the DOF of the MSWF, CSM, and PC reaches 11, 20, and 31, respectively, can they achieve the same performance as the proposed approach, while the proposed approach exhibits good performance with no restriction on DOF. Therefore, it is certain that the proposed approach produces a desirable detection performance and less amount of calculation.
Fig. 5

Output SINR loss of RD processors as a function of number of freedom for testing Doppler channel 4

Last but not the least, the location of the four best channels are shown in Fig. 6, where the solid circles correspond to the RD channels and the diagonal denote the clutter ridge. The serial number of auxiliary channels is labeled according to the rules as follows: N(m−1)+n−1 denotes the mth Doppler channel and the nth angular channel, and the smaller number of n and m means the channel is closer to the frequency of 0, both in the angular and Doppler domains. It can be seen that the auxiliary channels are mainly distributed in the area around the mainlobe and sidelobe, which have the same Doppler frequency or the same angle with the target. Hence, the conclusion derived before can be verified.
Fig. 6

The four best channels for testing Doppler channel 4

6 Conclusions

Reduced-dimension STAP is frequently employed in airborne radar systems to detect moving targets in the presence of fixed clutter, which is widely used in practical engineering application. In this paper, we proposed a novel RD STAP methodology. A parameter named ADC 2 is formulated to characterize the non-centrality parameter of AMF detector which has a direct impact on detection performance. Through estimating the Fourier basis offline, we select the auxiliary channels in the field of angular-Doppler corresponding to the largest value of ADC 2, so that the upper bound of performance will be achieved when the DOF is fixed. The performance of the proposed strategy was validated by simulations, which exhibited its advantage on target detection performance compared with some other RD and RR approaches. Furthermore, the location of the best auxiliary channels in the transform domain is predicted and verified by the simulation results.

Declarations

Acknowledgements

The authors would like to thank the anonymous reviewers and the editors for the insightful comments and suggestions. This work was supported by the National Natural Science Foundation of China (no. 61371184 and no. 61401062).

Competing interests

The authors declare that they have no competing interests.

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Authors’ Affiliations

(1)
School of Electronic Engineering, University of Electronic Science and Technology of China (UESTC)

References

  1. LE Brennan, IS Reed, Theory of adaptive radar. IEEE Trans Aerosp Electron Syst. 9(2), 237–252 (1973).View ArticleGoogle Scholar
  2. R Klemm, Principles of space-time processing (IEE Press, London, 2002).Google Scholar
  3. IS Reed, JD Mallett, LE Brennan, Rapid convergence rate in adaptive arrays. IEEE Trans Aerospace Electron Syst. 10(6), 853–863 (1974).View ArticleGoogle Scholar
  4. P Douglas, O Gregory, Knowledge-aided STAP processing for ground-moving target indication radar using multilook data. EURASIP J Adv Signal Process, 1–16 (2006).Google Scholar
  5. H Li, Y Li, Z He, MIMO radar clutter mitigation based on joint beamforming and joint domain localized proecessing. EURASIP J Adv Signal Process, 1–10 (2013).Google Scholar
  6. S Chen, L Kong, J Yang, Adaptive clutter nulling approach for heterogeneous environments. Circuits, Systems, Signal Process. 34(3), 987–1000 (2015).View ArticleGoogle Scholar
  7. RC Dipieto, in Paper presented at the 25th Asilomar Conference,. Extend factored space-time processing technique for airborne radar (Pacific Grove, 1992), pp. 425–430.Google Scholar
  8. H Wang, L Cai, On adaptive spatial-temporal processing for airborne surveillance radar systems. IEEE Trans. Aerospace Electron. Syst. 30(3), 660–670 (1994).MathSciNetView ArticleGoogle Scholar
  9. Y Wang, J Chen, Z Bao, Y Peng, Robust space-time adaptive processing for airborne radar in nonhomogeneous clutter environments. IEEE Trans. Aerospace Electron. Syst. 39(1), 70–80 (2003).View ArticleGoogle Scholar
  10. C Luo, Z He, J Li, W Zhang, W Xia, A modified dimension-reduced space-time adaptive processing method. 2014 IEEE Radar Conference, 724–728 (2014).Google Scholar
  11. W Zhang, Z He, J Li, H Liu, Y Sun, A method for finding best channels in beam-space post-Doppler reduced-dimension STAP. IEEE Trans. Aerospace Electron. Syst. 50(1), 254–264 (2014).View ArticleGoogle Scholar
  12. W Zhang, Z He, J Li, H Liu, Multiple-input-multiple output radar multistage multiple-beam beamspace reduced-dimension space-time adaptive processing. IET Radar, Sonar Navigation. 7(3), 295–303 (2013).View ArticleGoogle Scholar
  13. IP Kirsteins, DW Tufts, Adaptive detection using a low rank approximation to a data matrix. IEEE Trans. Aerospace Electron. Syst. 30(1), 55–67 (1994).View ArticleMATHGoogle Scholar
  14. JS Goldstein, IS Reed, Reduced rank adaptive filtering. IEEE Trans. Signal Process. 45(2), 492–496 (1997).View ArticleGoogle Scholar
  15. JS Goldstein, IS Reed, LL Scharf, A multistage representation of the Wiener filter based on orthogonal projections. IEEE Trans. Inform. Theroy. 44(7), 2943–2959 (1998).MathSciNetView ArticleMATHGoogle Scholar
  16. JS Goldstein, IS Reed, PA Zulch, Multistage partially adaptive STAP CFAR detection algorithm. IEEE Trans. Aerospace Electron. Syst. 35(2), 645–661 (1999).View ArticleGoogle Scholar
  17. X Wang, E Aboutanios, M Amin, MG Amin, Reconfigurable adaptive array beamforming by array selection. IEEE Trans. Signal Process. 62(9), 2385–2396 (2014).MathSciNetView ArticleGoogle Scholar
  18. X Wang, E Aboutanios, M Amin, Reduced-rank STAP for slow-moving target detection by antenna-pulse selection. IEEE Signal Process. Lett. 22(8), 1156–1160 (2015).View ArticleGoogle Scholar
  19. X Wang, E Aboutanios, M Amin, Slow radar target detection in heterogeneous clutter using thinned STAP. IET Radar, Sonar Navigation. 10(4), 726–734 (2016).View ArticleGoogle Scholar
  20. FC Robey, DR Fuhrman, EJ Kelly, et al, A CFAR adaptive matched filter detector. IEEE Trans. Aerospace Electron. Syst. 28(1), 208–216 (1992).View ArticleGoogle Scholar
  21. TA Schonhaff, AA Giordeno, Detection and Estimation Theory and its applications (Prentice Hall, Upper Saddle River, 2006).Google Scholar
  22. J Ward, Space-time adaptive processing for airborne radar. Lincoln Laboratory Tech. Rept (1994).Google Scholar
  23. Y Wu, J Tang, Y Peng, On the essence of knowledge-aided clutter covariance estimate and its convergence. IEEE Trans. Aerospace Electron. Syst. 47(1), 569–585 (2011).View ArticleGoogle Scholar
  24. R Klemm, J Ender, in 1990 IEEE International Radar Conference. New aspects of airborne MTI, (1990), pp. 335–340.Google Scholar
  25. WL Melvin, GA Showman, An approach to knowledge-aided covariance estimation. IEEE Trans. Aerospace Electron. Syst. 42(3), 1021–1042 (2006).View ArticleGoogle Scholar

Copyright

© The Author(s) 2016