DocumentCode
3023334
Title
Direction-of-arrival estimation using sparse variable projection optimization
Author
Luo, Ji-an ; Zhang, Xiao-Ping ; Wang, Zhi
Author_Institution
Dept. of Electr. & Comput. Eng., Ryerson Univ., Toronto, ON, Canada
fYear
2012
fDate
20-23 May 2012
Firstpage
3106
Lastpage
3109
Abstract
We propose a new low complexity direction-of-arrival (DOA) estimation method based on sparse variable projection (SVP) optimization. This method estimates an indicative sparse vector that indicates the locations of DOA from each visual sources corresponding to DOA sampling space and is particular useful to simplify the multiple measurement vector (MMV) problem as a single indicative sparse vector recovery problem. The indicative sparse vector can be recovered by adding additional sparsity measure information. We use ℓp(p ≤ 1) norm and smoothed approximate ℓ0 norm to regularize the SVP function, so that we can formulate the SVP optimization as an unconstrained optimization problem and we solve it efficiently using quasi-Newton method. The experimental results demonstrate that our method has much lower complexity by comparing with a standard Regularized M-FOCUSS algorithm.
Keywords
direction-of-arrival estimation; optimisation; DOA estimation method; DOA sampling space; MMV problem; SVP optimization; indicative sparse vector; low complexity direction-of-arrival estimation method; multiple measurement vector; quasiNewton method; sparse variable projection optimization; sparse vector recovery problem; sparsity measure information; standard Regularized M-FOCUSS algorithm; unconstrained optimization problem; Arrays; Complexity theory; Direction of arrival estimation; Estimation; Optimization; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems (ISCAS), 2012 IEEE International Symposium on
Conference_Location
Seoul
ISSN
0271-4302
Print_ISBN
978-1-4673-0218-0
Type
conf
DOI
10.1109/ISCAS.2012.6271978
Filename
6271978
Link To Document