By Topic

Efficient Beamforming in Cognitive Radio Multicast Transmission

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Marko Beko ; Universidade Lusofona de Humanidades e Tecnologias, Campo Grande 376, 1749 - 024 Lisboa, Portugal, and UNINOVA, Campus da FCT/UNL, Monte de Caparica, 2829-516 Caparica, Portugal. M. Beko is also a collaborative member of Instituto de Sistemas e Robotica — Instituto Superior Tecnico, Av. Rovisco Pais, 1049-001 Lisboa, Portugal, and SITI/ILIND/COFAC: R&D Unit of Informatics Systems and Technologies, Instituto Lusofono de Investigacao e Desenvolvimento (ILIND), COFAC, Lisboa, Portugal

The optimal beamforming problems for cognitive multicast transmission are quadratic nonconvex optimization problems. The standard approach is to convert the problems into the form of semi-definite programming (SDP) with the aid of rank relaxation and later employ randomization techniques for solution search. However, in many cases, this approach brings solutions that are far from the optimal ones. We consider the problem of minimizing the total power transmitted by the antenna array subject to quality-of-service (QoS) at the secondary receivers and interference constraints at the primary receivers. It is shown that this problem, which is known to be nonconvex NP-hard, can be approximated by a convex second-order cone programming (SOCP) problem. Then, an iterative algorithm in which the SOCP approximation is successively improved is presented. Simulation results demonstrate the superior performance of the proposed approach in terms of total transmitted power and feasibility, together with a reduced computational complexity, as compared to the existing ones, for both the perfect and imperfect channel state information (CSI) cases. It is further shown that the proposed approach can be used to address the max-min fairness (MMF) based beamforming problem.

Published in:

IEEE Transactions on Wireless Communications  (Volume:11 ,  Issue: 11 )