Abstract

The robust adaptive beamforming (RAB) problem for general-rank signal model with an uncertainty set defined through a matrix induced norm is considered. The worst-case signal-to-interference-plus-noise ratio (SINR) maximization RAB problem is formulated. First, the closed-form optimal value for a minimization problem of the least-squares residual over the matrix errors with an induced lp,q-norm constraint is derived. Then, the maximization problem is reformulated into the maximization of the difference between an l2-norm function and an lq-norm function, with a convex quadratic constraint. It is shown that for any q≥1 in the set of rational numbers, the maximization problem can be approximated by a sequence of second-order cone programming problems, with the ascent optimal values. The resultant beamvector for some q in the set with the maximal actual array output SINR, is treated as the candidate making the RAB design improved the most. In addition, a generalized RAB problem of maximizing the difference between an lp-norm function and an lq-norm function with the convex quadratic constraint is studied, and the actual array output SINR is further enhanced by properly selecting p and q. Simulation examples are presented to demonstrate the improved performance of the robust beamformers for certain matrix induced lp,q-norms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.