Professional Documents
Culture Documents
TWO L-SHAPED ARRAY-BASED 2-D DOAS ESTIMATION IN THE PRESENCE OF MUTUAL COUPLING
J. Liang and D. Liu
School of Automation & Information Engineering
Xian University of Technology
Xian, China
274
1. INTRODUCTION
Estimation of two-dimensional (2-D) directions-of -arrival (DOAs)
plays an important role in array signal processing fields such as
mobile communication, radar, sonar, and radio astronomy [15].
This issue can be divided into several topics: i) array geometry [3
8]; ii) estimation method [912]; iii) match of separately obtained
estimations [1326] (Note that parameter match operation is a key step
in the 2-D DOAs estimation problem, and the failure in pairing will
cause severe performance degradation); iv) the mutual coupling effect
among multiple sensors can not be ignored since it may cause severe
performance degradation [2737], as shown in the linear array [32, 35],
the circular array [2729], the rectangular array [30], and the hexagon
array [31]; and v) the
q estimation failure problem, i.e., the elevation
estimator
l = asin( l2 + 2l /(2d)) may fail since the estimation
q
of {l , l } causes
l2 + 2l /(2d) > 1, especially when elevation
angle is between 70 and 90 that is often encountered in mobile
communication, as shown in [8, 16].
Comparing with the parallel uniform linear array, the rectangular
array, and the circular array, the L-shaped array (LSA) [68, 13
15, 25], especially two L-shaped array (TLSA) [6, 8], has received a
significant amount of attention due to some advantages in low CRLB [6]
and independent implementation of multiple uniform linear subarrays.
Tayem and Kwon proposed a TLSA-based propagator method for 2D DOAs estimation [8]. However, it cannot provide a reasonable
mechanism on matching the separately obtained estimations [13, 15]
(i.e., the third topic of the above-mentioned estimation issue). Besides,
it does not consider the mutual coupling effect among multiple sensors
(i.e., the fourth topic of the above-mentioned estimation issue) [8].
In this paper, we develop a new TLSA-based 2-D DOAs estimation
algorithm. The key points of this paper are: i) using some particularly
selecting matrices, a trilinear model is constructed to compensate the
effect of mutual coupling on three subarrays. In addition, the steering
vector is restored using the trilinear alternating least square method;
ii) 2-D DOAs are estimated from the properly chosen elements of the
restored steering vector to avoid pairing parameters and the severe
performance degradation resulted from the failure in pairing; and iii)
a new elevation estimator is designed to avoid estimation failure.
In fact, Sidiropoulos et al. have developed a rectangular arraybased 2-D DOAs estimation method using the trilinear model [40].
We stress that there are some obvious differences between the method
in [40] and the proposed algorithm except the common use of the
275
proposed algorithm uses the two L-shaped array and three electric
angles to form a new estimator, thus avoiding estimation failure; and
iii) the proposed algorithm considers the effect of mutual coupling,
which is not considered in [40].
The rest of this paper is organized as follows. The signal model
is introduced in Section 2. A new algorithm is developed in Section 3.
Simulation results are presented in Section 4. Conclusions are drawn
in Section 5.
2. SIGNAL MODEL AND TRILINEAR MODEL
2.1. Signal Model
Consider two L-shaped array (TLSA) of 3M +1 omnidirectional sensors
with element spacing d shown in Fig. 1 [6, 8]. The element placed at
the origin is set for the referencing point. The array consists of two
..
.. . . .
.
z
s l (k)
(0,0,Md)
(0,0,(M-1) d)
..
.
(0,0,d)
.
.
(d,0,0)
((M-1) d,0,0)
(Md,0,0)
...
(0,d,0)
(0,Md,0)
(0,0,(M-1) d)
276
L-shaped subarrays, one being in the x-z plane and another being in
the y-z plane. Assume that L far-field narrowband sources impinging
on the TLSA. Let l and l be the elevation and azimuth angles of the
lth source, and thus the wave vector l containing DOA information
can be defined as [16]
l = [sin l cos l , sin l sin l , cos l ] ,
l = 1, . . . , L.
(1)
L
X
l=1
(2)
where r(k), A, s(k), and n(k) stand for the received signal vector, the
ideal steering matrix, the source signal vector, and the noise vector,
respectively. They can be expressed as
r(k) = [r1,0,0 (k) . . . rM,0,0 (k) r0,0,0 (k)r0,1,0 (k) . . . r0,M,0 (k)
r0,0,1 (k) . . . r0,0,M (k)] ,
(3)
A = [a(1 , 1 , 1 ) . . . a(l , l , l ) . . . a(L , L , L )] ,
(4)
s(k) = [s1 (k), . . . , sl (k), . . . , sL (k)]T ,
h
iT
a(l , l , l ) = ejl . . . ejM l 1 ejl . . . ejM l ejl . . . ejM l ,
(5)
(6)
and
n(k) = [n1,0,0 (k) . . . nM,0,0 (k) n0,0,0 (k) n0,1,0 (k) . . . n0,M,0 (k)
n0,0,1 (k) . . . n0,0,M (k)]T ,
(7)
(8)
(9)
l = 2d cos l /.
(10)
and
References [30, 36, 37] show that the coupling between neighboring elements with the same interspace is almost the same, and the magnitude
of the mutual coupling coefficient between two distant elements is so
small that it can be approximated to zero. Thus, it is often sufficient
277
to consider the coupling model with just a few nonzero coefficients and
a banded symmetric Toeplitz matrix can be used as the model for the
mutual coupling coefficients. Similar to [30, 36, 37], this paper assumes
that the (m, p, q)th sensor is only affected by the sensors inside
or on
the related sphere centered at (md, pd, qd) and with radius 2d (Although
we assume each sensor is affected by those within the range
2d in this paper, the proposed algorithm can be tuned to be applicable to other ranges), i.e., the (m, p, q)th sensor is affected by the (m +
m, p + p, q + q)th sensor if and only if m, p, q {1, 0, 1},
p
(m)2 + (p)2 + (q)2 < 2, and (m + m, p + p, q + q)
{(1, 0, 0), . . . , (M, 0, 0), (0, 0, 0), (0, 1, 0), . . . , (0, M, 0), (0, 0, 1), . . . , (0, 0,
M )}. For example, the (0, 1, 0)th sensor is affected by the (0, 2, 0)th,
(0, 0, 0)th, (1, 0, 0)th, and (0, 0, 1)th sensors, whereas the (0, 2, 0)th sensor is affected by the (0, 1, 0)th, and (0, 3, 0)th sensors. Note that when
m 2, the (m, 0, 0)th sensor is affected only by the (m + 1, 0, 0)th and
(m 1, 0, 0)th sensors, and no longer affected by other sensors. The
similar case holds for q 2 or p 2. The mutual coupling matrix C
can be represented as:
D1 d3 D2 D2
dT 1 dT3 dT3
C= 3
,
(11)
D2 d3 D1 D2
D2 d3 D2 D1
where the M M -dimensional mutual coupling matrix D1 within any
subarray is a banded symmetric Toeplitz matrix, i.e.,
1 c1 0
0 ... 0
c1 1 c1 0 . . . 0
0 c1 1 c1 . . . 0
D1 = .. . . . . . . . .
,
(12)
..
.
.
.
.
.
.
0 . . . 0 c1 1 c1
0 ... 0
0 c1 1 M M
c1 |{z}
0
d3 =
,
(13)
M 1
c2
0
|{z}
1(M 1)
D2 =
0
0
|{z}
|{z}
(M 1)1
(M 1)(M 1)
M M
(14)
278
F
X
(15)
f =1
i = 1, . . . , I.
(16)
279
280
0
I
0
|{z}
|{z}
|{z}
W1 =
,
(18)
(M 2)1
(M 2)(M 2)
(M 2)(2M +2)
and the output of the {(2, 0, 0), (3, 0, 0), . . . , (M 1, 0, 0)}th sensors on
the x-axis can be represented as:
W1 r(k) = W1 (CAs(k)+n(k)) =
L
X
l=1
(19)
W1 Ca(l , l , l ) =
j(M
3)
j(M
2)
j(M
1)
l
l
l
c1 e
+e
+ c1 e
c1 ej(M 2)l + ej(M 1)l + c1 ejM l
1
1
ejl
ejl
j
..
..
= c1 e l + ej2l + c1 ej3l
=
(
)
(20)
l
j(M.4)
j(M.4)
l
l
e
ej(M 3)l
ej(M 3)l
and (l ) = (c1 ejl + ej2l + c1 ej3l ), which can be considered as a disturbance on the steering vector [ 1 ejl . . . ej(M 4)l ej(M 3)l ]T
of virtual uniform linear array. From Eq. (17), we can see that although the {(2, 0, 0), (3, 0, 0), . . . , (M 1, 0, 0)}th sensors are affected
by the mutual coupling, there are still linear phase delay characteristics
among these sensors.
Similarly, we define the second (M 2) (3M + 1)-dimensional
selecting matrix:
0
I
0
|{z}
|{z}
|{z}
W2 =
(21)
(M 2)(M +2)
(M 2)(M 2)
(M 2)(M +1)
281
and the output of the {(0, 2, 0), (0, 3, 0), . . . , (0, M 1, 0)}th sensors on
the y-axis can be represented as:
W2 r(k)=W2 (CAs(k) + n(k)) =
L
X
l=1
(22)
W2 Ca(l , l , l ) =
1
1
ejl
ejl
..
..
jl
j2l
j3l
= c1 e + e
+ c1 e
=
(
)
(23)
l
j(M.4)
j(M.4)
l
l
e
e
j(M
3)
j(M
3)
l
l
e
e
0
I
0
|{z}
|{z}
|{z}
W3 =
(24)
(M 2)(2M +2)
(M 2)(M 2)
(M 2)1
and the output of the {(0, 0, 2), (0, 0, 3), . . . , (0, 0, M 1)}th sensors on
the z-axis can be represented as:
W3 r(k)=W3 (CAs(k) + n(k)) =
L
X
l=1
W3 Ca(l , l , l ) =
(25)
282
ejl
ejl
..
..
=
(
)
= c1 ejl + ej2l + c1 ej3l
(26)
l
j(M.4)
j(M.4)
l
l
e
e
j(M
3)
j(M
3)
l
l
e
e
j
yields
The eigenvalue decomposition (EVD) of R
H
= UVUH = Us Vs UH
R
s + Un Vn Un
(28)
W11 = |{z}
0
I
|{z}
0
|{z}
(29)
(30)
283
where
B() = [b(1 ) . . . b(l ) . . . b(L )] ,
h
iT
b(l ) = 1 ejl . . . ej(M 4)l ,
(31)
(32)
1 = diag {(1 ), . . . , (l ), . . . , (L )} .
(33)
W12 = |{z}
0
I
|{z}
0
|{z}
(34)
W21 =
0
|{z}
I
|{z}
0
|{z}
(35)
W22 =
0
|{z}
I
|{z}
0
|{z}
(36)
W31 =
0
|{z}
I
|{z}
0
|{z}
(37)
W32 =
0
|{z}
I
|{z}
0
|{z}
(38)
=
=
=
=
=
(39)
(40)
(41)
(42)
(43)
where
B() = [b(1 ) . . . b(l ) . . . b(L )] ,
h
iT
b(l ) = 1 ejl . . . ej(M 4)l ,
(44)
(46)
(45)
284
h
iT
b(l ) = 1 ejl . . . ej(M 4)l ,
(47)
2 = diag {(1 ), . . . , (l ), . . . , (L )} ,
3 = diag {(1 ), . . . , (l ), . . . , (L )} ,
(48)
(49)
(50)
(51)
(52)
(56)
2 T,
(57)
3 T.
(58)
X2 = (W3 Us ) W4 Us = T
X3 = (W5 Us ) W6 Us = T
diag1 (1 )
D = diag1 (2 ) .
diag1 (3 )
(59)
(60)
285
X1
Hdiag1 (D)
T
(61)
min X2 Hdiag2 (D) W
W
X
Hdiag (D)
3
Hdiag1 D "
#
X1
Hdiag D
X2 .
(62)
W =
2
X
3
Hdiag3 D
Similarly, from the second way of slicing the 3-D data Yl =
Wdiagl (H)DT , l = 1, 2, . . . , L, the cost function can be formed as
following:
Y1
Wdiag1 (H)
Y2 Wdiag2 (H) T
D .
min
(63)
..
...
D
.
WdiagL (H)
L
F
It follows that the conditional (while keeping H and W fixed) least
squares update for D is
T
Wdiag1 (H) # Y1
Wdiag (H) Y2
2
.
D =
.
(64)
..
..
.
WdiagL (H)
YL
Finally, from the third way of slicing the 3-D data Zl = Ddiagl (W)HT ,
l = 1, 2, . . . , L, the cost function can be formed as following:
Z1
Ddiag1 (W)
Z2 Ddiag2 (W) T
min ..
(65)
..
H .
H
.
.
Ddiag (W)
L
286
T
Ddiag1 (W) # Z1
Ddiag (W) Z2
2
.
H =
.
(66)
..
..
.
DdiagL (W)
ZL
According to Eqs. (62), (64), and (66), the matrices D, H, and
W are not updated with least squares until convergence. Thus, the
steering matrix CA can be restored as follows:
CA = Us H
(67)
M
2
X
1
CA(i + 1, l)
l =
,
(68)
M 3
CA(i, l)
i=2
2M
1
X
1
CA(i + 1, l)
l =
,
(69)
M 3
CA(i, l)
i=M +3
l =
1
M 3
3M
1
X
i=2M +3
CA(i + 1, l)
.
CA(i, l)
(70)
As shown in q
[8, 16], since the imperfect estimation of (
l , l )
can results in 2d l2 + 2l being greater than unity especially when
elevation angles are between 70 and 90 , causing the calculation
of
q
l
20 , the estimation accuracy of the estimator acos( 2d
) in the region
[0 , 20 ] is lower than other regions [8] (see the first experiment for
details).
How to design an efficient estimator, which can: i) q
avoid the
estimation failure and low estimation accuracy of asin( 2d l2 + 2l )
for the region [70 , 90 ] ; and ii) avoid the low estimation accuracy of
287
l
for the region [0 , 20 ]? Note that sin(70 ) = cos(20 )
acos 2d
0.9, which provides an important clue for designing the abovel
mentioned estimator. Therefore, this paper combines acos( 2d
) and
q
2
2
asin( 2d l + l ), sets the threshold 0.9, and give the new estimator
by for elevation angle as follows:
q
1
2
2
2 acos 2d + asin 2d l + l
2
2
l
if
<
0.9
and
<
0.9
2d
l
l
2d
acos
2d
l
2
2
2
2
asin
l + l
2d
l
2
2
failure
2
2
(72)
3.4. Discussion
Although the total TLSA is affected by mutual coupling and the
disturbances of the three subarrays are different from each other
(i.e., (l ) 6= (l ) 6= (l )), a trilinear model is constructed to
compensate the effect of mutual coupling on the three subarrays using
some particularly selecting matrices.
After the unique invertible matrix T is obtained from the
constructed trilinear model, the steering vector related to any source is
restored. l , l , and l obtained from the restored steering vector are
related to the same source, thus the proposed algorithm avoids pairing
parameters.
q
The estimator asin( 2d l2 + 2l ) may fail and has low estimation
l
accuracy in the region [70 , 90 ], and the estimator acos( 2d
) has low
288
For
q
l
l
all the combinations of 2d and 2d l2 + 2l . In fact, 2d
=
(2d cos l /)
2+
2 = sin
l . When cos
l
=
cos
and
l
l
l
2d
2d
is greater than 0.9, sin
l is certainly
smaller than
0.9. Therefore, the
q
possibility of ( 2d
l2 + 2l 0.9) is zero and the
0.9) and ( 2d
proposed algorithm can efficiently avoids estimation failure.
4. SIMULATION RESULTS
To verify the effectiveness of the proposed algorithm, we implement
the following experiments. In the former three experiments without
mutual coupling, we consider two L-shaped array with 16 elements
with element spacing d = /2. Since some sensors are selected as
auxiliary sensors in the presence of mutual coupling, we consider two
L-shaped array with 25 elements in the fourth experiment.
In the first experiment, we consider a single source case (ej0.2k ):
elevation angle and azimuth angle vary from (0 , 0 ) to (90 , 90 )
with 5 increment. The snapshot number and the SNR are set to 200
and 10 dB, respectively. The received signals are polluted by zero-mean
additive white Gaussian noises. We use the root mean square error
(RMSE) as the performance measure. All results provided are based
on 500 independent runs. For each (, ), we conduct 500 trials, and
count the estimation failure times as well as the averaged performance
only from successful trials (RMSE of elevation angle estimations versus
different azimuth-elevation pair for this single source). Figs. 2 and 3
give the averaged q
performance counted from successful trials of the
289
2
estimator combines the estimators asin( 2d l + 2l ) and acos( 2d
),
q
i.e., in the region [0 , 20 ], the estimator asin( 2d l2 + 2l ) is adopted;
l
in the region [70 , 90 ], the estimator acos( 2d
) is adopted; in the
q
290
291
sources) over 500 Monte Carlo runs are shown in Figs. 8 and 9.
In the fourth experiment, the effect of mutual coupling on the
performance of the proposed algorithm is investigated. Coupling
coefficients c1 = 0.3527 + 0.4584i and c2 = 0.0927 0.1167i.
Two uncorrelated equivalent-power sources (ej0.2k and ej0.25k ),
respectively with 2-D DOA of (1 = 20 , 1 = 20 ) and (2 = 40 , 2 =
292
293
294
295
REFERENCES
1. Pillai, S. U., Array Signal Processing, Springer-Verlag, New York,
1989.
2. Krim, H. and M. Viberg, Two decades of array signal processing
research: The parameter approach, IEEE Signal Process. Mag.,
Vol. 13, No. 4, 6794, Jul. 1996.
3. Kedia, Y. S. and B. Chandna, A new algorithm for 2-D DOA
algorithm, Signal Processing, Vol. 60, No. 3, 325332, Mar. 1997.
4. Zoltowski, M. D., M. Haardt, and C. P. Mathews, Closed-form
2-D angle estimation with rectangular arrays in element space or
beamspace via unitary ESPRIT, IEEE Trans. Signal Processing,
Vol. 44, No. 2, 316328, Feb. 1996.
5. Ramos, J., C. P. Mathews, and M. D. Zoltowski, FCA-ESPRIT:
A closed-form 2-D angle estimation algorithm for filled circular
arrays with arbitrary sampling lattices, IEEE Trans. Signal
Processing, Vol. 47, No. 1, 213217, Jan. 1997.
6. Harabi, F., A. Gharsallah, and S. Marcos, Three-dimensional
antennas array for the estimation of direction of arrival, IET
Microwaves, Antennas and Propagation. Vol. 3, No. 5, 843849,
2009.
7. Hua, Y., T. K. Sarkar, and D. D. Weiner, An L-shape array for
estimation 2-D directions of wave arrival, IEEE Trans. Antennas
and Propagation, Vol. 39, No. 2, 143146, Feb. 1991.
8. Tayem, N. and H. M. Kwon, L-shape 2-dimensional arrival angle
estimation with propagator method, IEEE Trans. Antennas and
Propagation, Vol. 53, No. 5, 16221630, May 2005.
9. Marcos, S., A. Marsal, and M. Benidir, The propagator method
for source bearing estimation, Signal Processing, Vol. 42, No. 2,
121138, 1995.
10. Munier, J. and G. Y. Delisle, Spatial analysis using new
properties of the cross-spectral matrix, IEEE Trans. Signal
Processing, Vol. 39, No. 3, 746749, 1991.
11. Roy, R. and T. Kailath, ESPRIT-estimation of signal parameters
via rotational invariance techniques, IEEE Trans. Acoustics,
Speech, and Signal Processing, Vol. 37, No. 7, 984995, Jul. 1989.
12. Schmidt, R., Multiple emitter location and signal parameter
estimation, IEEE Trans. Antennas and Propagation. Vol. 34,
No. 3, 276280, Mar. 1986.
13. Kikuchi, S., H. Tsuji, and A. Sano, Pair-matching method for
estimating 2-D angle of arrival with a cross-correlation matrix,
296
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
297
298
39.
40.
41.
42.
43.