.png){kind=icon}
返回
Robust adaptive beamforming under data dependent constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2021.108202.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the conventional robust adaptive beamformers (RABs), a common problem is that the estimated man-ifold vector of the signal of interest (SOI) may converge to the interference subspace. By using the data dependent constraints, such problem can be mitigated. In this paper, we propose to employ the oblique projection to obtain the SOI covariance matrix and compute the interference covariance matrix in an estimate-and-subtract manner. Rather than using the semidefinite programming relaxation, we find that the proposed RAB, which belongs to the well known non-convex quadratically constrained quadratic pro-gramming problem, can be solved efficiently by the Lagrange multiplier methodology coupled with the Newton's method. Our simulation results demonstrate the superiority of the proposed method over other previously developed RAB techniques. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Covariance matrix reconstruction
Data dependent constraints
Oblique projection
Robust adaptive beamforming
Quadratically constrained quadratic programming (QCQP)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
Robust Covariance Matrix Reconstruction Algorithm for Time-Domain Wideband Adaptive Beamforming
PREAI
分享收藏
查看更多内容