DocumentCode
2375753
Title
Efficient convex optimization for beamforming in cognitive radio multicast transmission
Author
Beko, Marko
Author_Institution
Univ. Lusofona de Humanidades e Tecnol., Lisbon, Portugal
fYear
2012
fDate
10-15 June 2012
Firstpage
1895
Lastpage
1899
Abstract
In this paper, a novel algorithm for transmit beamforming to single cochannel multicast group is presented. The problem of minimizing the total power transmitted by the antenna array subject to interference constraints at the primary receivers and quality-of-service (QoS) constraints at the secondary receivers is addressed. It is shown that this problem, which is 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 refined is proposed. Simulation results show the superior performance of the proposed approach in terms of the total beamforming power, feasibility and computational complexity as compared to the existing ones1.
Keywords
antenna arrays; array signal processing; cognitive radio; computational complexity; concave programming; convex programming; iterative methods; quality of service; QoS constraints; SOCP approximation; antenna array; beamforming power; cochannel multicast group; cognitive radio multicast transmission; computational complexity; convex optimization; convex second-order cone programming problem; interference constraints; iterative algorithm; nonconvex NP-hard problem; primary receivers; quality-of-service constraints; secondary receivers; transmit beamforming; Approximation methods; Array signal processing; Cognitive radio; Complexity theory; Interference; Quality of service; Receivers;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (ICC), 2012 IEEE International Conference on
Conference_Location
Ottawa, ON
ISSN
1550-3607
Print_ISBN
978-1-4577-2052-9
Electronic_ISBN
1550-3607
Type
conf
DOI
10.1109/ICC.2012.6364285
Filename
6364285
Link To Document