# A New Jammer Suppression Method in MIMO Radar Using Matrix Pencil Method and Generalized Likelihood Ratio Test

Authors: Kang-in Lee; Wonjune Kang; Young-Seek Chung; Hoon-Gee Yang; Jong Mann Kim
Journal: International Journal of Antennas and Propagation
 (2015)

---

## Abstract

We propose a new algorithm to suppress the jammer signals and estimate the direction of arrival (DOA) of the signal of interest (SOI) for collocated MIMO radar by using the matrix pencil method (MPM) and the generalized likelihood ratio test (GLRT). The conventional GLRT divides the visible region into small angle samples, suppresses the jammer signals at each angle sample, and then estimates the DOA of the SOI. In the proposed algorithm, we extract the eigenvalues of received signals regardless of the SOI and jammer by using the MPM, which contain the information of the DOA of SOIs or jammers. Then, in order to suppress the jammers, we apply the GLRT to the extracted DOAs instead of to the entire visible region. By applying the MPM again to the received signals in which the jammer signals are suppressed, we can estimate the DOAs of the SOI. Since the proposed algorithm does not depend on the number of angle samples, it shows fast and accurate results regardless of the angle resolution. In order to verify the proposed algorithm, we compared the results with the results of the conventional GLRT and show the computing time.


---

## Body

## 1. Introduction

In recent times, multi-input multioutput (MIMO) radar technologies have been of interest in many areas of military and civilians, and it has been verified that MIMO radar has a lot of potential advantages over conventional phased-array radar [1–8]. In military area, the MIMO radar has an important role of detecting and tracking the low-observable targets and performing high resolution imaging. In also commercial areas such as the ITS (intelligent transport system), the collision avoidance system of car, and the weather broadcasting radar, the MIMO radar has attracted considerable attention.A MIMO radar system is composed ofM
t transmitters and M
r receivers, which can be collocated or distributed spatially [3]. Typically, it is assumed that at each receiver a technique exists for unambiguously separating the reflected signals of interest (SOI) from each transmitter, by utilizing orthogonal waveforms and a matched filter bank.In [5, 9], many researchers have shown that, by utilizing orthogonal waveforms, a MIMO radar system with spatially diverse transmitters and receivers, can provide advantages in target detection and parameter estimation compared to a traditional phased array system [10]. For collocated transmit and receive antennas, the MIMO radar has been shown to get higher resolution than that of a phased array radar using the same number of physical antenna elements. This is because the MIMO radar has more degrees of freedom (DOF) than a phased array system with a single transmitting element [3, 4]. In general, the received signal of the radar is composed of the signal of interest (SOI), interference or jammer, and noise. In order to extract the SOI from the received signal, the jammer signal should be suppressed efficiently and various suppression algorithms have been studied [11–15].In this paper, we propose a new jammer suppression algorithm for the MIMO radar by combining the MPM and the GLRT. The conventional GLRT divides the entire angle region or the visible regionΩ into an angle sample Δ
θ
=
Ω
/
N
θ, where N
θ is the number of angle samples [1, 16–20]. It then performs suppression of the jammer signals or estimation of the DOAs of the SOI, by comparison with the given threshold value at each angle sample. If the angle of the DOA is an integer multiple of the angle sample (which in this paper is called the matched angle), the performance of the conventional GLRT shows good results; otherwise, the results may be of relatively poor quality. Although we can solve this problem by using a smaller angle sample, it increases the computing time.In this paper, we first extract the number and DOA of signals above a threshold by using MPM. The extracted signals can be SOIs or jammers. Then, the jammer signals can be suppressed, by applying the GLRT to the extracted DOAs. In general, since the number of the extracted signals is much smaller thanN
θ, the proposed algorithm can reduce the number of operations of the GLRT compared with the conventional algorithm. The DOAs of the SOI can then be estimated by applying the MPM again to the output signals of the virtual array of the MIMO radar.In this paper, we verify the performance of the proposed algorithm under various environments. In the first case, we test it according to the level of the jammer-to-noise ratio (JNR). In the other case, when the DOAs of the signals match the angle sample or do not, we compare the results of the proposed algorithm with those of the conventional one. Since the proposed algorithm estimates the DOAs of all the signals regardless of the angle sample, it shows good performance even when the DOA is not matched to the angle sample.Also, we derive the computational complexity of the proposed algorithm and compare it with that of the conventional one.


## 2. Signal Model

In this paper, we assume the following:(i)
the transmitted probing signal is assumed to be a narrowband signal [1, 21];
(ii)
there is nondispersive propagation;
(iii)
transmitters and receivers are collocated;
(iv)
the targets are represented by nonmoving points.In general, MIMO radar is composed ofM
t transmitters with orthogonal waveforms and M
r receivers with matched filters. At the target location, the transmitted signals are given by
(1)
∑
m
=
1
M
t
e
-
j
ω
0
τ
m
θ
x
t
,
m
n
≡
a
H
θ
x
t
n
,
n
=
1
,
…
,
N
,
where, x
t
,
m
n is the discrete-time baseband signal sequence from the mth transmitter, θ is the azimuth angle of the target, ω
0 is the carrier angular frequency of the radar, τ
m
θ is the propagation time from the mth transmitter to the target, and N is the number of data samples of the transmitted signal.Also,·
H means the Hermitian transpose, x
t
n the transmitted sequence vector, and a
θ the steering vector of the transmitting antenna, which are represented by
(2)
x
t
n
=
x
t
,
1
n
x
t
,
2
n
⋯
x
t
,
M
t
n
T
,
a
θ
=
e
-
j
ω
0
τ
1
θ
e
-
j
ω
0
τ
2
θ
⋯
e
-
j
ω
0
τ
M
t
θ
T
,
where ·
T means the transpose of a vector. At the receiver, the received signal sequence vector is given by
(3)
y
n
=
∑
k
=
1
K
β
k
b
*
θ
k
a
H
θ
k
x
t
n
+
J
n
+
ε
n
,
(4)
y
n
=
y
1
n
y
2
n
⋯
y
M
r
n
T
,
b
θ
=
e
-
j
ω
0
τ
^
1
θ
e
-
j
ω
0
τ
^
2
θ
⋯
e
-
j
ω
0
τ
^
M
r
θ
T
,
where τ
^
n
θ is the propagation time from the target to the nth receiver, θ
k is the kth target location, β
k is the complex amplitude proportional to RCS of the kth target, ε
n is the spatially and temporally white circularly symmetric complex Gaussian noise sequence vector with mean zero [1], K is the number of targets of interest, and J
n represents the jamming signal vector. Also, b
θ is the steering vector of the receiving antenna and ·
* denotes the complex conjugate of a vector.In (3), the received jamming signal can be written as
(5)
J
n
=
∑
j
=
1
P
β
j
b
*
θ
j
x
j
n
,
(6)
J
n
=
J
1
n
J
2
n
⋯
J
M
r
n
T
,
where θ
j is the jth jammer location, β
j the complex amplitude of the jth jammer, and x
j the discrete-time baseband random signal of the jth jammer. P denotes the number of jammer signals.


## 3. Jammer Suppression and DOA Estimation Using MPM and GLRT

The matrix pencil method (MPM) approximates a given data set or function with the sum of the complex exponential functions. Applying the MPM to a phased array, it can extract the DOAs and the number of SOIs [22–24].Consider a uniformly spaced linear array (ULA) antenna. Then, the received signal at themth antenna element of the ULA can be represented as
(7)
p
m
=
∑
k
=
1
K
A
k
exp
⁡
j
2
π
d
m
-
1
λ
sin
θ
k
=
∑
k
=
1
K
A
k
z
k
m
,
m
=
1
,
…
,
M
,
(8)
z
k
≡
exp
⁡
j
2
π
d
λ
sin
θ
k
,
where K is the number of SOIs, λ the wavelength, d the distance between the adjacent antenna elements, A
k the complex amplitude, and θ
k the DOA of the kth SOI. In this paper, z
k is called a pole. In a phased array, the pole vector z
k corresponds to the steering vector that includes the DOAs of received signals. The MPM estimates the pole vector z
k by applying singular value decomposition (SVD) to the Hankel matrix of (7).In this paper, by using the MPM, we extract the DOAs of signals greater than the thresholdγ
MPM from the received signal vector in the MIMO radar. Note that the extracted signals may not include a few jammers or SOIs according to the jammer-to-noise ratio (JNR) level.When (5) is substituted into (3), (3) can be rewritten as
(9)
y
n
=
∑
k
=
1
K
β
k
e
j
2
π
sin
θ
k
/
λ
0
⋮
e
j
2
π
sin
θ
k
/
λ
M
r
-
1
d
r
*
h
h
h
h
h
×
e
j
(
2
π
sin
θ
k
/
λ
)
0
⋮
e
j
(
2
π
sin
θ
k
/
λ
)
M
t
-
1
d
t
H
x
t
n
+
∑
j
=
1
P
β
j
e
j
2
π
sin
θ
j
/
λ
0
⋮
e
j
2
π
sin
θ
j
/
λ
M
r
-
1
d
r
*
x
j
n
+
ε
n
,
where d
t and d
r mean the distance between adjacent antennas of the receiver and the transmitter, respectively. Note that in the ULA, τ
m
θ
=
exp
⁡
j
2
π
sin
θ
d
t
/
λ
m
-
1 and τ
^
n
θ
=
exp
⁡
j
2
π
sin
θ
d
r
/
λ
n
-
1. From (9), we can derive the following Hankel matrix Y
H
n at each data sample as [22]:
(10)
Y
H
n
=
y
1
n
y
2
n
⋯
y
L
n
y
2
n
y
3
n
⋯
y
L
+
1
n
⋮
⋮
⋱
⋮
y
M
r
-
L
+
1
n
y
M
r
-
L
+
2
n
⋯
y
M
r
n
.
In (10), y
p
n is the received signal at the pth receiver with the nth data sample and L means the pencil parameter and its size is about 1/3 the size of (9). Using the block matrix of (10), we construct a new matrix as [23]
(11)
Y
-
H
=
Y
H
1
,
Y
H
2
,
…
,
Y
H
N
.Applying the MPM to (11), we extract the pole z
q of the received signals above the threshold value as
(12)
z
q
≡
exp
⁡
j
2
π
d
r
λ
sin
θ
q
,
q
=
1,2
,
…
,
Q
,
where θ
q is the qth DOA of the estimated signals and Q is the number of the extracted poles. Using extracted pole z
q, the received signals can be reconstructed as
(13)
y
n
=
∑
q
=
1
Q
A
q
n
b
θ
q
,
(14)
b
θ
q
=
1
,
exp
⁡
j
2
π
d
r
λ
sin
θ
q
,
…
,
h
h
h
exp
⁡
j
2
π
d
r
λ
M
r
-
1
sin
θ
q
T
=
1
,
z
q
,
…
,
z
q
M
r
-
1
T
.In general,Q
≤
K
+
P; and in the case of high JNR, Q converges to P. In (13), the complex amplitude vector A
n can be estimated by using the least square method (LSM) as
(15)
A
n
=
Z
†
n
y
n
,
where
(16)
A
n
=
A
1
n
,
A
2
n
,
…
,
A
Q
n
T
,
Z
n
=
1
1
⋯
1
z
1
n
z
2
n
⋯
z
Q
n
⋮
⋮
⋮
z
1
M
r
-
1
n
z
2
M
r
-
1
n
⋯
z
Q
M
r
-
1
n
.
In (15), ·
† means the pseudo inverse of a matrix.Applying the GLRT at the estimated DOAθ
q, we determine whether the signal from θ
q is a jammer or an SOI. In this paper, in order to suppress the jammer signal, we use the following equation as the GLRT [5]:
(17)
ρ
θ
=
1
-
b
T
θ
R
^
-
1
y
y
b
*
θ
b
T
θ
Q
^
-
1
b
*
θ
.Equation (17) represents the probability of the existence of the SOI at the testing angle θ. While in the conventional GLRT method, θ is the integer multiplication of the angle sample Δ
θ, the proposed method makes it possible to be an arbitrary angle estimated by applying the MPM to (11). In (17), R
^
y
y denotes the sample covariance matrix of the received signal Y
=
y
1
,
y
2
,
…
,
y
N and Q
^ the residual covariance matrix as follows [1, 5, 25]:
(18)
Q
^
=
R
^
y
y
-
Y
X
H
a
θ
a
H
θ
X
Y
H
N
2
a
H
θ
R
^
x
x
a
θ
.If the extracted angleθ
q satisfies ρ
θ
q
<
γ
GLRT, it is considered as the DOA of a jammer. Note that when the JNR is very high, the first step MPM may fail to extract the DOA of the SOI due to its eigenvalue being lower than the threshold γ
MPM. In this case, the proposed method can reconstruct the DOA of the SOI, by applying the MPM again to the received signal vector in which the jammer signals are suppressed.Since the DOAs of the jammer signal are classified, we can find the corresponding amplitudeA
J to jammer’s DOA in (15). Using these poles and amplitudes, we can obtain the received signal vector without the jammer signals as
(19)
y
~
n
=
y
n
-
Z
J
n
A
J
n
,
where,
(20)
A
J
n
=
A
1
n
A
2
n
⋯
A
P
n
T
,
Z
J
n
=
1
1
⋯
1
z
1
n
z
2
n
⋯
z
P
n
⋮
⋮
⋮
z
1
M
r
-
1
n
z
2
M
r
-
1
n
⋯
z
P
M
r
-
1
n
.In (19), since y
~
n is composed of only SOIs without jamming signals, it can be rewritten as
(21)
y
~
n
=
∑
k
=
1
K
β
k
b
*
θ
k
a
H
θ
k
x
t
n
+
ε
n
.By applying the same number of matched filters as transmitters to each receiver, we obtain the receiving sequence matrix:(22)
Y
~
n
=
∑
k
=
1
K
β
k
b
*
θ
k
a
H
θ
k
x
t
n
x
t
H
n
+
ε
n
x
t
H
n
.If we choose an orthonormal sequence forx
t
n, the matrix x
t
n
x
t
H
n becomes an identity matrix I. Also, we assume the noise ε
n to be uncorrelated to x
t
n.In the case of a uniformly spaced linear array (ULA), (22) can be rewritten as the following:
(23)
Y
~
m
t
,
m
r
=
∑
k
=
1
K
β
k
exp
⁡
-
j
2
π
λ
sin
θ
k
d
r
m
r
-
1
-
d
t
m
t
-
1
,
where m
t
=
1
,
…
,
M
t and m
r
=
1
,
…
,
M
r. Assuming d
t
=
M
r
d
r, (23) can be simplified as
(24)
Y
m
=
∑
k
=
1
K
β
k
exp
⁡
-
j
2
π
d
r
λ
m
-
1
sin
θ
k
,
where m
=
1,2
,
…
,
M
t
M
r.Applying the second step MPM to (24), we can obtain the DOAs of the SOI. The reason why the proposed method needs two applications of the MPM is because the first step MPM may fail to extract the DOAs of the SOI under very high JNR. Suppressing the jammer signals discriminated by the GLRT method, the second step of MPM can successfully extract the DOAs of the SOI from (24).


## 4. Computational Complexity

In this section, we compare the computational complexity between the proposed method and the conventional GLRT method. Assuming thatN
θ is the number of angle samples, the computational complexity of the conventional method is approximately given by
(25)
N
M
r
M
t
+
M
r
2
N
+
M
r
3
N
θ
.The computational complexity of the proposed method depends on the computation of the singular value decomposition (SVD) for the MPM. Assuming thatL
1 and L
2 are the pencil parameters of the first and second MPM, respectively, the computational complexity of the proposed method is approximately given by [26]:
(26)
2
M
r
M
t
-
L
2
+
1
L
2
2
+
2
L
2
3
+
2
M
r
-
L
1
+
1
2
L
1
N
+
2
M
r
-
L
1
+
1
3
+
N
2
Q
2
M
r
+
Q
3
.In this paper, we useL
1
=
M
r
/
3 and L
2
=
M
t
M
r
/
3, and therefore the effect of L
2 is dominant. Figures 2 and 3 show a comparison of the computational complexity between the proposed method and the conventional GLRT method according to the number of virtual arrays M
t
M
r in the MIMO radar. For the conventional GLRT method, we use Δ
θ
=
0
.
5
∘. In Figure 2, when N
=
64 and M
t
M
r
<
500, the computational complexity of the proposed method is smaller than that of the conventional method. Figure 3 shows that when N
=
128 and M
t
M
r
<
700, the complexity of the proposed method is smaller.Therefore, the proposed algorithm is effective when the number of the virtual arrays in the MIMO radar is limited according to the number of data samplesN.


## 5. Numerical Examples

Figure1 is simulation geometry for collocated MIMO radar. In this figure, θ
k means K units of SOI’s DOA, and θ
j means the DOA of the qth jammer signal. The T
x array and the R
x array have the same phase center and it is assumed that the array elements locate on the same straight line.Figure 1
Simulation geometry for collocated MIMO radar signal model.Figure 2
Computational complexity according to the size of the virtual array whenN
=
64.Figure 3
Computational complexity according to the size of the virtual array whenN
=
128.Table1 shows the simulation conditions for the information of the SOI, the JNR, and so forth. In the case of A and B, the JNR is set to be the same as the SNR. In the case of C and D, the JNR is set to be much greater than the SNR. Also, in the case of A and C, the DOAs of the SOI match the angle sample. In the case of B and D, the DOAs of the SOI do not match the angle sample.Table 1
Simulation conditions.
Case
JNR(dB)
θ
k
β
k
θ
j
A
20
-
1
0
°
,
1
0
°
,
3
0
°
4.0,2.0,3.5
-
2
0
°
,
0
°
,
2
0
°
B
20
-
10.3
8
°
,
10.2
9
°
,
30.1
6
°
4.0,2.0,3.5
-
2
0
°
,
0
°
,
2
0
°
C
70
-
1
0
°
,
1
0
°
,
3
0
°
4.0,2.0,3.5
-
2
0
°
,
0
°
,
2
0
°
D
70
-
10.3
8
°
,
10.2
9
°
,
30.1
6
°
4.0,2.0,3.5
-
2
0
°
,
0
°
,
2
0
°In this work, the MIMO radar is assumed to be composed of a uniformly spaced linear array of 31 elements for receivers and 7 elements for transmitters, respectively. We set the distances between adjacent elements asd
r
=
0.5
λ and d
t
=
M
r
d
r
=
15.5
λ. Also, the SNR varies from 0 dB to 20 dB. We adopt a Walsh sequence for the transmitter signal x
n, which has a covariance matrix of the form R
x
x
=
I. We set γ
MPM
=
-
10dB and γ
GLRT
=
0.4 for the threshold values. Also, for all examples, we use data samples with N
=
128 and 10,000 trials for the root mean square error (RMSE).Figure4 shows the normalized eigenvalues calculated by the first step MPM in the case of A and C. When the JNR and SNR have the same level, all of the jammer signals and the SOIs are shown to be above the threshold γ
MPM. However, when the JNR is much greater than the SNR, only the jammer signals are shown to be above the threshold γ
MPM.Figure 4
Normalized eigenvalues in the case of A and C, from the first step MPM.Figure5 shows the RMSE and the number of estimated SOIs with respect to the SNR in the case of A. Although the error of the proposed method is greater than that of the conventional GLRT method, the absolute magnitude of the error is low enough to be neglected. In this case, the two methods accurately estimate the number and the DOAs of the SOI.Figure 5
RMSE and the number of estimated SOIs in case A.Figure6 shows the number of estimated SOIs with respect to the SNR in the case of B. In the case of using the conventional GLRT method, it fails to estimate the number of SOIs. This is because the DOA of the SOI does not match the angle sample. However, the proposed method successfully estimates the number of SOIs successfully. The RMSE of the proposed method is similar to that of case A.Figure 6
The number of estimated SOIs in case B.Figure7 shows the RMSE and the number of estimated SOIs with respect to the SNR in the case of C. In the proposed method, although the first step MPM fails to extract the DOAs of the SOI, the second step MPM can accurately extract them.Figure 7
RMSE and the number of estimated SOIs, in case C.Figure8 shows the number of estimated SOIs with respect to the SNR in the case of D. Since the DOA of the SOI does not match the angle sample, the results are similar to those of case B.Figure 8
The number of estimated SOIs in case D.Figure9 shows the number of SOIs estimated by the conventional GLRT method in the case of B, with respect to the angle sample Δ
θ. When the angle sample becomes small enough, the conventional method can estimate the DOAs of the SOI even if they do not match the angle sample. However, the computational complexity increases in proportion to the number of angle samples N
θ.Figure 9
The number of estimated SOIs in case B, according to the size of the angle sample and the SNR.From (25) and (26) under these simulation conditions, the computational complexity of the conventional method is about 8 times that of the proposed method. In these cases, after 10,000 trials on an Intel Core i7-3820 CPU @ 3.6 GHz, the average computing time of the proposed algorithm is 13.6 ms which is only 16% that of the conventional method of 84.3 ms.


## 6. Conclusion

In this paper, we propose a new jammer suppression technique for MIMO radar by exploiting the MPM and the GLRT. The jammer suppression is performed by preestimating the DOAs of the dominant signals above the threshold and applying the GLRT method to them. Although the proposed method may fail to classify a few DOA of the SOI at the first step MPM in the case of high JNR condition, it can accurately estimate the DOA of the SOI at the second step MPM. Also, the proposed method can estimate the DOAs of the SOI on a wide range of JNR and SNR independently of the angle sample, and the estimation error is negligible. In particular, in the case of the limited size of the virtual array in MIMO radar, the computational complexity can be reduced.



---

*Source: 802471-2015-02-22.xml*