Robust Adaptive Beamforming Based on Steering Vector Estimation With as Little as Possible Prior Information

被引:232
作者
Khabbazibasmenj, Arash [1 ]
Vorobyov, Sergiy A. [1 ]
Hassanien, Aboulnasr [1 ]
机构
[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2V4, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Output power maximization; robust adaptive beamforming (RAB); quadratically constrained quadratic programming (QCQP); semi-definite programming (SDP) relaxation; steering vector estimation; QUADRATIC OPTIMIZATION; SEMIDEFINITE RELAXATION; PERFORMANCE; ALGORITHM;
D O I
10.1109/TSP.2012.2189389
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A general notion of robustness for robust adaptive beamforming (RAB) problem and a unified principle for minimum variance distortionless response (MVDR) RAB techniques design are formulated. This principle is to use standard MVDR beamformer in tandem with an estimate of the desired signal steering vector found based on some imprecise prior information. Differences between various MVDR RAB techniques occur only because of the differences in the assumed prior information and the corresponding signal steering vector estimation techniques. A new MVDR RAB technique, which uses as little as possible and easy to obtain imprecise prior information, is developed. The objective for estimating the steering vector is the maximization of the beamformer output power, while the constraints are the normalization condition and the requirement that the estimate does not converge to any of the interference steering vectors and their linear combinations. The prior information used is only the imprecise knowledge of the antenna array geometry and angular sector in which the actual steering vector lies. Mathematically, the proposed MVDR RAB is expressed as the well known non-convex quadratically constrained quadratic programming problem with two constraints, which can be efficiently and exactly solved. Some new results for the corresponding optimization problem such as a new algebraic way of finding the rank-one solution from the general-rank solution of the relaxed problem and the condition under which the solution of the relaxed problem is guaranteed to be rank-one are derived. Our simulation results demonstrate the superiority of the proposed method over other previously developed RAB techniques.
引用
收藏
页码:2974 / 2987
页数:14
相关论文
共 35 条
[1]  
Abramovich Yu. I., 1981, Radio Engineering and Electronic Physics, V26, P87
[2]   Doubly constrained robust capon beamformer with ellipsoidal uncertainty sets [J].
Beck, Amir ;
Eldar, Yonina C. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2007, 55 (02) :753-758
[3]   Strong duality in nonconvex quadratic optimization with two quadratic constraints [J].
Beck, Amir ;
Eldar, Yonina C. .
SIAM JOURNAL ON OPTIMIZATION, 2006, 17 (03) :844-860
[4]   PERFORMANCE OF DMI AND EIGENSPACE-BASED BEAMFORMERS [J].
CHANG, L ;
YEH, CC .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 1992, 40 (11) :1336-1347
[5]   ROBUST ADAPTIVE BEAMFORMING [J].
COX, H ;
ZESKIND, RM ;
OWEN, MM .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1987, 35 (10) :1365-1376
[6]   A PROJECTION APPROACH FOR ROBUST ADAPTIVE BEAMFORMING [J].
FELDMAN, DD ;
GRIFFITHS, LJ .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1994, 42 (04) :867-876
[7]   ALGORITHM FOR LINEARLY CONSTRAINED ADAPTIVE ARRAY PROCESSING [J].
FROST, OL .
PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1972, 60 (08) :926-&
[8]  
Gershman AB, 1999, AEU-INT J ELECTRON C, V53, P305
[9]   Inherent limitations in the localization of a coherently scattered source [J].
Goldberg, J ;
Messer, H .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1998, 46 (12) :3441-3444
[10]   AN ALTERNATIVE APPROACH TO LINEARLY CONSTRAINED ADAPTIVE BEAMFORMING [J].
GRIFFITHS, LJ ;
JIM, CW .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 1982, 30 (01) :27-34