Slow-Time Code Design for Space-Time Adaptive Processing in Airborne Radar

Abstract

Space-time adaptive processing (STAP) techniques have been motivated as a key enabling technology for advanced airborne radar applications. In this paper, a slow-time code design is considered for the STAP technique in airborne radar, and the principle for improving signal-to-clutter and noise ratio (SCNR) based on slow-time coding is given. We present two algorithms for the optimization of transmitted codes under the energy constraint on a predefined area of spatial-frequency and Doppler-frequency plane. The proposed algorithms are constructed based on convex optimization (CVX) and alternating direction (AD), respectively. Several criteria regarding parameter selection are also given for the optimization process. Numerical examples show the feasibility and effectiveness of the proposed methods.

1. Introduction

Traditional space-time adaptive processing (STAP) involves multi-dimensional adaptive filtering which combines signals from several antenna elements and from multiple pulse repetitions to suppress clutter, interference, and noise in both space and time. It is well known that STAP improves detection performance of targets in both main lobe and side lobe clutter and in jamming interference environments. A great deal of attention has been given to STAP algorithms and much of the work has been done in the past three decades [1,2].

The signal design for radar performance improvement has been an active area of research in recent decades. However, the majority of previous works have considered pulse compression radar and clutter-free scenarios. For detecting a particular target in the presence of additive signal-dependent noise, waveform optimization theory, developed by Guerci [3,4,5], is evaluated in terms of the signal-to-interference-plus-noise ratio (SINR) under a particular model of the system, interference, clutter, and targets. The suboptimal solution of the phase-coded waveform for detecting a particular target in additive noise was proposed in [6]. For designing code for multiple-input multiple-output (MIMO) radar, [7] proposed average and worst-case performance metrics and several algorithms to solve highly nonconvex design problems.

It should be pointed out that waveform design problem for STAP has been discussed from the viewpoint of fast-time coding. In [8,9], waveform design and waveform scheduling problems in STAP for airborne radar are formulated with a cost function, and least-squared solutions for the designed waveform were obtained. In literature [10], the joint design of receive filter and waveform for the waveform adaptive radar STAP problem was solved by an alternating minimization algorithm. The STAP waveform design technique has also been applied to MIMO radar. Literature [11] improved the worst-case detection performance of STAP processing with a new diagonal loading (DL) based iterative approach. In [12,13], joint design problems of transmitting waveforms and the receiving filter were studied in terms of SCNR maximization and a manifold-based alternating optimization (MAO) method and an iterative algorithm based on the minorize-maximization (MM) technique were proposed respectively.

In this paper, slow-time coding for STAP for improving SCNR of STAP output is discussed. The rest of this work is organized as follows. Section 2 discusses the STAP model and derives the STAP filter and SCNR. Section 3 proposes two optimization methods for optimizing the output SCNR on average metric, i.e., CVX and AD. Section 4 demonstrates the proposed algorithms by extensive simulation experiments. Finally, concluding remarks and directions for future research are presented in Section 5.

In the following paragraphs the boldface upper case letters denote matrices; boldface lower-case letters denote column vectors, and italics denote scalars. $ℂ$ denotes the complex field. The superscripts ${(.)}^T$, ${(.)}^{\ast }$, and ${(.)}^H$ denote transpose, complex conjugate, and conjugate transpose, respectively. The symbol $\odot$ stands for the Hadamard (element-wise) product of matrices and $\otimes$ denotes the Kronecker product of matrices. $\mathrm{tr}(.)$ is the trace of a square matrix argument. $\mathrm{Diag}\left(.\right)$ denotes forming a diagonal matrix whose diagonal entries are formed by a vector, whereas diag(·) denotes the vector formed by collecting the diagonal entries of the matrix, E{·} stands for the statistical expectation operator, $\succcurlyeq$ is positive semidefinite, $\succ$ is positive-definite, and ${‖.‖}_F$ indicates the Frobenius norm.

2. STAP Model

The system under consideration is a pulsed Doppler radar residing on an airborne platform. The radar antenna is a uniformly spaced linear array antenna consisting of N elements. Radar returns are collected in a coherent processing interval (CPI), which is referred to as the 3-D radar data cube shown in Figure 1, where $K$ denotes the number of samples collected to cover the range interval. The data are then processed at one range of interest, which corresponds to a slice of the CPI data cube. This slice is a $M\times N$ matrix which consists of $N\times 1$ spatial snapshots for $M$pulses at the range of interest. It is convenient to stack the matrix column-wise to form the $NM\times 1$ vector $r_i$, termed the $i$ th range gate space-time snapshot, $1\le i\le K$.

The radar space-time snapshot is then expressed for each of the two hypotheses in the following form:

$$\left\{\begin{array}{c}{\mathrm{H}}_0 : r_i=c_i+n_i\\ {\mathrm{H}}_1 : r_i=\alpha s+c_i+n_i\end{array}\right.$$

(1)

where $\alpha$ is a zero-mean complex Gaussian random variable with variance ${\sigma }_s^2$, $s$ denotes the echo signal, and $c_i$ and $n_i$ are clutter and noise, respectively. These three components are assumed to be mutually uncorrelated.

The vector $s$ is the $NM\times 1$ normalized space-time steering vector in the space-time look-direction and defined as [1] (p. 16):

$$s=b_t \otimes a_t$$

(2)

where $b_t$ is the corresponding M-dimensional temporal steering vector given by:

$$b_t=[1 ,e^{j2\pi f_t}, \dots ,e^{j2\pi (M-1)f_t}{ ]}^T$$

(3)

and $a_t$ is the N-dimensional spatial steering vector and given by:

$$a_t=[1 ,e^{j2\pi {\theta }_t}, \dots ,e^{j2\pi (N-1){\theta }_t}{ ]}^T$$

(4)

We define $f_t={\omega }_t{T}_r$ as normalized Doppler frequency and ${\theta }_t=d\cos \phi \sin \varphi /\lambda$ as special frequency, where ${\omega }_t$ is target Doppler frequency, $T_r$ is pulse repetition interval, $d$ is interelement spacing, $\phi$ is elevation angle, $\varphi$ is azimuth angle, $\lambda$ is radar operating wavelength.

The clutter $c_{i }$ can be represented as

$$c_{i }={\displaystyle \sum _{l=1}^{N_c}{\xi }_l^c}b(f_l^c)\otimes a({\theta }_l^c)$$

(5)

where $N_c$ denotes the number of the clutter patches, ${\xi }_l^c$ is the power of reflected signal by the $l$th clutter patch. $a({\theta }_l^c)$ and $b(f_l^c)$, respectively, denote the spatial steering vector with the spatial frequency ${\theta }_l^c$ and the temporal steering vector with the normalized Doppler frequency $f_l^c$ for the $l$th clutter patch. Thus, the clutter covariance matrix can be expressed as

$$\mathbf{C}=\mathrm{E}\{c_i{c}_i^H\}={\displaystyle \sum _{l=1}^{N_c}{({\xi }_l^c)}^2}[b(f_l^c)b{(f_l^c)}^H]\otimes [a({\theta }_l^c)a{({\theta }_l^c)}^H]$$

(6)

The noise covariance matrix $\mathbf{M}= \mathrm{E}\left\{n_i{n}_i^H \right\}$ can be written as a scaled identity matrix ${\sigma }_n^2{\mathbf{I}}_{NM}$ where ${\sigma }_n^2$ is the noise power.

To detect the presence of targets, each range bin is processed by an adaptive 2D beam former (to achieve maximum output SINR) followed by a hypothesis test to determine the target presence or absence.

The optimum full-rank STAP filter obtained by an unconstrained optimization of the SCNR is given as follows [1] (p. 57):

$${\mathrm{w}}_{\mathrm{opt}}=\kappa {(\mathbf{C}+\mathbf{M})}^{-1}s$$

(7)

where $\kappa$ is a constant number. The corresponding optimum SCNR is given by [1] (p. 62):

$$\mathrm{SCNR}=s^{\mathrm{H}}{(\mathbf{C}+\mathbf{M})}^{-1}s$$

(8)

3. Slow-Time Code Design for STAP Radar

3.1. Problem Formulation

In this section, the radar system is considered to transmit a series of weighted pulse. Using Equation (1), the target detection problem can also be cast as the following binary hypothesis test

$$\left\{\begin{array}{c}{\mathrm{H}}_0 : r_i=c_i\odot \mathbf{p}+n_i\\ {\mathrm{H}}_1 : r_i=\alpha s \odot \mathbf{p}+c_i\odot \mathbf{p}+n_i\end{array}\right.$$

(9)

where $\mathbf{p}=a\otimes 1$, $a{=[\mathrm{a}}_0{ \mathrm{a}}_1 \dots { \mathrm{a}}_{\mathrm{M}-1}{]}^{\mathbf{T}}$ are the transmit weights that are to be optimally designed, and $1={\left[1 1 \dots 1\right]}^{\mathbf{T}}$. The performance of the optimum detector depends on the following SCNR

$$\mathrm{SCNR}=(s\odot \mathbf{p}{)}^H{(\mathbf{P}\mathbf{C}{\mathbf{P}}^H+\mathbf{M})}^{-1}(s \odot \mathbf{p})$$

(10)

where $\mathbf{P}=\mathrm{Diag}\left(\mathbf{p}\right)$.

Slow-time code design to improve the detection performance of the STAP system for a known target Doppler frequency shift $f_t$ and arrival angle ${\theta }_t$ can be accomplished by maximizing the following performance metric:

$$\begin{array}{ll}\mathrm{SCNR}& =({s\odot \mathbf{p}}^H)({\mathrm{PCP}}^H+{+\mathbf{M})}^{-1}(s \odot \mathbf{p})\\ & =\mathrm{tr}({\mathbf{P}}^H{(\mathrm{PCP}}^H{+\mathbf{M})}^{-1}{\mathrm{Pss}}^H)\\ & =\mathrm{tr}\{(({\mathbf{P}}^H\mathbf{M}\mathbf{P})-1{+\mathbf{C})}^{-1}{\mathrm{ss}}^H\}\end{array}$$

(11)

It can be noted that a phase-shift version of the code vector $\mathbf{p}$ will not alter the SCNR value and the detection performance will also not be improved.

In cases where the Doppler frequency shift and direction of arrival (DOA) of the interested target lie in a certain area, we consider the following design metric:

$$\mathrm{tr}\{{({({\mathbf{P}}^H\mathbf{M}\mathbf{P})}^{-1}+\mathbf{C})}^{-1}\mathbf{S}\}$$

(12)

where $\mathbf{S}=\mathrm{E}\{s{s}^H\}$. To optimize the detection performance for a STAP radar, the metric above can be maximized under an energy constraint:

$$\begin{array}{l}\underset{\mathbf{P}}{\max } \mathrm{tr}\{{({({\mathbf{P}}^H\mathbf{M}\mathbf{P})}^{-1}+\mathbf{C})}^{-1}\mathbf{S}\}\\ \mathrm{s}.\mathrm{t}. \mathrm{tr}(\mathbf{P}{\mathbf{P}}^H)=e\end{array}$$

(13)

where $e$ denotes the transmission energy.

3.2. Algorithm Based on Convex Optimization

Because of the objective function in problem (13) is highly nonconvex, this problem is difficult to tackle. In this section, the CVX algorithm is proposed based on semi definite programming (SDP) relaxation.

In order to reformulate this nonconvex problem as a convex problem, we introduce the auxiliary variable $\mathbf{X}\triangleq {\mathbf{P}}^H{\mathbf{M}}^{-1}\mathbf{P}$. We also set $\mathbf{S}=\mathbf{V}{\mathbf{V}}^H={\displaystyle {\sum }_{k=1}^{\delta }{v}_k}{v}_k^H$ and $\mathbf{C}=\mathbf{T}{\mathbf{T}}^H$ where $\delta =rank(\mathbf{S})$, $\mathbf{V}=[v_1 v_2\dots v_{\delta }]\in {ℂ}^{NM\times \delta }$,$\mathbf{T}\in {ℂ}^{NM\times NM}$. Using the matrix inversion lemma in [14], we have:

$$\mathrm{tr}({({\mathbf{X}}^{-1}+\mathbf{C})}^{-1}\mathbf{S})={\displaystyle {\sum }_{k=1}^{\delta }\{v_k^H\mathbf{X}{v}_k-v_k^H\mathbf{X}\mathbf{T}{(\mathbf{I}+{\mathbf{T}}^H\mathbf{X}\mathbf{T})}^{-1}{\mathbf{T}}^H\mathbf{X}{v}_k}\}$$

(14)

Using auxiliary variables $b_{k=1}^{\delta }$ and Schur complement theorem [15], the maximization of Equation (14) can be achieved by minimization of ${\displaystyle {\sum }_{k=1}^{\delta }{b}_k}$ with a constraint as follows:

$$b_k\ge -v_k^H\mathbf{X}{v}_k+v_k^H\mathbf{X}\mathbf{T}{(\mathbf{I}+{\mathbf{T}}^H\mathbf{X}\mathbf{T})}^{-1}{\mathbf{T}}^H\mathbf{X}{v}_k\iff \left[\begin{array}{cc}{b}_k+v_k^H\mathbf{X}{v}_k& v_k^H\mathbf{X}\mathbf{T}\\ {\mathbf{T}}^H\mathbf{X}{v}_k& \mathbf{I}+{\mathbf{T}}^H\mathbf{X}\mathbf{T}\end{array}\right]⪰0$$

(15)

Note that the energy constraint in problem Equation (13) with respect to $\mathbf{X}$ is $\mathrm{tr}(\mathbf{X}{({\mathbf{M}}^{-1}\odot \mathbf{I})}^{-1})\le e$ and observe that $\mathbf{X}\succ 0$. Then, the nonconvex problem of Equation (13) can be reformulated as a semi definite programming problem in a relaxed form:

$$\begin{array}{ll}\underset{\mathbf{X},\{b_{k=1}^{\delta }\}}{\min }\hspace{1em}\hspace{1em}& {\displaystyle {\sum }_{k=1}^{\delta }{b}_k}\\ \mathrm{s}.\mathrm{t}.\hspace{1em}\hspace{1em}& \left[\begin{array}{cc}{b}_k+v_k^H\mathbf{X}{v}_k& v_k^H\mathbf{X}\mathbf{T}\\ {\mathbf{T}}^H\mathbf{X}{v}_k& \mathbf{I}+{\mathbf{T}}^H\mathbf{X}\mathbf{T}\end{array}\right]⪰0,\forall k\\ & \mathbf{X}\succ 0,\mathrm{tr}(\mathbf{X}{({\mathbf{M}}^{-1}\odot \mathbf{I})}^{-1})\le e\end{array}$$

(16)

The above problem can be solved by CVX package in polynomial time.

Next, we use $\mathbf{X}$ to approach $a$ by introducing the auxiliary unitary matrix $\mathbf{Q}$, and this leads to the minimization problem:

$$\begin{array}{ll}\underset{\mathrm{P},\mathrm{Q}}{\min }\hspace{1em}\left|\right|{\mathbf{X}}^{1/2}\mathbf{Q}-{\mathbf{P}}^H{\mathbf{M}}^{-1/2}|{|}_F^2\iff \underset{\mathrm{P},\mathrm{Q}}{\min }& \mathrm{tr}(\mathbf{X})+\mathrm{tr}({\mathbf{P}}^H{\mathbf{M}}^{-1}\mathbf{P})-2\Re (\mathrm{tr}({\mathbf{M}}^{-1/2}\mathbf{P}{\mathbf{X}}^{1/2}\mathbf{Q}))\\ \mathrm{s}.\mathrm{t}.\hspace{1em}\mathbf{Q}{\mathbf{Q}}^H=\mathbf{I}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{0.17em}\mathrm{s}.\mathrm{t}.& \mathbf{Q}{\mathbf{Q}}^H=\mathbf{I}\end{array}$$

(17)

Considering the two variables in the optimization problem in Equation (17), the alternating direction method is considered for use here. Therefore, we can optimize one variable when the other is fixed, and Equation (17) can be split into two optimization problems:

$$\begin{array}{l}\mathrm{P}1:\underset{\mathrm{Q}}{\max }\hspace{1em}\Re (\mathrm{tr}({\mathbf{M}}^{-1/2}\mathbf{P}{\mathbf{X}}^{1/2}\mathbf{Q}))\\ \mathrm{s}.\mathrm{t}.\hspace{0.17em}\mathbf{Q}{\mathbf{Q}}^H=\mathbf{I}\end{array}$$

(18)

and

$$\mathrm{P}2:\underset{\mathrm{p}}{\min }\hspace{1em}{\mathbf{p}}^H{({\mathbf{M}}^{-1}\odot \mathbf{I})}^{-1}\mathbf{p}-2\Re ({\mathbf{d}}^H\mathbf{p})$$

(19)

where $\mathbf{d}=\mathrm{diag}({\mathbf{X}}^{1/2}{\mathbf{Q}}^{\ast }{\mathbf{M}}^{-1/2})$.

Problem 1 is an orthogonal Procrustes problem [16], let ${\mathbf{V}}_1\mathsf{\Sigma }{\mathbf{V}}_2^H$ represent the singular value decomposition (SVD) of ${\mathbf{M}}^{-1/2}\mathbf{P}{\mathbf{X}}^{1/2}$, and set unitary matrix $\mathbf{Z}={\mathbf{V}}_2^H\mathbf{Q}{\mathbf{V}}_1$ and $\Sigma =\mathrm{Diag}({[{\sigma }_1\hspace{0.17em}{\sigma }_2\hspace{0.17em}\dots \hspace{0.17em}{\sigma }_N]}^T)$, then we have:

$$\begin{array}{l}\Re (\mathrm{tr}({\mathbf{M}}^{-1/2}\mathbf{P}{\mathbf{X}}^{1/2}\mathbf{Q}))=\Re (\mathrm{tr}({\mathbf{V}}_1\mathsf{\Sigma }{\mathbf{V}}_2^H\mathbf{Q}))=\Re (\mathrm{tr}(\mathsf{\Sigma }{\mathbf{V}}_2^H\mathbf{Q}{\mathbf{V}}_1))\\ =\Re (\mathrm{tr}(\mathsf{\Sigma }\mathbf{Z}))={\displaystyle \sum _{i=1}^N\Re }(z_{ii}){\sigma }_i\le {\displaystyle \sum _{i=1}^N{\sigma }_i}\end{array}$$

(20)

The above inequality becomes an equality if and only if $\mathbf{Z}={\mathbf{I}}_{MN}$. Then, the solution of P1 is given by $\mathbf{Q}={\mathbf{V}}_2{\mathbf{V}}_1^H$.

Problem 2 is an unconstrained quadratic program. Note that the transmit code $a$ is the optimized variable, and let $H={\mathbf{I}}_M\otimes 1_N$, then we have $\mathbf{p}=Ha$.

Consequently, the P2 problem can also be given by:

$$\mathrm{P}2\prime :\underset{\mathrm{a}}{\min }\hspace{1em}{a}^H{\mathbf{H}}^H{({\mathbf{M}}^{-1}\odot \mathbf{I})}^{-1}\mathbf{H}a-2\Re ({\mathbf{d}}^H\mathbf{H}\mathbf{a})$$

(21)

As a result, the solution is directly given by $a={(H^H({\mathbf{M}}^{-1}\odot \mathbf{I})H)}^{-1}{H}^H\mathbf{d}$.

The whole optimization process is summarized as follows in

Table 1. The CVX algorithm for optimizing slow-time code.

Step 0:	Solve the SDP of Equation (16) to obtain $\mathbf{X}$.
Step 1:	initialize $a^{(0)}$ using uniform code, k = 0;
Step 2:	solve P1 problem by $\mathbf{Q}={\mathbf{V}}_2{\mathbf{V}}_1^H$ and ${\mathbf{V}}_1\mathsf{\Sigma }{\mathbf{V}}_2^H$ represent the singular value decomposition (SVD) of ${\mathbf{M}}^{-1/2}\mathbf{P}{\mathbf{X}}^{1/2}$,
Step 3:	solve P2 problem by $a={(H^H({\mathbf{M}}^{-1}\odot \mathbf{I})H)}^{-1}{H}^H\mathbf{d}$, and normalized a by $a^{(k)}=\sqrt{\frac{e}{N{a}^{H}a}}a$
Step 4:	set k = k + 1, repeat the steps 2∼3 until a certain stop criterion, e.g., $\left|\right|a^{(k+1)}-a^{(k)}|{|}_2^2\le ϵ$, where $ϵ$ is a predefined value.

:

3.3. Algorithm Based on Alternating Direction Method

In this section, the AD algorithm is given based on the auxiliary variable method and alternating direction method.

It follows from Section 3.1 that $\mathbf{S}=\mathbf{V}{\mathbf{V}}^H$. As a result, the objective function in problem Equation (13) can be converted to:

$$\begin{array}{l} \mathrm{tr}\{{(({{\mathbf{P}}^H\mathbf{M}\mathbf{P})}^{-1}+\mathbf{C})}^{-1}\mathbf{S}\}\\ =\mathrm{tr}\{{\mathbf{V}}^H{\mathbf{P}}^H{(\mathrm{PCP}}^H{+\mathbf{M})}^{-1}\mathbf{P}\mathbf{V}\}\end{array}$$

(22)

Let $\Theta =\theta \mathbf{I}-{\mathbf{V}}^H{\mathbf{P}}^H{\left(\mathbf{P}\mathbf{C}{\mathbf{P}}^H+\mathbf{M}\right)}^{-1}\mathbf{P}\mathbf{V}\succcurlyeq 0$. The choice of the parameter $\theta$ will be described later. As a consequence, the maximization problem in Equation (13) can be transformed to

$$\begin{array}{l}\underset{\mathbf{P}}{\min } \mathrm{tr}\{\Theta \}\\ \mathrm{s}.\mathrm{t}. \mathrm{tr}(\mathbf{P}{\mathbf{P}}^H)=e\end{array}$$

(23)

For solving this problem, we start with the following problem with respect to the auxiliary variable $Y$:

$$\begin{array}{ll}\underset{Y \mathbf{P}}{\min }& \mathrm{tr}\{\Xi \}\\ \mathrm{s}.\mathrm{t}.& Y^{H}U={\mathbf{I}}_{\delta \times \delta } \\ & \mathrm{tr}(\mathbf{P}{\mathbf{P}}^H)=e\end{array}$$

(24)

where $\Xi =Y^{H}RY$, $U=[{\mathbf{I}}_{\delta \times \delta }; 0_{NM\times \delta }{]}^{\mathbf{T}}$ and $R=\left[\begin{array}{cc}\theta {\mathbf{I}}_{\delta \times \delta }& {\mathbf{V}}^H{\mathbf{P}}^H\\ \mathbf{P}\mathbf{V}& \mathbf{P}\mathbf{C}{\mathbf{P}}^H+\mathbf{M}\end{array}\right]$.

Considering the two variables in the optimization problem in (24), alternating direction method is considered for use here. It can be proven that for fixed $\mathbf{P}$ the minimizer of the above problem is given by:

$$Y_0=R^{-1}U{(U^H{R}^{-1}U)}^{-1}$$

(25)

Note that ${(U^H{R}^{-1}U)}^{-1}$ exists. Then, let $Y_0=R^{-1}U{(U^H{R}^{-1}U)}^{-1}$, and note that $Y_0^{H}U={\mathbf{I}}_{\delta \times \delta }$. Let $Y=Y_0+\Delta$, where $\Delta \in {ℂ}^{(NM+\delta )\times \delta }$ satisfies ${\Delta }^{H}U=0$, so that $Y$ also satisfies the constraint. Then,

$$Y^{H}RY=Y_0^{H}R{Y}_0+Y_0^{H}R\Delta +{\Delta }^{H}R{Y}_0+{\Delta }^{H}R\Delta$$

(26)

where the two middle terms are equal to zero:

$${\Delta }^{H}R{Y}_0={\Delta }^{H}R{R}^{-1}U{(U^H{R}^{-1}U)}^{-1}=0$$

(27)

Hence, we have

$$Y^{H}RY-Y_0^{H}R{Y}_0={\Delta }^{H}R\Delta \ge 0$$

(28)

as $R$ is positive definite. It follows from (28) that the optimal solution of this problem is given by Equation (25).

According to the block matrix inverse formula in [17], we have:

$${\Theta }^{-1}={\mathbf{U}}^H{R}^{-1}\mathbf{U}$$

(29)

It follows from Equation (29) that $Y^{H}RY=\Theta$, when $Y=Y_0$. Consequently, for fixed $Y=Y_0$, the minimization of $\mathrm{tr}\{\Xi \}$ in problem Equation (24) with respect to $\mathbf{P}$ leads to a decrease of $\mathrm{tr}\{\Theta \}$. Thus, problem Equation (23) can be solved by a cyclic iterative method. In each loop, $Y$ is set to $Y_0$ firstly, and secondly, minimizer $\mathbf{P}$ is obtained by solving problem Equation (24) for fixed $Y$.

Let $Y={[Y_{1 \delta \times \delta };Y_{2 NM\times \delta }]}^T$, we can also have

$$\begin{array}{ll}{Y}^{H}RY& =[Y_1^H Y_2^H]\left[\begin{array}{cc}\theta {\mathbf{I}}_{\delta \times \delta }& {\mathbf{V}}^H{\mathbf{P}}^H\\ \mathbf{P}\mathbf{V}& \mathbf{P}\mathbf{C}{\mathbf{P}}^H+\mathbf{M}\end{array}\right]\left[\begin{array}{c}{Y}_1\\ Y_2\end{array}\right]\\ & =\theta Y_1^H{Y}_1+Y_2^H\mathbf{P}\mathbf{V}{Y}_1+Y_1^H{\mathbf{V}}^H{\mathbf{P}}^H{Y}_2+Y_2^H(\mathbf{P}\mathbf{C}{\mathbf{P}}^H+\mathbf{M})Y_2\end{array}$$

(30)

and

$$\mathrm{tr}(Y^{H}RY)=\mathrm{tr}(\theta Y_1^H{Y}_1+Y_2^H\mathbf{M}{Y}_2)+{\mathbf{p}}^H({\mathbf{C}}^T\odot (Y_2{Y}_2^H))\mathbf{p}+2\Re ({\mathbf{g}}^H\mathbf{p})$$

(31)

where $\mathbf{g}=\mathrm{diag}({\mathbf{V}}^{\ast }{Y}_1^{\ast }{Y}_2^{\mathbf{T}})$. It can be seen problem Equation (24) with respect to $\mathbf{P}$ is a convex quadratically constrained quadratic program. Note that $\mathbf{p}=Ha$ and $H={\mathbf{I}}_{\mathbf{M}}\otimes 1_N$. Then, above problem can also be given by:

$$\begin{array}{l}\underset{a}{\min \hspace{0.17em}}{a}^H{H}^H({\mathbf{C}}^T\odot (Y_2{Y}_2^H))Ha+2\Re ({\mathbf{g}}^H\mathbf{H}a) \\ \mathrm{s}.\mathrm{t}. a^{H}a=\frac{e}{N}\end{array}$$

(32)

This problem can be tackled by Lagrange multiplier method. Let

$$\mathcal{L}\left(a,\mu \right)=a^H{H}^H({\mathbf{C}}^T\odot (Y_2{Y}_2^H))Ha+2\Re ({\mathbf{g}}^H\mathbf{H}a)+\mu (a^{H}a-\frac{e}{N})$$

(33)

be Lagrange function with non-negative multiplier $\mu$. For fixed $\mu$, the unconstrained minimizer $a$ is:

$$a_{\mu }=-{(H^H({\mathbf{C}}^T\odot (Y_2{Y}_2^H))H+\mu \mathbf{I})}^{-1}{H}^H\mathbf{g}$$

(34)

Substituting Equation (34) into Equation (33), we obtain a concave function with respect to $\mu$:

$$\mathcal{L}\left(a_{\mu },\mu \right)=-\mathbf{g}{H}^H{(H^H({\mathbf{C}}^T\odot (Y_2{Y}_2^H))H+\mu \mathbf{I})}^{-1}{H}^H\mathbf{g}-\mu \frac{e}{N}$$

(35)

Then, we can obtain the maximizer of $\mu$ by solving the following equation:

$$\mathbf{g}{H}^H{(H^H({\mathbf{C}}^T\odot (Y_2{Y}_2^H))H+\mu \mathbf{I})}^{-2}{H}^H\mathbf{g}=\frac{e}{N}$$

(36)

by using the Newton method [18].

In addition, the parameter $\theta$ should satisfy:

$$\theta \ge {\lambda }_{\max }({\mathbf{V}}^H{\mathbf{P}}^H{(\mathrm{PCP}}^H{+\mathbf{M})}^{-1}\mathbf{P}\mathbf{V})$$

(37)

Note that

$$\begin{array}{ll}{\lambda }_{\max }({\mathbf{V}}^H{\mathbf{P}}^H({\mathrm{PCP}}^H+\mathbf{M})-1\mathbf{P}\mathbf{V})& \le {\lambda }_{\max }(({\mathbf{C}+{\mathbf{P}}^{-1}\mathbf{M}{\mathbf{P}}^{-H})}^{-1}).{\lambda }_{\max }(\mathbf{S})\\ & \le \frac{1}{{\lambda }_{\min }(\mathbf{C}+{\mathbf{P}}^{-1}\mathbf{M}{\mathbf{P}}^{-H})}.{\lambda }_{\max }(\mathbf{S})\end{array}$$

(38)

Furthermore, there exists

$$\begin{array}{ll}{\lambda }_{\min }(\mathbf{C}+{\mathbf{P}}^{-1}\mathbf{M}{\mathbf{P}}^{-H})& \ge {\lambda }_{\min }(\mathbf{C})+{\lambda }_{\min }({\mathbf{P}}^{-1}\mathbf{M}{\mathbf{P}}^{-H})\\ & \ge {\lambda }_{\min }(\mathbf{C})+\frac{{\lambda }_{\min }(\mathbf{M})}{e}\end{array}$$

(39)

As a result, the parameter $\theta$ should satisfy

$$\theta \ge \frac{e{\lambda }_{\max }(\mathbf{S})}{{\lambda }_{\min }(\mathbf{M})+e{\lambda }_{\min }(\mathbf{C})}$$

(40)

where ${\lambda }_{\max }(.)$ and ${\lambda }_{\min }(.)$ denote the largest and smallest eigenvalues, respectively.

The whole optimization process is summarized as follows in

Table 2. The AD algorithm for optimizing slow-time code.

Step 0:	initialize $a^{(0)}$ using uniform code, k = 0;
Step 1:	calculate the parameter $\theta$ by Equation (40);
Step 2:	calculate the matrix $R^{(k)}$;
Step 3:	set $Y^{(k)}=R^{(k)-1}U{(U^H{R}^{(k) -1}U)}^{-1}$ and calculate ${\mathbf{g}}^{(k)}$
Step 4:	solve problem (32) by $a=-{(H^H({\mathbf{C}}^T\odot (Y_2{Y}_2^H))H+\mu \mathbf{I})}^{-1}{H}^H\mathbf{g}$, calculate $\mu$, and normalized a by $a^{(k)}=\sqrt{\frac{e}{N{a}^{H}a}}a$
Step 5:	set k = k + 1, repeat the steps 2∼4 until a certain stop criterion, e.g., $\left|\right|a^{(k+1)}-a^{(k)}|{|}_2^2\le ϵ$, where $ϵ$ is a predefined value.

:

4. Numerical Examples

In this section, we assess the proposed optimization algorithm using simulated radar data. The parameters of the simulated radar platform are shown in

Table 3. Airborne phased-array radar parameters.

Parameters	Value
Carrier frequency	10.0 GHz
System bandwidth	5 MHz
Pulse repetition frequency ($1/T_r$)	5000 Hz
Flight velocity ($v_a$)	37.5 m/s
Antenna array spacing ($d$)	1.5 cm
Elements of antenna array N	16
Number of pulses M	16
Clutter-to-noise ratio(CNR)	20 dB
Target mean power	20 dB

. The thermal noise is modeled as a Gaussian white noise with unity power. The clutter and target powers can be referred to the white noise power. For all simulations, the clutter-to noise-ratio (CNR) is fixed at 20 dB. All presented results are averages over 1000 independent Monte Carlo runs:

It must be pointed out that the optimization model in this paper can also be solved by heuristic algorithms, such as the genetic algorithm (GA). GA is easy to implement and it has been successfully applied to radar waveform design in the literature [19,20]. However, with increased variables in the optimization problem, and the effect of random initial values, slow convergence speed and unsatisfactory results may be obtained in practice. In the follow-up numeric experiments, the performance of the two proposed algorithms is compared with a GA approach, whose parameters are set as follows: initial population size $S=40$, crossover rate $P_c=0.95$, mutation rate $P_m=0.1$, and maximum number of genetic iterations is 150.

In the following numeric examples, both the average metric in Equation (12) and SCNR in Equation (11) are used to evaluate the optimization effect. Furthermore, to evaluate SCNR improvement by incorporating slow-time coding, the metric of ${\mathrm{IMP}}_{\mathrm{SCNR}}$ is defined as

$${\mathrm{IMP}}_{\mathrm{SCNR}}=10{\log }_{10}\frac{{\mathrm{SCNR}}_{\mathrm{opt}}}{\mathrm{SCNR}}(dB)$$

(41)

where ${\mathrm{SCNR}}_{\mathrm{opt}}$ and SCNR denote calculated SCNR with optimized slow-time coding and without coding.

To optimize the slow-time code, the interested area in spatial-frequency and Doppler-frequency planes should be selected. We assume that the velocity vector is aligned with the array axis. Then, the clutter Doppler frequency is a liner function of spatial-frequency [1] (p. 25):

$$f_s=2v_a{T}_r{\theta }_s/d$$

(42)

It follows from the parameters in Table 3 and Equation (42), ground clutter appears on a ridge of spatial-frequency and Doppler-frequency plane in STAP output where $f_s={\theta }_s$. Thus, we pick a certain area which is parallel to the clutter ridge for optimizing the slow-time code. The relationship of the spatial-frequency ${\theta }_s$ and the normalized Doppler-frequency $f_s$ in the selected area is given by:

$$f_s={\theta }_s\pm \frac{\Delta +[0:s-1]}{N}$$

(43)

where $\Delta$ indicates the distance between clutter ridge and the interested area and $s$ is the width of the interested area.

Firstly, we compare the two proposed optimization algorithms and GA by studying the average metric of resultant codes under different energy constraints. Herein, we consider an example of code design for a certain area defined by Equation (43) with parameters Δ = 1 and s = 2. As can be seen from Figure 2, the average metrics of both proposed algorithms are significantly better than those of the uncoded system and GA. It also can be seen that the AD algorithm outperforms the CVX algorithm with slightly larger average metric, due to the optimality losses arising in the approximation process of CVX algorithm. We can also find the saturation phenomenon of the average metric when the energy constraint is sufficiently high.

Secondly, we use the generalized likelihood ratio (GLR) detector [21] to study the detection performance of the above 4 different codes. We assume that $e=5$, Δ = 1 and s = 2. The receiver operating characteristic (ROC) curve can be obtained by Monte Carlo method. First, 10,000 groups of random noise signals are generated to obtain the detection threshold $\eta$ for each false alarm rate by Neyman–Pearson criterion. Then, the target signal is added to the 10,000 groups of noise signals to calculate the detection rate under each false alarm rate. As can be seen from the ROC curve in Figure 3, the target detection performance of two proposed resultant codes is much better than that of the uncoded system and GA, and only minor difference can be found between the two proposed algorithms.

Thirdly, we use the resultant code generated by the AD algorithm to tackle the optimization effect at different spatial frequencies and Doppler frequencies. We assume that $e=5$, Δ = 1, and s = 2. Figure 4 shows the metric of ${\mathrm{IMP}}_{\mathrm{SCNR}}$ on the whole spatial-frequency and Doppler-frequency plane. About 2 dB SCNR improvement can be obviously seen form the area, which is parallel to the clutter ridge, and no SCNR loss appears on the clutter ridge. Therefore, slow-time coding can effectively improve slow moving target detection performance for the STAP radar system.

Finally, we use the AD algorithm to study the influence of optimization area selection on the optimization effect through the next two experiments. We assume that $e=5$. Figure 5 demonstrates the average metric over the interested area. As Δ increases, the average metric decreases fast. Therefore, slow-time coding can only improve slow moving target detection. Meanwhile, $s$ should be carefully chosen. s = 2 indicates a better performance.

Figure 6 shows the result of SCNR vs. Doppler for the side-looking case $(\theta {=0}^{\mathrm{o}})$. We assume that $e=5$ and s = 2. The resultant code of Δ = 1 has the highest SCNR in the normalized Doppler frequency interval of [0.02, 0.04]. The resultant codes of Δ = 3 and Δ = 5 present lower SCNR than the code of Δ = 1, but these values are still higher than the uncoded system result. This means that the selection of Δ depends on the target normalized Doppler frequency. When the target normalized Doppler frequency is less than 0.04, Δ = 1 can achieve better effect. Otherwise, Δ = 3 and Δ = 5 indicate a better performance.

5. Conclusions

The principle of STAP radar for improving SCNR based on slow-time coding is described in this paper. When slow-time code is optimized according to the selected area on spatial-frequency and Doppler frequency planes, the SCNR metric can be improved accordingly. Two optimization algorithms, i.e., CVX and AD, are proposed. Numerical examples show that the two proposed algorithms outperform GA, and the SCNR around the clutter ridge is improved significantly. Therefore, slow-time coding can optimize slow moving target detection performance.