A penalized inequality-constrained approach for robust beamforming with DoF limitation

被引:2
|
作者
Pu, Wenqiang [2 ]
Xiao, Jinjun [1 ]
Zhang, Tao [1 ]
Luo, Zhi-Quan [2 ]
机构
[1] Starkey Hearing Technol, Minneapolis, MN 55455 USA
[2] Chinese Univ Hong Kong, Shenzhen Res Inst Big Data, Shenzhen 518172, Peoples R China
基金
中国国家自然科学基金;
关键词
Array signal processing; Robust beamforming; Degrees of freedom; Convex optimization; COVARIANCE-MATRIX RECONSTRUCTION; NOISE-REDUCTION; OPTIMIZATION; CANCELLATION; PERFORMANCE; DESIGN;
D O I
10.1016/j.sigpro.2022.108746
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A well-known challenge in beamforming is how to optimally utilize the degrees of freedom (DoF) of the array to design a robust beamformer, especially when the array DoF is limited. In this paper, we leverage the tool of constrained convex optimization and propose a penalized inequality-constrained minimum variance (P-ICMV) beamformer to address this challenge. Specifically, a well-targeted objective function and inequality constraints are proposed to achieve the design goals. By penalizing the maximum gain of the beamformer at any interfering directions, the total interference power can be efficiently mitigated with limited DoF. Multiple robust constraints on the target protection and interference suppression can be introduced to increase the robustness of the beamformer against steering vector mismatch. By in-tegrating the noise reduction, interference suppression, and target protection, the proposed formulation can efficiently obtain a robust beamformer design while optimally trading off various design goals. To numerically solve this problem, we formulate the P-ICMV beamformer design as a convex second-order cone program (SOCP) and propose a low complexity iterative algorithm based on the alternating direction method of multipliers (ADMM). Three applications are simulated to demonstrate the effectiveness of the proposed beamformer.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:13
相关论文
共 50 条
  • [31] A novel inequality-constrained weighted linear mixture model for endmember variability
    Yu, Jie
    Wang, Bin
    Lin, Yi
    Li, Fengting
    Cai, Jianqing
    REMOTE SENSING OF ENVIRONMENT, 2021, 257
  • [32] p-factor methods for nonregular inequality-constrained optimization problems
    Szczepanik, Ewa
    Tret'yakov, Alexey
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2008, 69 (12) : 4241 - 4251
  • [33] Bayesian Evaluation of Inequality-Constrained Hypotheses in SEM Models Using Mplus
    van de Schoot, Rens
    Hoijtink, Herbert
    Hallquist, Michael N.
    Boelen, Paul A.
    STRUCTURAL EQUATION MODELING-A MULTIDISCIPLINARY JOURNAL, 2012, 19 (04) : 593 - 609
  • [34] Inequality-Constrained 3D Morphable Face Model Fitting
    Sariyanidi, Evangelos
    Zampella, Casey J.
    Schultz, Robert T.
    Tunc, Birkan
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2024, 46 (02) : 1305 - 1318
  • [35] Newton methods for large-scale linear inequality-constrained minimization
    Forsgren, A
    Murray, W
    SIAM JOURNAL ON OPTIMIZATION, 1997, 7 (01) : 162 - 176
  • [36] Existence of Exact Penalty and its Stability for Inequality-Constrained Optimization Problems
    Zaslavski, Alexander J.
    JOURNAL OF CONVEX ANALYSIS, 2009, 16 (01) : 261 - 276
  • [37] An Estimation of Exact Penalty for Infinite-Dimensional Inequality-Constrained Minimization Problems
    Alexander J. Zaslavski
    Set-Valued and Variational Analysis, 2011, 19 : 385 - 398
  • [38] Linearly Constrained Robust Capon Beamforming
    Somasundaram, Samuel D.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (11) : 5845 - 5856
  • [39] Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
    Zeng, Liaoyuan
    Zhang, Yongle
    Li, Guoyin
    Pong, Ting Kei
    Wang, Xiaozhou
    MATHEMATICAL PROGRAMMING, 2024, 208 (1-2) : 717 - 761
  • [40] Collocation method to solve inequality-constrained optimal control problems of arbitrary order
    Rabiei, K.
    Parand, K.
    ENGINEERING WITH COMPUTERS, 2020, 36 (01) : 115 - 125