# A Joint Doppler Frequency Shift and DOA Estimation Algorithm Based on Sparse Representations for Colocated TDM-MIMO Radar

Authors: Tao Chen; Huanxin Wu; Lutao Liu
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

We address the problem of a new joint Doppler frequency shift (DFS) and direction of arrival (DOA) estimation for colocated TDM-MIMO radar that is a novel technology applied to autocruise and safety driving system in recent years. The signal model of colocated TDM-MIMO radar with few transmitter or receiver channels is depicted and “time varying steering vector” model is proved. Inspired by sparse representations theory, we present a new processing scheme for joint DFS and DOA estimation based on the new input signal model of colocated TDM-MIMO radar. An ultracomplete redundancy dictionary for angle-frequency space is founded in order to complete sparse representations of the input signal. The SVD-SR algorithm which stands for joint estimation based on sparse representations using SVD decomposition with OMP algorithm and the improved M-FOCUSS algorithm which combines the classical M-FOCUSS with joint sparse recovery spectrum are applied to the new signal model’s calculation to solve the multiple measurement vectors (MMV) problem. The improved M-FOCUSS algorithm can work more robust than SVD-SR and JS-SR algorithms in the aspects of coherent signals resolution and estimation accuracy. Finally, simulation experiments have shown that the proposed algorithms and schemes are feasible and can be further applied to practical application.


---

## Body

## 1. Introduction

It is a novel technology and worth studying deeply that multiple-input multiple-output (MIMO) radar architecture is applied to autocruise and safety driving system [1, 2]. Using this technology we hope distance, velocity, and direction of arrival (DOA) of multisource signals reflected by other automobiles near your own car can be measured simultaneously. According to these estimated parameters the auto can take measures to deal with all kinds of situations automatically or warn the driver. MIMO radar architecture with colocated transmitter (TX) and receiver (RX) antennas has a larger virtual aperture [3]. The basic idea of virtual aperture is shown in Figure 1. Here, we consider a uniform linear array (ULA) with M
=
4 transmitters, N
=
4 receiver antennas, and the receiver array spacing d. According to MIMO theory we know that its virtual array consists of 16 virtual antennas in Figure 1. So it can achieve a more accurate DOA and improve multisource resolution in the same time. In recent years sparse representations and compressed sensing algorithm have been widely studied and some algorithms based on sparse representations have been applied to DOA estimation for MIMO radar [3–7]. DOA estimation algorithm based on sparse representations and reconstruction theory has two important advantages. One is that it can process coherent signal; the other is that it can complete DOA estimation in few snapshots.Figure 1
MIMO radar system withM
=
4 transmitters and N
=
4 receiver antennas and its virtual array consists of 16 antennas.Generally speaking, MIMO radars require more complex hardware [8] when they can be realized by code, frequency. MIMO system requires that the number of receiver channels should be equal to the number of receiver antennas. Moreover, a difference in gain and phase between the receiver channels deteriorates the accuracy significantly [8]. Meanwhile customers also demand an increased performance of automotive radar sensor at low sensor costs with the development of SiGe MMIC technology [2, 9]. The architecture of the time division modulated (TDM) for MIMO (TDM-MIMO) radars may be utilized for the purpose of economic and simple system design for autocruise and safety driving system. Some receiver or transmitter channels may be cut only by depending on switching different RX or TX antennas in time domain.A MIMO radar has the ability to transmit different, noncoherent orthogonal signals from different positions using an array of multiple transmitter antennas [10]. If TX antennas could transmit signal at different times, only one TX antenna is permitted to transmit signal during each period. This MIMO radar system can be called as TDM-MIMO radar system. For example, 4 TX antennas may transmit signal at the schedule in Figure 2. Note that the signal phase related to other receiver channels can be varying even if we are facing one incident signal just because TX antennas transmit signal at different time instants in one cycle and the target moving conduces Doppler frequency shift. The steering vector model of colocated TDM-MIMO radar is “time varying steering vector” model [8]. Hence, the conventional algorithms such as Capon and MUSIC [11–13] cannot process this kind of input signal model directly. It is also very difficult to precisely estimate DFS in advance in a short time for the practical application of TDM-MIMO radar.Figure 2
Example of a TDM scheme: 4 transmitters transmitting at times. Heret
_
=
[
t
1
,
t
2
,
t
3
,
t
4
]
T; d
_
Pulse
=
[
d
1
TX
,
d
2
TX
,
d
3
TX
,
d
4
TX
]
T.In recent years a new highly integrated SiGe MIMO radar sensor has been developed [2, 14–16]. In these systems the frequency-modulated continuous wave (FMCW) will be radiated by transmitters. So DFS and high resolution DOA estimation technology research are very important requirements for the application in autocruise and safety driving system [16, 17]. The specification of the automotive long range radar (LRR) sensor includes a high DOA estimation accuracy of θ
err
⁡
≤
0
.
4
∘, an angular resolution of Δ
θ
≤
3
∘, and target ranges R up to 200 m with relative target velocities v between −60 m/s and 20 m/s [18].Facing the aforementioned applications and problems of parameters estimation for TDM-MIMO radar, some researchers proposed some methods to solve these problems. For time-invariant steering vector model, the conventional algorithms such as Capon beamformer [8], AM [18], and MUSIC [16, 18] were applied. For time varying steering vector model, the Cramer-Rao bound (CRB) of parameter estimation for a TDM-MIMO radar with colocated antennas was computed and an optimal TDM scheme was derived [1, 19]. ISI-SAGE algorithm was tested to estimate DFS and DOA jointly [20]. A new nonstationary version of Capon beamforming was developed for the time varying steering vector model [8].In this paper, we offer a new insight into the joint DFS and DOA estimation based on sparse representations for time varying steering vector model of colocated TDM-MIMO radar. An ultracomplete redundancy dictionary for angle-frequency space is founded in order to complete sparse representations for the input signal. The SVD-SR algorithm which stands for joint estimation based on sparse representations using SVD decomposition with OMP algorithm and the improved M-FOCUSS algorithm which combines the classical M-FOCUSS algorithm with joint sparse recovery spectrum are applied to the new model to solve MMV problem. By using these algorithms, both the coherent signals and uncorrelated signals can be distinguished successfully and estimation accuracy can be further improved in the case of MMV with low SNR.This paper is concerned with issues of signal model and signal processing for TDM-MIMO. The remainder of this paper is organized as follows. We present the signal model in Section2 firstly. Then sparse representations’ principle for TDM-MIMO model is discussed and angle-frequency dictionary is designed in Section 3. How to deal with joint DFS and DOA estimation based MMV model using SVD decomposition and improved M-FOCUSS algorithm is demonstrated in detail in Section 4. In Section 5 simulation results and some discussions are given. Finally, we conclude our work in Section 6.


## 2. Signal Model

We consider a colocated MIMO radar consisting of a linear receiver and transmitter array with isotropic antennas. The moving target is modeled as a point source and the transmitted signal is narrowband. The positions of theN
RX RX antennas and M
TX TX antennas are given in d
_
RX
∈
R
N
RX and d
_
TX
∈
R
M
TX, respectively, in units of 2
π
/
λ, where λ is the carrier wavelength. The positions of the TX antennas in the sequence in which they transmit are given in d
_
Pulse
∈
R
N
Pulse. N
Pulse is the number of transmitted pulses in a cycle. The time instance at which the antennas transmit in a cycle is given t
_
∈
R
N
Pulse. This means that the antenna with position d
i
Pulse transmits at time t
i; see Figure 2 for an example. So the steering vector of the virtual array is given by
(1)
a
_
u
=
exp
⁡
j
·
d
_
Virt
u
=
exp
⁡
j
·
d
_
Pulse
u
⊗
exp
⁡
j
·
d
_
RX
u
.
Here u
=
sin
(
Θ
) is the DOA of targets. y
_
=
exp
⁡
(
x
_
) is understood as an element-by-element operation y
i
=
exp
⁡
(
x
i
). ⊗ is the Kronecker tensor product. _ stands for column vector.We assume a number ofL measurement cycles where one cycle consists of N
Pulse pulses. See Figure 3 for an example. t
_
=
[
t
1
,
t
2
,
t
3
,
…
,
t
N
Pulse
]
T. So the complex baseband signal y
_
(
l
)
∈
C
N
Virt of cycle l is given as
(2)
y
_
l
=
exp
⁡
-
j
·
γ
_
ω
d
⊙
a
_
u
1
N
Pulse
s
l
+
N
_
l
.
Here ⊙ is the entrywise Hadamard product and N
Virt
=
N
Pulse
·
N
RX is the number of virtual antennas. s
(
l
)
∈
C is the target echo signal. N
_
(
l
) is additive complex Gaussian noise with zero mean, spatially and temporally uncorrelated with E
(
N
_
(
l
)
N
_
H
(
m
)
)
=
δ
l
·
m
σ
2
I (H stands for Hermitian transformation). The factor 1
/
N
Pulse adjusts the signal strength of one cycle, consisting of N
Pulse pulses, according to a constant transmitting energy. ω
d stands for Doppler frequency shift. Consider
(3)
γ
_
=
t
_
⊗
1
_
N
RX
.
Here 1
_
K is a vector of length N
RX with all elements equal to 1. With the definition of a new steering vector,
(4)
b
_
u
,
ω
d
∶
=
exp
⁡
-
j
·
γ
_
ω
d
⊙
a
_
u
.
the signal model can be written as
(5)
y
_
l
=
b
_
u
,
ω
d
·
1
N
Pulse
s
l
+
N
_
l
,
From formula (4), we will see that steering vector for input model of colocated TDM-MIMO radar is “time varying steering vector” model since there is t
_ item existing. In order to complete the parameters estimation we make the following assumptions.(1)
The far field condition is satisfied. So DOA of one target echo signal is the same for all receiver antennas.
(2)
The DOA and the moving velocity of the target will not change during one complete measurement. So both DOA and DFS are constants duringL measurement cycles. In other words, the parameters’ changes have smaller effect on the accuracy of parameters estimation and these changes can be ignored.
(3)
We consider a MIMO radar system with colocated antennas; that is, the direction of departure (DOD) and DOA are the same.
(4)
Time of switching different TX and RX antennas or channels is accurate; that is, the estimation error oft
_ vector is ignored.Figure 3
Structure of the cycles in data acquisition.


## 3. Sparse Representations for TDM-MIMO Receiver Signal

The signal sparse representations mean that a signal may be represented in an ultracomplete redundancy dictionary. Then we find the best linear combination of atoms to represent original signal. Inspired by the literature [7], we can establish an ultracomplete redundancy dictionary called angle-frequency space to represent original signal y
_
(
l
) of formula (5). The following is the angle-frequency dictionary Ψ we designed:
(6)
Ψ
=
Φ
1
Φ
2
⋯
Φ
p
⋯
Φ
P
∈
C
N
Virt
×
P
Q
,
Φ
p
=
ϕ
_
p
1
ϕ
_
p
2
⋯
ϕ
_
p
q
⋯
ϕ
_
p
Q
,
ϕ
_
p
q
=
exp
⁡
-
j
·
γ
_
ω
q
⊙
a
_
u
.
According to formula (6) we can rewrite the signal model of formula (5) to group L snapshots as
(7)
Y
=
Ψ
·
Z
+
N
,
where Y
=
[
y
_
(
1
)
,
y
_
(
2
)
,
…
,
y
_
(
L
)
] is a matrix of size N
Virt
×
L, Z
=
[
z
_
(
1
)
,
z
_
(
2
)
,
…
,
z
_
(
L
)
] is a matrix of size P
Q
×
L, and N is a noise matrix of size N
Virt
×
L. Let ϕ
_
1
,
ϕ
_
2
,
…
,
ϕ
_
p
q be a set of joint angle-frequency spaces of DFS and DOA space. Here P
Q is the total number of vectors of joint angle-frequency space matrix that the algorithm can scan. Assuming that K incident signals exist in the noise-free case, we can find K nonzero coefficients z
θ
(
t
)
=
s
k
(
t
) at positions corresponding to the atom θ
=
θ
k, (k
=
1,2
,
…
,
K
,
θ
k
=
p
q
,
p
=
index
(
DOA
(
s
k
)
)
,
q
=
index
(
DFS
(
s
k
)
)) and zero coefficients at the remaining P
Q
-
K; that is, the sparsity in the angle-frequency space denotes that only a few atoms from the dictionary will be required to match the measurements. Here K
≪
P
Q is needed to be satisfied.The number of nonzero rows ofZ matrix is referred to as the sparsity of the solution. There are many recovery algorithms to reconstruct original signal. Popular approaches include greedy sequential search techniques such as matching pursuit and methods based on minimizing diversity measures such as basis pursuit and FOCUSS [21]. Firstly we use orthogonal matching pursuit (OMP) algorithm [22] described as follows.Input. The observation vector y
_
∈
C
n and a measurement matrix Ψ
=
{
ϕ
_
i
,
i
=
1,2
,
…
,
m
}
∈
C
n
×
m.Initialization. Index I
=
∅, residual r
_
=
y
_, and sparse representation z
_
^
=
0
_
∈
C
m.Iteration.
While (stopping criterion false)
i
=
arg max
⁡
|
〈
r
_
,
ϕ
_
j
〉
|;
I
=
I
∪
i;
r
_
=
y
_
-
Ψ
:
,
I
Ψ
:
,
I
†
y
_.
End while
z
_
^
(
I
)
=
Ψ
:
,
I
†
y.Output. Sparse representations z
_
^ and the original signal y
_
=
Ψ
z
_
^.Here[
•
]
† is pseudoinverse matrix transformation. Stopping criterion is that iteration times are equal to the known number K of incident sources (i.e., sparsity). In the TDM-MIMO estimation model, we can calculate the DOA and ω
d according to I vector. From I vector we can determine which atom or atoms will be represented; then p and q may be ascertained. From p value DOA may be estimated and ω
d may be estimated from q value successfully.When TDM-MIMO estimation model hasL cycles, that is, Y
=
[
y
_
(
1
)
,
y
_
(
2
)
,
…
,
y
_
(
L
)
], we can solve Z efficiently using joint sparse recovery algorithms [23]. The joint sparse recovery spectrum of the DOA and DFS can be calculated by
(8)
P
y
θ
=
1
L
∑
l
=
1
L
‍
z
^
θ
l
2
,
θ
=
θ
1
,
θ
2
,
…
,
θ
P
Q
.
So if there are multiple snapshots of the received array signals, we will use joint recovery algorithms to estimate the spectrum as formula (8) [24, 25].


## 4. Signal Reconstructions Algorithm for MMV Problem

Only one snapshot (L
=
1) is needed to estimate parameters in sparse representations theory, but in actual application more snapshots are sampled in order to improve SNR and estimation accuracy. In formula (8) computation burden can become larger and larger with the increase of snapshots and the estimation results can be influenced more easily by SNR of input signals. This problem is so called MMV problem. In order to reduce computational load and improve estimation precision, there are two classical kinds of methods to solve MMV problem. One is dependent on SVD algorithm such as l
1-SVD [26, 27]; the other is dependent on M-FOCUSS approach. These two algorithms both take datum correlation of different snapshots into consideration.


### 4.1. Signal Reconstruction Based on SVD

We investigate SVD subspace decomposition method [28, 29] firstly. The following formula is SVD subspace decomposition for Y matrix:
(9)
Y
=
U
Λ
V
H
=
U
s
U
N
Λ
V
H
.
Size of matrices U, Λ, and  V is U
∈
C
N
Virt
×
N
Virt, Λ
∈
C
N
Virt
×
L, and V
∈
C
L
×
L. U
s
∈
C
N
Virt
×
r is signal subspace corresponding to the larger singular values (assuming r) in Λ matrix. U
N
∈
C
N
Virt
×
(
N
Virt
-
r
) is noise subspace corresponding to the smaller singular values (assuming N
Virt
-
r) in Λ matrix. So we can define
(10)
Y
S
=
Y
V
D
r
.
Here D
r
=
Λ
r
×
r
O
r
×
L
-
r
H is a matrix composed by the larger singular values. Also we define Z
S
=
Z
V
D
r, N
S
=
N
V
D
r. So the formula (7) can be espressed as
(11)
Y
S
=
Ψ
·
Z
S
+
N
S
,
Size of matrices Y
S, Z
S, and N
S is Y
S
∈
C
N
Virt
×
r, Z
S
∈
C
P
Q
×
r, and N
S
∈
C
N
Virt
×
r. Y
S and Y have the same sparsity level. By using SVD algorithm the dimension of observation matrix has been reduced from N
Virt
×
L to N
Virt
×
r. In general r
≪
L and r
<
N
Virt is conditioned. Meanwhile we will achieve good performance of parameters estimation in lower SNR. l
1-SVD algorithm is a successful DOA estimation method for sparse solution. But convex optimization problem such as a second-order cone (SOC) programming has to be utilized in l
1-SVD algorithm, so its computational complexity will increase. Here, we will continue to use OMP greedy algorithm after SVD is done. We generalize the scheme of algorithm based on SVD decomposition with OMP.Input. The observation matrix Y and a sparse representations matrix Ψ
=
{
ϕ
_
i
,
i
=
1,2
,
…
,
P
Q
}
∈
C
N
Virt
×
P
Q. Consider the following:(1)
SVD decomposition for matrixY;
(2)
determining the number of the larger singular values (r);
(3)
calculatingY
S
=
Y
V
D
r;
(4)
using OMP algorithm for each column of matrixY
S;
(5)
searching the index atoms in atomic dictionary.Output. DOA and DFS.


### 4.2. Signal Reconstruction Based on M-FOCUSS

M-FOCUSS algorithm is developed based on the focal underdetermined system solver (FOCUSS) algorithm [30] developed for the single measurement case and it has an ability to utilize multiple measurement vectors to accurately identify the sparsity structure [21]. According to formula (7), we can summarize the scheme as follows so as to compute Z sparse solution.Input. The observation matrix Y and a measurement matrix Ψ
=
{
ϕ
_
i
,
i
=
1,2
,
…
,
m
}
∈
C
n
×
mInitialization.
X
1
=
1
m
×
L, ɛ, p, iternum
=
0.Iteration.
While (X
k
+
1
-
X
k
2
/
X
k
2
>
ɛ, iternum
<
max
⁡
_
iteration)
W
k
+
1
=
diag
⁡
(
c
k
[
i
]
1
-
p
/
2
), with respect to c
k
[
i
]
=
X
k
[
i
]
2;
B
k
+
1
=
[
A
k
+
1
]
†
Y, where A
k
+
1
=
Ψ
W
k
+
1;
X
k
+
1
=
W
k
+
1
B
k
+
1;
iternum
=
iternum
+
1.
End while.Output. Sparse representations matrix Z
^
=
X
k
+
1.Here,x
2
=
(
∑
‍
x
i
2
)
1
/
2 is Frobenius norm and ɛ is threshold to stop the whole algorithm. The parameter p lies in [
0,2
]. According to experiences, the best selection for p lies in [
0.8,1
] so that convergence rate is good and optimum solution can be achieved easily. The optimal solution is conditioned by the minimum Frobenius norm with weighted values, so matrix W
k is the kth iterative weighted matrix.By using M-FOCUSS algorithm we can achieve sparse representations matrixZ
^ and deal with MMV problem successfully. Furthermore, we can use formula (8)  P
y
(
θ
)
=
1
/
L
∑
l
=
1
L
z
^
θ
(
l
)
2, where z
^
θ
(
l
) is the row vector of matrix Z
^ to calculate the joint sparse recovery spectrum function. Then the positions of peaks of spectrum function are the DFS and DOA estimation values and number of peaks is the number of input signals with different DFSs and DOAs.


## 4.1. Signal Reconstruction Based on SVD

We investigate SVD subspace decomposition method [28, 29] firstly. The following formula is SVD subspace decomposition for Y matrix:
(9)
Y
=
U
Λ
V
H
=
U
s
U
N
Λ
V
H
.
Size of matrices U, Λ, and  V is U
∈
C
N
Virt
×
N
Virt, Λ
∈
C
N
Virt
×
L, and V
∈
C
L
×
L. U
s
∈
C
N
Virt
×
r is signal subspace corresponding to the larger singular values (assuming r) in Λ matrix. U
N
∈
C
N
Virt
×
(
N
Virt
-
r
) is noise subspace corresponding to the smaller singular values (assuming N
Virt
-
r) in Λ matrix. So we can define
(10)
Y
S
=
Y
V
D
r
.
Here D
r
=
Λ
r
×
r
O
r
×
L
-
r
H is a matrix composed by the larger singular values. Also we define Z
S
=
Z
V
D
r, N
S
=
N
V
D
r. So the formula (7) can be espressed as
(11)
Y
S
=
Ψ
·
Z
S
+
N
S
,
Size of matrices Y
S, Z
S, and N
S is Y
S
∈
C
N
Virt
×
r, Z
S
∈
C
P
Q
×
r, and N
S
∈
C
N
Virt
×
r. Y
S and Y have the same sparsity level. By using SVD algorithm the dimension of observation matrix has been reduced from N
Virt
×
L to N
Virt
×
r. In general r
≪
L and r
<
N
Virt is conditioned. Meanwhile we will achieve good performance of parameters estimation in lower SNR. l
1-SVD algorithm is a successful DOA estimation method for sparse solution. But convex optimization problem such as a second-order cone (SOC) programming has to be utilized in l
1-SVD algorithm, so its computational complexity will increase. Here, we will continue to use OMP greedy algorithm after SVD is done. We generalize the scheme of algorithm based on SVD decomposition with OMP.Input. The observation matrix Y and a sparse representations matrix Ψ
=
{
ϕ
_
i
,
i
=
1,2
,
…
,
P
Q
}
∈
C
N
Virt
×
P
Q. Consider the following:(1)
SVD decomposition for matrixY;
(2)
determining the number of the larger singular values (r);
(3)
calculatingY
S
=
Y
V
D
r;
(4)
using OMP algorithm for each column of matrixY
S;
(5)
searching the index atoms in atomic dictionary.Output. DOA and DFS.


## 4.2. Signal Reconstruction Based on M-FOCUSS

M-FOCUSS algorithm is developed based on the focal underdetermined system solver (FOCUSS) algorithm [30] developed for the single measurement case and it has an ability to utilize multiple measurement vectors to accurately identify the sparsity structure [21]. According to formula (7), we can summarize the scheme as follows so as to compute Z sparse solution.Input. The observation matrix Y and a measurement matrix Ψ
=
{
ϕ
_
i
,
i
=
1,2
,
…
,
m
}
∈
C
n
×
mInitialization.
X
1
=
1
m
×
L, ɛ, p, iternum
=
0.Iteration.
While (X
k
+
1
-
X
k
2
/
X
k
2
>
ɛ, iternum
<
max
⁡
_
iteration)
W
k
+
1
=
diag
⁡
(
c
k
[
i
]
1
-
p
/
2
), with respect to c
k
[
i
]
=
X
k
[
i
]
2;
B
k
+
1
=
[
A
k
+
1
]
†
Y, where A
k
+
1
=
Ψ
W
k
+
1;
X
k
+
1
=
W
k
+
1
B
k
+
1;
iternum
=
iternum
+
1.
End while.Output. Sparse representations matrix Z
^
=
X
k
+
1.Here,x
2
=
(
∑
‍
x
i
2
)
1
/
2 is Frobenius norm and ɛ is threshold to stop the whole algorithm. The parameter p lies in [
0,2
]. According to experiences, the best selection for p lies in [
0.8,1
] so that convergence rate is good and optimum solution can be achieved easily. The optimal solution is conditioned by the minimum Frobenius norm with weighted values, so matrix W
k is the kth iterative weighted matrix.By using M-FOCUSS algorithm we can achieve sparse representations matrixZ
^ and deal with MMV problem successfully. Furthermore, we can use formula (8)  P
y
(
θ
)
=
1
/
L
∑
l
=
1
L
z
^
θ
(
l
)
2, where z
^
θ
(
l
) is the row vector of matrix Z
^ to calculate the joint sparse recovery spectrum function. Then the positions of peaks of spectrum function are the DFS and DOA estimation values and number of peaks is the number of input signals with different DFSs and DOAs.


## 5. Simulation Experiments

We present some simulations to verify the theoretical results below. We consider a TDM-MIMO radar with 4 RX and 2 TX antennas, uniformly spaced with an antenna distance ofλ
/
2; that is, d
_
RX
=
1
2
3
4
T and d
_
TX
=
0
5
T. The antennas are laid as shown in Figure 4. The TX antennas transmit signal in TDM schedule and transmit schedule is shown in Figure 5.Figure 4
Array construction of antennas.Figure 5
TDM scheme: 2 transmitters transmitting at times.We choose 1 cycle withN
Pulse
=
4 pulses and set the transmitting time instants to t
_
=
[
0,1
,
2,3
] in units of ms. So d
_
Pulse
=
[
d
1
TX
,
d
2
TX
,
d
2
TX
,
d
1
TX
] will be achieved. The basic simulation parameters are set as follows. The carrier frequency is equal to 77 GHz. DOA search range lies in [
-
6
0
∘
,
6
0
∘
] with step size 0
.
1
∘ and velocity search range lies in [0 m/s, 100 m/s] with step size 1 m/s. Snapshots are equal to L
=
200. We do two experiments: one is for measurement of the root mean square errors (RMSE) of velocity and DOA estimation in different SNRs; the other is for multisource resolution of the coherent and uncorrelated signals.


### 5.1. Simulation Experiments of Joint DFS and DOA Estimation RMSE

500 independent Monte Carlo simulations are carried out for each SNR varying from 0 dB to 30 dB with 5 dB step. The true DOA of incident signal and velocity of target moving are selected randomly in each trial. But DOA and velocity parameters set in one trial are constant. Velocity estimation is shown in Figure6 and DOA estimation is shown in Figure 7. As we know, the formula ω
d
=
2
v
/
λ, where v is moving velocity of the target. So velocity simulation results are given directly instead of DFS due to the consideration of more concerned velocity parameter in the practical application. JS-RS stands for algorithm of the joint sparse recovery spectrum of DFS and DOA according to formula (8). SVD-RS stands for algorithm of joint estimation based on sparse representations using SVD with OMP algorithm to reconstruction; see formula (11) and scheme. MFOCUSS-SR stands for improved M-FOCUSS algorithm with joint sparse recovery spectrum. Root mean square error (RMSE) is defined by
(12)
RMSE
=
1
J
∑
j
=
1
J
‍
θ
^
j
-
θ
j
2
1
/
2
,
where J is the times of independent Monte Carlo trials, θ
^
j stands for parameter estimation, and θ
j is the true DOA or velocity for the jth trial.Figure 6
Velocity estimation for TDM-MIMO radar.Figure 7
DOA estimation for TDM-MIMO radar.Following [1], we compute CRLB J
-
1 for the unknown parameter Θ
_
=
[
DOA
,
DFS
]
T. The CRLB is a lower bound for the covariance matrix of any unbiased estimator Θ
_
^. We use CRLB formula for DOA estimation (CR
B
DOA) according to paper [1]. The following formulas are the Cramer-Rao bounds of Θ
_
^:
(13)
J
-
1
=
1
2
L
N
RX
σ
2
σ
s
2
·
1
×
Va
r
S
d
_
RX
+
Va
r
S
d
_
Pulse
Va
r
S
(
t
_
)
Co
v
S
d
_
Pulse
,
t
_
2
k
k
k
k
k
k
k
k
k
k
k
-
Co
v
S
d
_
Pulse
,
t
_
2
-
1
·
Va
r
S
t
_
-
Co
v
S
d
_
Pulse
,
t
_
-
Co
v
S
d
_
Pulse
,
t
_
Va
r
S
d
_
RX
+
Va
r
S
d
_
Pulse
,
(14)
CR
B
DOA
=
J
11
-
1
=
1
2
L
N
RX
σ
2
σ
s
2
·
Va
r
S
t
_
×
Va
r
S
d
_
RX
+
Va
r
S
d
_
Pulse
Va
r
S
t
_
Co
v
S
d
_
Pulse
,
t
_
2
k
k
k
k
k
k
k
k
-
Co
v
S
d
_
Pulse
,
t
_
2
-
1
.
Here Va
r
S
(
•
) stands for sample variance and Co
v
S
(
•
,
*
) stands for sample covariance. σ
s
2
/
σ
2 denotes the overall SNR. If an optimal TDM scheme is designed [1], CR
B
DOA will be minimized and |
Co
v
S
(
d
_
Pulse
,
t
_
)
| will also be minimized to zero.From the simulation results, we know that the error of angle measurements can reach below0
.
2
∘ when SNR > 5 dB is satisfied for all three algorithms. But the error of velocity is not ideal for the JS-SR method under the same conditions. Only when SNR > 20 dB is satisfied, the error of velocity will reach v
=
2
m
/
s below. But the SVD-RS and MFOCUSS-RS algorithms can achieve significant performance improvement. DOA estimation results of these two algorithms are closer to the corresponding Cramer-Rao lower bound (CRLB) compared to JS-RS algorithm. So both MFOCUSS-RS and SVD-SR are superior to JS-SR algorithm.


### 5.2. Simulation Experiments of Multisignals Resolution

Here, we have utilized these three algorithms to test coherent and uncorrelated signals resolution. Experiments have the same input conditions that are SNR = 20 dB and the true DOA of three simultaneous incident signals is[
-
2
5
∘
0
∘
2
5
∘
]. Correlated coefficient is defined by
(15)
ρ
i
k
=
E
s
i
t
s
k
H
t
E
s
i
t
2
E
s
k
t
2
.
Here E
[
•
] denotes statistical expectation operator. i, k denote two input signals. If ρ
i
k which lies in [
0,1
] is equal to 1, two input signals will be called as coherent signals.The signal resolution simulation results are presented in Figure8 to Figure 13. In Figures 8, 9, 10, 11, 12, and 13, E_DOA stands for estimation DOA and R_DOA stands for true DOA. All three algorithms can process uncorrelated signals. But there are some spurious peaks for resolution results of JS-SR approach and the magnitude of spurious peaks may be larger than the magnitude of true input signal in some cases like Figure 8. So it is very complex to seek the different peak values of true DOAs. The improved M-FOCUSS algorithm can work well. The magnitude of spurious peaks is smaller than the magnitude of true DOAs like in Figure 12. With the increase of SNR, the magnitude of spurious peaks can also become smaller and smaller. In the situation of coherent signals impinging, all three algorithms have an ability to complete multisource resolution. But the problem of spurious peaks still exists for JS-SR algorithm. Accuracy of DOA estimation for SVD-SR algorithm has deteriorated since the rank of matrix Λ is reduced and then we have to select one vector corresponding to the largest singular value to calculate the sparse solution.Figure 8
Uncorrelated signal resolution simulation based JS-SR.Figure 9
Coherent signal resolution simulation based JS-SR.Figure 10
Uncorrelated signal resolution simulation based SVD-SR.Figure 11
Coherent signal resolution simulation based SVD-SR.Figure 12
Uncorrelated signal resolution simulation based MFOCUSS-SR.Figure 13
Coherent signal resolution simulation based MFOCUSS-SR.Above all, the improved M-FOCUSS algorithm can work more robust than SVD-SR and JS-SR algorithms. Multisource resolution is successful and DFS and DOA estimation values are very precise regardless of correlated or uncorrelated input signals when the improved M-FOCUSS algorithm is utilized to deal with TDM-MIMO model.


## 5.1. Simulation Experiments of Joint DFS and DOA Estimation RMSE

500 independent Monte Carlo simulations are carried out for each SNR varying from 0 dB to 30 dB with 5 dB step. The true DOA of incident signal and velocity of target moving are selected randomly in each trial. But DOA and velocity parameters set in one trial are constant. Velocity estimation is shown in Figure6 and DOA estimation is shown in Figure 7. As we know, the formula ω
d
=
2
v
/
λ, where v is moving velocity of the target. So velocity simulation results are given directly instead of DFS due to the consideration of more concerned velocity parameter in the practical application. JS-RS stands for algorithm of the joint sparse recovery spectrum of DFS and DOA according to formula (8). SVD-RS stands for algorithm of joint estimation based on sparse representations using SVD with OMP algorithm to reconstruction; see formula (11) and scheme. MFOCUSS-SR stands for improved M-FOCUSS algorithm with joint sparse recovery spectrum. Root mean square error (RMSE) is defined by
(12)
RMSE
=
1
J
∑
j
=
1
J
‍
θ
^
j
-
θ
j
2
1
/
2
,
where J is the times of independent Monte Carlo trials, θ
^
j stands for parameter estimation, and θ
j is the true DOA or velocity for the jth trial.Figure 6
Velocity estimation for TDM-MIMO radar.Figure 7
DOA estimation for TDM-MIMO radar.Following [1], we compute CRLB J
-
1 for the unknown parameter Θ
_
=
[
DOA
,
DFS
]
T. The CRLB is a lower bound for the covariance matrix of any unbiased estimator Θ
_
^. We use CRLB formula for DOA estimation (CR
B
DOA) according to paper [1]. The following formulas are the Cramer-Rao bounds of Θ
_
^:
(13)
J
-
1
=
1
2
L
N
RX
σ
2
σ
s
2
·
1
×
Va
r
S
d
_
RX
+
Va
r
S
d
_
Pulse
Va
r
S
(
t
_
)
Co
v
S
d
_
Pulse
,
t
_
2
k
k
k
k
k
k
k
k
k
k
k
-
Co
v
S
d
_
Pulse
,
t
_
2
-
1
·
Va
r
S
t
_
-
Co
v
S
d
_
Pulse
,
t
_
-
Co
v
S
d
_
Pulse
,
t
_
Va
r
S
d
_
RX
+
Va
r
S
d
_
Pulse
,
(14)
CR
B
DOA
=
J
11
-
1
=
1
2
L
N
RX
σ
2
σ
s
2
·
Va
r
S
t
_
×
Va
r
S
d
_
RX
+
Va
r
S
d
_
Pulse
Va
r
S
t
_
Co
v
S
d
_
Pulse
,
t
_
2
k
k
k
k
k
k
k
k
-
Co
v
S
d
_
Pulse
,
t
_
2
-
1
.
Here Va
r
S
(
•
) stands for sample variance and Co
v
S
(
•
,
*
) stands for sample covariance. σ
s
2
/
σ
2 denotes the overall SNR. If an optimal TDM scheme is designed [1], CR
B
DOA will be minimized and |
Co
v
S
(
d
_
Pulse
,
t
_
)
| will also be minimized to zero.From the simulation results, we know that the error of angle measurements can reach below0
.
2
∘ when SNR > 5 dB is satisfied for all three algorithms. But the error of velocity is not ideal for the JS-SR method under the same conditions. Only when SNR > 20 dB is satisfied, the error of velocity will reach v
=
2
m
/
s below. But the SVD-RS and MFOCUSS-RS algorithms can achieve significant performance improvement. DOA estimation results of these two algorithms are closer to the corresponding Cramer-Rao lower bound (CRLB) compared to JS-RS algorithm. So both MFOCUSS-RS and SVD-SR are superior to JS-SR algorithm.


## 5.2. Simulation Experiments of Multisignals Resolution

Here, we have utilized these three algorithms to test coherent and uncorrelated signals resolution. Experiments have the same input conditions that are SNR = 20 dB and the true DOA of three simultaneous incident signals is[
-
2
5
∘
0
∘
2
5
∘
]. Correlated coefficient is defined by
(15)
ρ
i
k
=
E
s
i
t
s
k
H
t
E
s
i
t
2
E
s
k
t
2
.
Here E
[
•
] denotes statistical expectation operator. i, k denote two input signals. If ρ
i
k which lies in [
0,1
] is equal to 1, two input signals will be called as coherent signals.The signal resolution simulation results are presented in Figure8 to Figure 13. In Figures 8, 9, 10, 11, 12, and 13, E_DOA stands for estimation DOA and R_DOA stands for true DOA. All three algorithms can process uncorrelated signals. But there are some spurious peaks for resolution results of JS-SR approach and the magnitude of spurious peaks may be larger than the magnitude of true input signal in some cases like Figure 8. So it is very complex to seek the different peak values of true DOAs. The improved M-FOCUSS algorithm can work well. The magnitude of spurious peaks is smaller than the magnitude of true DOAs like in Figure 12. With the increase of SNR, the magnitude of spurious peaks can also become smaller and smaller. In the situation of coherent signals impinging, all three algorithms have an ability to complete multisource resolution. But the problem of spurious peaks still exists for JS-SR algorithm. Accuracy of DOA estimation for SVD-SR algorithm has deteriorated since the rank of matrix Λ is reduced and then we have to select one vector corresponding to the largest singular value to calculate the sparse solution.Figure 8
Uncorrelated signal resolution simulation based JS-SR.Figure 9
Coherent signal resolution simulation based JS-SR.Figure 10
Uncorrelated signal resolution simulation based SVD-SR.Figure 11
Coherent signal resolution simulation based SVD-SR.Figure 12
Uncorrelated signal resolution simulation based MFOCUSS-SR.Figure 13
Coherent signal resolution simulation based MFOCUSS-SR.Above all, the improved M-FOCUSS algorithm can work more robust than SVD-SR and JS-SR algorithms. Multisource resolution is successful and DFS and DOA estimation values are very precise regardless of correlated or uncorrelated input signals when the improved M-FOCUSS algorithm is utilized to deal with TDM-MIMO model.


## 6.  Conclusions

In this paper, we propose joint DFS and DOA estimation algorithm for colocated TDM-MIMO radar based signal sparse representations. Facing the problem of time varying steering vector, we establish input signal mode and depict the algorithms of sparse representations and signal reconstruction in detail. Three algorithms including joint sparse recovery spectrum, SVD decomposition with OMP algorithm, and M-FOCUSS are discussed to deal with MMV problem. The joint sparse recovery spectrum and M-FOCUSS methods are combined to improve M-FOCUSS performance in the case of MMV problem. Finally, the simulation results of multisource resolution and accuracy of estimations and some discussions are demonstrated. Using sparse representations based on the proposed angle-frequency space, the coherent signals can be distinguished and the Doppler frequency shift and DOA can be estimated jointly. Particularly, the joint estimation algorithm based on sparse representations using improved M-FOCUSS reconstruction can deal with MMV problem and achieve significant performance improvement of DOA and DFS estimation accuracy. So the proposed algorithm and model are effective and can be further applied for practical application.



---

*Source: 421391-2014-11-16.xml*