Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.