.png){kind=icon}
Return
Robust Adaptive Beamforming Using Sequential Quadratic Programming: An Iterative Solution to the Mismatch Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2008.2001115.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new approach to the design of robust adaptive beamforming is introduced. The essence of the new approach is to estimate the difference between the actual and presumed steering vectors and to use this difference to correct the erroneous presumed steering vector. The estimation process is performed iteratively where a quadratic convex optimization problem is solved at each iteration. Contrary to the worst-case performance-based and the probability-constrained-based approaches, our approach does not make any assumptions on either the norm of the mismatch vector or its probability distribution. Hence, it avoids the need for estimating their values.
Keywords:
Adaptive arrays
array signal processing
mathematical programming
parameter estimation
robustness
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
ShareSaveApplication of antenna arrays to mobile communications .2. Beam-forming and direction-of-arrival considerations.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more