Robust wideband beamforming by the hybrid steepest descent method

被引:73
作者
Slavakis, Konstantinos [1 ]
Yamada, Isao
机构
[1] Univ Athens, Dept Informat & Telecommun, Athens 15784, Greece
[2] Tokyo Inst Technol, Dept Commun & Integrated Syst, Tokyo 1528552, Japan
基金
日本学术振兴会;
关键词
convex feasibility problems; fixed point theory; hybrid steepest descent method; wideband beamforming;
D O I
10.1109/TSP.2007.896252
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper uses the Hybrid Steepest Descent Method (HSDM) to design robust smart antennas. Several design criteria as well as robustness are mathematically described by a finite collection of closed convex sets in a real Euclidean space. Desirable beamformers are defined as points of the generalized convex feasible set which is well defined even in the case of inconsistent design criteria. A quadratic cost function is formed by the correlations of the incoming data, and the HSDM constructs a point sequence that (strongly) converges to the (unique) minimizer of the cost function over the generalized convex feasible set. Numerical examples validate the proposed design.
引用
收藏
页码:4511 / 4522
页数:12
相关论文
共 41 条
[1]  
[Anonymous], P IEEE MICROWAVE ANT
[2]  
[Anonymous], VECTOR SPACE PROJECT
[3]  
[Anonymous], SMART ANTENNAS
[4]  
Balanis C. A., 2015, ANTENNA THEORY ANAL
[5]  
Bauschke H.H., 1996, THESIS U BURNABY BC
[6]   Projection algorithms for solving convex feasibility problems [J].
Bauschke, HH ;
Borwein, JM .
SIAM REVIEW, 1996, 38 (03) :367-426
[7]  
Bazaraa M.S., 1993, NONLINEAR PROGRAMMIN
[8]  
BOSE B, 1993, DIGITAL FILTERS THEO
[9]  
Boyd S., 2004, CONVEX OPTIMIZATION
[10]  
Bregman L. M., 1965, SOV MATH DOKL, V6, P688