DocumentCode :
967737
Title :
Doubly Constrained Robust Capon Beamformer With Ellipsoidal Uncertainty Sets
Author :
Beck, Amir ; Eldar, Yonina C.
Author_Institution :
Dept. of Ind. Eng. & Manage., Technion-Israel Inst. of Technol., Haifa
Volume :
55
Issue :
2
fYear :
2007
Firstpage :
753
Lastpage :
758
Abstract :
The doubly constrained robust (DCR) Capon beamformer with a spherical uncertainty set was introduced and studied by Stoica and Wang. Here, we consider the generalized DCR problem (GDCR) in which the uncertainty set is an ellipsoid rather than a sphere. Although, as noted previously by Stoica and Wang, this problem is nonconvex and appears to be intractable, we show that it can be solved efficiently. In fact, we prove that the GDCR beamformer can be obtained as a solution to a convex optimization problem. To this end, we first derive a strong duality result for nonconvex quadratic programs with two quadratic constraints over the complex domain. Specializing the results to our context leads to a semidefinite programming formulation of the GDCR beamformer
Keywords :
array signal processing; duality (mathematics); quadratic programming; set theory; convex optimization problem; doubly constrained robust Capon beamformer; ellipsoidal uncertainty sets; nonconvex quadratic programs; quadratic constraints; semidefinite programming formulation; spherical uncertainty set; strong duality result; Filtering; Filters; Higher order statistics; Polynomials; Pulse width modulation; Robustness; Signal processing; Signal processing algorithms; Uncertainty; Working environment noise; Nonconvex quadratic optimization; S-lemma; robust Capon beamforming; strong duality;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2006.885729
Filename :
4063532
Link To Document :
بازگشت