Abstract
A novel method is proposed for joint probabilistic constrained robust beamforming and antenna selection used in cognitive radio networks. Assuming complex Gaussian distributed channel state information errors, the Bernstein-type inequalities are introduced to transform no closed-form probabilistic constrained forms into the deterministic forms. Moreover, the l1-norm is used as the closest convex approximation of l0-norm. Thus the original NP-hard optimal problem can be relaxed as a tractable convex optimization problem. A computationally efficient and near-optimal solution is obtained by an iteratively re-weighted algorithm. Simulations show that the proposed algorithm satisfies the predetermined service levels at relatively small excess transmission power in a number of transmitter reduction scenarios.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
