DocumentCode
2511864
Title
Solving ambiguity for sparse array via particle swarm optimization
Author
He, Ziyuan ; Zhao, Zhiqin ; Yang, Kai ; Ouyang, Jun
Author_Institution
Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China (UESTC), Chengdu, China
fYear
2011
fDate
21-23 Oct. 2011
Firstpage
316
Lastpage
319
Abstract
Sparse linear arrays are subject to manifold ambiguity in genera. A method to solve the manifold ambiguity of uncorrelated sources for sparse array is proposed in this paper. The method is consisted of two steps. The first step is to obtain all the directions of arrivals (DOAs) by traditional MUltiple SIgnal Classification (MUSIC) algorithm, including true and spurious DOAs. The second step is to estimate the power values of all the DOAs by substituting all the DOAs to a cost function. The particle warm optimization (PSO) are applied to estimate the power values. The power values of spurious DOAs are very small or tends to zero compared with the values of the true DOAs. Simulation results demonstrate the effectiveness and the feasibility of the method.
Keywords
array signal processing; direction-of-arrival estimation; particle swarm optimisation; signal classification; ambiguity solving; cost function; direction of arrival power value estimation; multiple signal classification algorithm; particle swarm optimization; sparse linear arrays; Arrays; Direction of arrival estimation; Estimation; Manifolds; Multiple signal classification; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Problem-Solving (ICCP), 2011 International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4577-0602-8
Electronic_ISBN
978-1-4577-0601-1
Type
conf
DOI
10.1109/ICCPS.2011.6092279
Filename
6092279
Link To Document