# Fast Method for DOA Estimation with Circular and Noncircular Signals Mixed Together

Authors: Yaoping Zeng; Yixin Yang; Guangyue Lu; Qiongdan Huang
Journal: Journal of Electrical and Computer Engineering
 (2014)

---

## Abstract

Most of the existing algorithms to estimate the direction of arrival (DOA) of signals deal with the situation that all signals are circular. However, it is quite often in practical engineering that circular and noncircular signals appear in the same time. To effectively detect DOA of signals in such circumstances, we propose a novel algorithm. Firstly, using received data and its conjugate, we can detect more signals because of the doubled array aperture. Secondly, through unitary transform and multistage Wiener filter (MSWF) technology, we can obtain the noise subspace of array without performing eigendecomposition. Finally, by employing the improved MUSIC algorithm,we can acquire the DOA of the mixed circular and noncircular signals through two-stage search. Simulation results clearly demonstrate the effectiveness of the proposed algorithm.


---

## Body

## 1. Introduction

In the array signal processing, as a kernel technology, direction of arrival (DOA) estimation for narrowband plane wave has received a significant amount of attention and it has been extensively applied in the field of radar, mobile communication, sonar, and seismology. As the typical subspace high-resolution DOA estimation algorithms, multiple signal classification (MUSIC) algorithm and estimation of signal parameters via rotational invariance technique (ESPRIT) algorithm [1] have become popular and have received significant amount of attention due to their high-resolution performance over the last several decades. Recently, some novel methods for DOA estimation have been proposed in [2–5]. In [2], based on modified covariance matching criterion method, Si et al. proposed a novel algorithm which has more precise estimation even with low SNR. Using projection spectrum and eigenspectrum, Huang [3] presented a fast DOA estimation algorithm. Chen et al. [4] proposed a new approach which can be used for direction of departure (DOD) estimation and DOA estimation. In [5], Jančovič et al. proposed an algorithm which is useful when there are more sources than sensors. These algorithms above mentioned enlarge the scope range of DOA estimation; however, all these algorithms usually assume that the incoming signals are circular, but there are many noncircular signals, such as BPSK and GMSK modulated signals in the applications of intelligent antenna systems. People often use BPSK and GMSK signals instead of normal narrow circular signals to conduct DOA estimation in such systems. Utilizing received noncircular signals and their conjugate, the array aperture is doubled and it is possible to estimate more signals than array sensors. Noncircular signals have acquired a lot of attention because of the noncircularity properties. More and more researchers have shown their concerns on using the feature of noncircular to improve the performance of parameters estimation, for example, noncircular root-MUSIC [6], enhancing unitary ESPRIT [7], and MUSIC-like algorithm [8, 9] for noncircular signals. In [10], Abeida and Delmas analyzed explicitly a MUSIC-like algorithm for noncircular signals. In [11], Hassen et al. proposed a new algorithm which can be used for spatially correlated noncircular signals. Abamovich et al. [12] expanded noncircular to 2D space and Yang et al. [13] proposed a low-complexity 2D noncircular algorithm. More recently, the emerging domain of sparse representations has given further interest to the issue of DOA estimation, using sparse representations; Liu et al. [14] proposed a high-precision DOA estimation algorithm for noncircular sources. All these algorithms for noncircular signals above mentioned enlarge the array aperture and can detect more signals. Also, these algorithms have higher resolution than those algorithms corresponding to using circular signals. However, it is more realistic in practical engineering that circular and noncircular signals appear together. It is a realistic problem to estimate signals DOA under such circumstances. The author in [15] brought forward an improved MUSIC algorithm that has good performance when circular and noncircular signals appear together, but it needs eigendecomposition to obtain signal subspace. Because performing eigendecomposition results in heavy computation load to the systems, it is not appropriate to use the improved MUSIC algorithm generated in [15] in actual applications. Recently, Goldstein et al. [16] introduced a multistage Wiener filter (MSWF), adopting the MSWF technique; without the estimation of covariance matrix and its eigendecomposition, the signal subspace can be estimated. Based on MSWF theory, the authors in [17] proposed a fast subspace algorithm for narrowband circular signals; however, this method fails when there are noncircular signals in the received data.In this paper, we propose a fast DOA estimation algorithm at the circumstance of mixed circular and noncircular signals. The paper is organized as follows. In Section2, we introduce the system model that will be used throughout the paper. In Section 3, we introduce improved MUSIC algorithm for mixing circular and noncircular signals. In Section 4, MSWF technique is introduced. In Section 5, we formulate the proposed fast improved MUSIC algorithm for mixed circular and noncircular signals. In Section 6, simulation results confirm the good performance of our proposed fast algorithm. Finally, our conclusion is drawn in Section 7.


## 2. Array and Data Model

Consider unifrom linear array (ULA) composed ofM sensors, regarding first array sonser as the reference; array interspace is d which is equal to λ
/
2 and λ is signal wavelength. Suppose that there are L signals including L
r noncircular signals with direction θ
i
(
i
=
1,2
,
…
,
L
r
) and L
c circular signals with direction θ
i
(
i
=
1,2
,
…
,
L
c
) impinging on the array, where L
=
L
r
+
L
c. The vector of received signal at time t can be modeled as follows:
(1)
X
(
t
)
=
A
(
θ
)
S
(
t
)
+
N
(
t
)
,
where X
(
t
) is array output vector. A
(
θ
)
=
[
a
(
θ
1
)
,
a
(
θ
2
)
,
…
,
a
(
θ
L
)
] is the M
×
L array manifold matrix and a
(
θ
i
)
=
[
1
,
e
j
π
sin
(
θ
i
)
,
…
,
e
j
π
(
M
-
1
)
sin
(
θ
i
)
]
T is steering vector; the operators (
·
)
T denote transpose. Consider S
(
t
)
=
[
S
c
T
(
t
)
S
n
c
T
(
t
)
]
T, where S
c
(
t
)
=
[
s
c
1
(
t
)
,
s
c
2
(
t
)
,
…
,
s
c
L
c
(
t
)
]
T is circular signal vector and S
n
c
(
t
)
=
[
s
n
c
1
(
t
)
,
s
n
c
2
(
t
)
,
…
,
s
n
c
L
r
(
t
)
]
T is noncircular signal vector. Using the nature of noncircular signals, s
n
c
i
(
t
) can be expressed as s
n
c
i
(
t
)
=
e
j
ϕ
i
s
-
n
c
i
(
t
), in which s
-
n
c
i
(
t
) refer to the real of noncircular signal, ϕ
i is initial phase of noncircular signal, and we can get S
n
c
(
t
)
=
Γ
S
-
n
c
(
t
), where Γ
=
diag
⁡
{
e
j
ϕ
i
}, S
-
n
c
(
t
)
=
[
s
-
n
c
1
(
t
)
,
s
-
n
c
2
(
t
)
,
…
,
s
-
n
c
L
r
(
t
)
]
T. Define S
0
(
t
)
=
[
S
-
n
c
T
(
t
)
,
S
c
T
(
t
)
]
T, and signal vector S
(
t
) can be denoted as
(2)
S
(
t
)
=
B
S
0
(
t
)
with B
=
[
Γ
0
0
I
], and I is L
c
×
L
c identity matrix. Substituting formula (2) into formula (1), we can get
(3)
X
(
t
)
=
A
(
θ
)
B
S
0
(
t
)
+
N
(
t
)
in which N
(
t
)
=
[
n
1
(
t
)
,
…
,
n
M
(
t
)
]
T is noise vector; here additional noise is Gaussian white noise.


## 3. Improved MUSIC Algorithm

The key technique of MUSIC algorithm is the orthogonal between with signal subspace and noise subspace, and the steering vectora
(
θ
) belongs to signal subspace which is orthogonal to noise subspace. Using the orthogonal feature, through angle search from 0°~180°, we can obtain the DOA estimation of signals. MUSIC algorithm has good performance when all the signals are circular sources, but it is more realistic that some users transmit circular signals while others send out noncircular signals in practical engineering; in this circumstance, MUSIC algorithm cannot work well. In order to correctly estimate the signals DOA, Gao et al. [15] proposed the improved MUSIC algorithm to cope with a more general scenario where both circular and noncircular signals coexist.Using observed signal vector and its complex conjugate counterpart, get a new vector(4)
y
0
(
t
)
=
[
X
X
*
]
=
[
A
(
θ
)
B
S
0
(
t
)
(
A
(
θ
)
B
S
0
(
t
)
)
*
]
+
[
N
(
t
)
N
(
t
)
*
]
=
A
^
S
^
(
t
)
+
N
^
(
t
)
from which
(5)
A
^
=
[
A
n
c
Γ
A
c
0
(
A
n
c
Γ
)
*
0
A
c
*
]
,
where A
n
c
=
[
a
(
θ
n
c
1
)
,
a
(
θ
n
c
2
)
,
…
,
a
(
θ
n
c
L
r
)
] is manifold matrix about noncircular signals, and A
c
=
[
a
(
θ
c
1
)
,
a
(
θ
c
2
)
,
…
,
a
(
θ
c
L
c
)
] is manifold matrix for circular signals. Consider S
^
(
t
)
=
[
S
-
n
c
T
(
t
)
S
c
T
(
t
)
S
c
H
(
t
)
]
T; 0 represents the M
×
L
c zeros matrix. When L
r
+
2
L
c
≤
2
M, A
^ is full column rank for any θ. Supposing that N snapshots are collected, utilizing y
0
(
t
), we can acquire the array autocovariance matrix. Consider
(6)
R
x
=
E
[
y
0
(
t
)
y
0
(
t
)
H
]
=
A
^
R
^
s
A
^
H
+
σ
n
2
I
2
M
.The operatorsE
{
·
} and (
·
)
H denote expectation and conjugate transpose, respectively; R
^
s
=
E
{
S
^
(
t
)
S
^
H
(
t
)
}. R
^
s is signal autocovariance matrix which is full rank when received signals are not correlated.The eigendecomposition of the positive definite Hermitian matrixR
x can be written as
(7)
R
x
=
U
s
Λ
U
s
H
+
σ
2
U
n
U
n
H
,
where Λ is (
L
r
+
2
L
c
)
×
(
L
r
+
2
L
c
) diagonal matrix. According to the knowledge of space spectrum, we know that R
x has (
L
r
+
2
L
c
) larger eigenvalues and (
2
M
-
L
r
-
2
L
c
) smaller eigenvalues if the received signals are uncorrelated. U
s
=
[
u
1
,
u
2
,
…
,
u
L
r
+
2
L
c
], U
n
=
[
u
L
r
+
2
L
c
+
1
,
…
,
u
2
M
], the columns of U
s contain the signal subspace eigenvectors of R
x, and the columns of U
n contain the noise subspace eigenvectors f R
x.SinceA
^ and U
s span the signal subspace, both of them are orthogonal to the noise subspace spanned by the matrix U
n. We derive DOA estimation by the criteria as follows.For noncircular signals, let us define(8)
G
(
θ
)
=
Z
H
(
θ
)
U
n
U
n
H
Z
(
θ
)
,
where Z
(
θ
)
=
[
a
(
θ
)
0
0
a
*
(
θ
)
]. When received signals come from the direction of θ
n
c
i and G
(
θ
) is rank deficient, so we can use the following formula to estimate noncircular sources DOA:
(9)
P
n
c
(
θ
)
=
1
det
⁡
{
G
(
θ
)
}
=
1
det
⁡
{
Z
H
(
θ
)
U
n
U
n
H
Z
(
θ
)
}
.The prerequisite for using formula (9) is that the number of columns of U
n should be no less than 2; otherwise, G
(
θ
) is rank deficient whatever the θ is. Therefore, correctly using formula (9) is 2
M
-
L
r
-
2
L
c
≥
2.For any direction coming from{
θ
c
1
,
θ
c
2
,
…
,
θ
c
L
c
}, the U
n and A
^ are orthogonal, and we can get formula as follows:
(10)
U
n
H
[
a
(
θ
c
i
)
0
]
=
0
,
U
n
H
[
0
a
*
(
θ
c
i
)
]
=
0
.Consequently, we can apply the following estimator to estimate DOA for circular signals:(11)
P
c
(
θ
)
=
1
a
H
(
θ
)
U
n
1
U
n
1
H
a
(
θ
)
,
where U
n
1
=
U
n
(
1
:
M
,
:
).


## 4. Subspace Estimation by Multistage Wiener Filter

The MSWF technology presented by Goldstein et al. is to find an approximate solution to the Wiener-Hopf equation which does not need the inverse of array covariance matrix. Using multiple decomposition of MSWF, we can obtain estimated signal subspace fast. Figure1 shows the structure of two-stage MSWF.Figure 1
Two-stage orthogonal projection decomposition based on MSWF technique.Using the operatorT
1
=
[
h
1
,
B
1
], we can decompose y
0
(
t
) into two subspaces through orthogonal projection. One subspace is parallel to h
1, and the other subspace named B
1 is orthogonal to h
1. The definition of h
1 can be expressed as follows:
(12)
h
1
=
r
y
0
d
0
(
r
y
0
d
0
)
H
r
y
0
d
0
,
where r
y
0
d
0
=
E
[
y
0
(
t
)
d
0
H
(
t
)
] is cross-correlation function and B
1 is block matrix and it is the null space of r
y
0
d
0. Using T
2
=
[
h
2
,
B
2
], we can deal with y
1
(
t
) by the same method, and then new MSWF has appeared. If the stage of MWSF is big enough, the dimesion of the cross-correlation vector and the row of input data could be declined, untill droping to 1 finally. Using MSWF forward decline, we can attain signal subspace of R
x fast. Through L
r
+
2
L
c stage recursive decomposition, signal subspace U
s could be achieved, which avoid 2
M stage recursive decomposition of the noise subspace, and the whole algorithm computational complexity is decreased.


## 5. Fast Improved MUSIC Algorithm Based on Unitary Transform and MSWF

### 5.1. Unitary Transform for Received Data

Compared with real multiplication, the computational complexity of the complex multiplication is about fourfold. Usually, the array autocovariance matrixR
x is a complex matrix, and the operand of complex matrix is bigger than that of real matrix. If R
x is complex centro-Hermitian, through unitary transform, we can change it into a real matrix.For a given arbitrarily matrixQ, we denote O
~
P as a P
×
P dimension exchange matrix with ones on its antidiagonal and zeros in other places. We say Q is a left-Π-real matrix if it satisfies O
~
p
Q
*
=
Q. Here we define a unitary matrix
(13)
Q
2
n
+
1
=
1
2
[
I
n
0
j
I
n
0
T
2
0
T
O
~
n
0
-
j
O
~
n
]
,
where Q
2
n
+
1 is a left-Π-real matrix when the dimension of matrix is odd. If it is even, we can get a unitary left-Π-real matrix by dropping its center row and center column.SupposeT
p and U
q are p
×
p and q
×
q dimension left-Π-real matrices. Considering the transformation of ϕ, we can obtain
(14)
ϕ
(
M
)
:
M
⟼
T
p
-
1
M
U
q
.For an arbitrarily complex centro-Hermitian matrixM, under the condition that the dimensions are kept the same, we can transform it into a real matrix by (14).In order to exploit the feature of the noncircular signal completely, we construct a novel data vector(15)
Z
=
[
y
0
O
~
2
M
y
0
*
O
~
N
]
.Usingϕ
(
Z
)
=
Q
2
M
Z
Q
2
N, we can obtain the corresponding real matrix of Z.


### 5.2. Fast Improved MUSIC Algorithm

Although we can utilize improved MUSIC algorithm to conduct DOA estimation in the circumstance that circular and noncircular signals coexist, it is difficult to use it in practical engineering because of the heavy computational burden of the algorithm. The improved MUSIC algorithm can get the noise subspace through eigendecomposition, while it is time-consuming to compute the eigendecomposition, so the improved MUSIC algorithm is not suitable. If we want to use it in practice, we must reduce the computational load of the algorithm. Using unitary transform and MSWF, we can get a fast improved MUSIC algorithm. Here we suppose that the stage decline number of signal subspace isL
r
+
2
L
c, the stage decline number of noise subspace is 2
M, and L
r
+
2
L
c is far less than 2
M. The detailed procedures of the proposed fast improved MUSIC algorithm are given as follows.(1)
Choose initial reference signald
0
(
k
)
=
e
*
Q
2
M
Z
Q
2
N, and x
0
=
Q
2
M
Z
Q
2
N is the input data of MSWF, where e
=
[
1,0
,
…
,
0
].
(2)
Using forward decline for anyi, compute cross-correlation h
i
(
i
=
1,2
,
…
,
L
r
+
2
L
c
). Consider
(16)
h
i
=
E
[
x
i
-
1
(
t
)
d
i
-
1
H
(
t
)
]
∥
E
[
x
i
-
1
(
t
)
d
i
-
1
H
(
t
)
]
∥
2
,
d
i
(
t
)
=
h
i
H
x
i
-
1
(
t
)
,
B
i
=
null
{
h
i
}
=
I
-
h
i
h
i
H
,
x
i
(
t
)
=
B
i
H
x
i
-
1
(
t
)
.
(3)
Using estimated signal numberL
r
+
2
L
c to estimate signal subspace
(17)
U
s
=
[
h
1
,
h
2
,
…
,
h
L
r
+
2
L
c
]
.
(4)
Using formula (18),we can get noncircular signals and circular signals DOA (18)
P
n
c
(
θ
)
=
1
det
⁡
{
K
(
θ
)
}
=
1
det
⁡
{
(
Q
2
M
Z
(
θ
)
)
H
(
I
2
M
-
U
s
U
s
H
)
(
Q
2
M
Z
(
θ
)
)
}
,
P
c
(
θ
)
=
1
[
Q
M
a
(
θ
)
]
H
U
n
1
U
n
1
H
Q
M
a
(
θ
)
,
where U
n
1
U
n
1
H is a block matrix which is equal to V
(
1
:
M
,
1
:
M
), and V
=
I
-
U
s
U
s
H.


### 5.3. Fast Improved MUSIC Algorithm Computational Complexity Analysis

We know that the columns ofK
(
θ
) should be greater than or equal to 2, and K
(
θ
) does not decrease rank only at the condition of 2
M
-
L
r
-
2
L
c
≥
2. So the maximum estimated signal number of our fast improved MUSIC algorithm is 2
M
-
2.Computational complexity of subspace estimation for MUSIC algorithm mainly consists of two parts: one is correlation matrix operand which is equal toO
(
N
M
2
) and the other is eigendecomposition which is equal to O
(
M
3
). The sum of the computational complexity is O
(
N
M
2
+
M
3
). For NC-MUSIC algorithm, the computational complexity is O
(
4
N
M
2
+
8
M
3
). Using forward decline of MSWF based on correlation subtraction construction, if the number of mixed signals is known in advance, the computational load of estimation subspace is only O
(
2
M
N
L
r
+
4
M
N
L
c
). Because we utilize the uniform transform before using MSWF technique, the computational load for acquiring estimated signal subspace of our fast improved MUSIC algorithm is only O
(
M
N
L
r
/
2
+
M
N
L
c
). Normally, source number L
=
L
r
+
L
c is less than M; therefore, the computational complexity of our fast algorithm is decreased fast.


## 5.1. Unitary Transform for Received Data

Compared with real multiplication, the computational complexity of the complex multiplication is about fourfold. Usually, the array autocovariance matrixR
x is a complex matrix, and the operand of complex matrix is bigger than that of real matrix. If R
x is complex centro-Hermitian, through unitary transform, we can change it into a real matrix.For a given arbitrarily matrixQ, we denote O
~
P as a P
×
P dimension exchange matrix with ones on its antidiagonal and zeros in other places. We say Q is a left-Π-real matrix if it satisfies O
~
p
Q
*
=
Q. Here we define a unitary matrix
(13)
Q
2
n
+
1
=
1
2
[
I
n
0
j
I
n
0
T
2
0
T
O
~
n
0
-
j
O
~
n
]
,
where Q
2
n
+
1 is a left-Π-real matrix when the dimension of matrix is odd. If it is even, we can get a unitary left-Π-real matrix by dropping its center row and center column.SupposeT
p and U
q are p
×
p and q
×
q dimension left-Π-real matrices. Considering the transformation of ϕ, we can obtain
(14)
ϕ
(
M
)
:
M
⟼
T
p
-
1
M
U
q
.For an arbitrarily complex centro-Hermitian matrixM, under the condition that the dimensions are kept the same, we can transform it into a real matrix by (14).In order to exploit the feature of the noncircular signal completely, we construct a novel data vector(15)
Z
=
[
y
0
O
~
2
M
y
0
*
O
~
N
]
.Usingϕ
(
Z
)
=
Q
2
M
Z
Q
2
N, we can obtain the corresponding real matrix of Z.


## 5.2. Fast Improved MUSIC Algorithm

Although we can utilize improved MUSIC algorithm to conduct DOA estimation in the circumstance that circular and noncircular signals coexist, it is difficult to use it in practical engineering because of the heavy computational burden of the algorithm. The improved MUSIC algorithm can get the noise subspace through eigendecomposition, while it is time-consuming to compute the eigendecomposition, so the improved MUSIC algorithm is not suitable. If we want to use it in practice, we must reduce the computational load of the algorithm. Using unitary transform and MSWF, we can get a fast improved MUSIC algorithm. Here we suppose that the stage decline number of signal subspace isL
r
+
2
L
c, the stage decline number of noise subspace is 2
M, and L
r
+
2
L
c is far less than 2
M. The detailed procedures of the proposed fast improved MUSIC algorithm are given as follows.(1)
Choose initial reference signald
0
(
k
)
=
e
*
Q
2
M
Z
Q
2
N, and x
0
=
Q
2
M
Z
Q
2
N is the input data of MSWF, where e
=
[
1,0
,
…
,
0
].
(2)
Using forward decline for anyi, compute cross-correlation h
i
(
i
=
1,2
,
…
,
L
r
+
2
L
c
). Consider
(16)
h
i
=
E
[
x
i
-
1
(
t
)
d
i
-
1
H
(
t
)
]
∥
E
[
x
i
-
1
(
t
)
d
i
-
1
H
(
t
)
]
∥
2
,
d
i
(
t
)
=
h
i
H
x
i
-
1
(
t
)
,
B
i
=
null
{
h
i
}
=
I
-
h
i
h
i
H
,
x
i
(
t
)
=
B
i
H
x
i
-
1
(
t
)
.
(3)
Using estimated signal numberL
r
+
2
L
c to estimate signal subspace
(17)
U
s
=
[
h
1
,
h
2
,
…
,
h
L
r
+
2
L
c
]
.
(4)
Using formula (18),we can get noncircular signals and circular signals DOA (18)
P
n
c
(
θ
)
=
1
det
⁡
{
K
(
θ
)
}
=
1
det
⁡
{
(
Q
2
M
Z
(
θ
)
)
H
(
I
2
M
-
U
s
U
s
H
)
(
Q
2
M
Z
(
θ
)
)
}
,
P
c
(
θ
)
=
1
[
Q
M
a
(
θ
)
]
H
U
n
1
U
n
1
H
Q
M
a
(
θ
)
,
where U
n
1
U
n
1
H is a block matrix which is equal to V
(
1
:
M
,
1
:
M
), and V
=
I
-
U
s
U
s
H.


## 5.3. Fast Improved MUSIC Algorithm Computational Complexity Analysis

We know that the columns ofK
(
θ
) should be greater than or equal to 2, and K
(
θ
) does not decrease rank only at the condition of 2
M
-
L
r
-
2
L
c
≥
2. So the maximum estimated signal number of our fast improved MUSIC algorithm is 2
M
-
2.Computational complexity of subspace estimation for MUSIC algorithm mainly consists of two parts: one is correlation matrix operand which is equal toO
(
N
M
2
) and the other is eigendecomposition which is equal to O
(
M
3
). The sum of the computational complexity is O
(
N
M
2
+
M
3
). For NC-MUSIC algorithm, the computational complexity is O
(
4
N
M
2
+
8
M
3
). Using forward decline of MSWF based on correlation subtraction construction, if the number of mixed signals is known in advance, the computational load of estimation subspace is only O
(
2
M
N
L
r
+
4
M
N
L
c
). Because we utilize the uniform transform before using MSWF technique, the computational load for acquiring estimated signal subspace of our fast improved MUSIC algorithm is only O
(
M
N
L
r
/
2
+
M
N
L
c
). Normally, source number L
=
L
r
+
L
c is less than M; therefore, the computational complexity of our fast algorithm is decreased fast.


## 6. Simulation Results

In this section, we will restrict our discussion to 1-D ULA consisting of 6 sensors with interelement spaced
=
λ
/
2 and noncircular and circular signals come from far field at the same time. Consider the application in communication; here noncircular signals are binary phase shift keying (BPSK) signals. We use N
=
600 snapshots to estimate the array covariance matrix, and the additional noise is ideal Gaussian white noise. Independent Monte-Carlo research number is 100, and the root mean square error (RMSE) for circular and noncircular signals is defined as
(19)
RMS
E
1
=
1
L
c
N
∑
i
=
1
L
c
∑
k
=
1
N
(
θ
^
i
-
θ
i
)
2
,
RMS
E
2
=
1
L
r
N
∑
i
=
1
L
r
∑
k
=
1
N
(
θ
^
i
-
θ
i
)
2
.Experiment
1. Three BPSK noncircular signals and two circular signals are impinging on the array; the incidence angles are −30°, −15°, 5° and 20°, and 35°, respectively. Simulation results of the improved MUSIC algorithm and the fast improved MUSIC algorithm are shown in Figures 2 and 3, respectively. From the simulation results, we know that both algorithms can estimate five signals DOA correctly and estimated effection are perfect. It is noticed that although the peak of the improved MUSIC algorithm is sharper than the fast improved MUSIC algorithm, the difference is not obvious, especially when the SNR is high. The computational load for signal subspace of the fast improved MUSIC algorithm is O
(
12600
), while the improved MUSIC algorithm computational burden is O
(
88128
). The former computational load is far less than the latter. Because of the low computational complexity, the fast improved MUSIC algorithm has more wonderful prospect than the improved MUSIC algorithm in practical engineering.Figure 2
Improved MUSIC spectrum with 10 SNR.Figure 3
Fast improved MUSIC spectrum with 10 SNR.Experiment
2. The number of noncircular and circular signals is seven; the incidence angles are −40°, −30°, −15°, −5°, 10°, 20°, and 35°. Consider three cases where there are one, two, and three noncircular sources. The first case with one noncircular signal is coming from angle −40°; the angles of the second case with two noncircular signals are −40° and −30°; the third case with three noncircular signals is coming from −40°, −30°, and −15°, respectively. From simulation results shown in Figures 4 and 5, we know that the fast improved MUSIC algorithm can estimate 7-signal DOA, and the estimated number is larger than the number of array sensors. It is clear that the performance of the fast improved MUSIC algorithm becomes better with the increasement of noncircular signals due to the increasement in the dimension of noise subspace.Figure 4
RMSE versus SNR.Figure 5
RMSE versus number of snapshots.Experiment
3. The maximum detected number for the fast improved MUSIC algorithm is 2
M
-
2 under the circumstance of mixed noncircular and circular signals. For 6-sensor ULA, we know the largest detected number is 10 which is equal to L
r
+
2
L
c, so the maximum detected number for noncircular signals is 8 (eight noncircular signals and one circular signal are impinging at the same time) and the maximum detected number for circular signals is 4 (two noncircular signals and four circular signals are impinging at the same time). The simulation results (see Figures 6 and 7) confirm the effectiveness of theoretical analysis.Figure 6
Spectrum with eight noncircular signals under 10 SNR.Figure 7
Spectrum with four circular signals under 15 SNR.


## 7. Conclusion

In this paper, we presented a fast DOA estimation algorithm for the situation where circular and noncircular signals coexist. The proposed algorithm has high estimation accuracy and can estimate both circular and noncircular signals for ULA. It has two important advantages: firstly, because the number of sources resolved by our method can be greater than the number of array sensors, it is very suitable when there are multiple signals needing to be detected with small array. Secondly, it has low computational complexity compared to the improved MUSIC algorithm, so it has a wider range of prospective application in real-time DOA estimation. The computer simulations validate the effectiveness of our new method.



---

*Source: 206146-2014-10-01.xml*