Please use this identifier to cite or link to this item:
Title: Weighted sum rate optimization for cognitive radio MIMO broadcast channels
Authors: Zhang, L.
Xin, Y. 
Liang, Y.-C.
Issue Date: 2008
Citation: Zhang, L., Xin, Y., Liang, Y.-C. (2008). Weighted sum rate optimization for cognitive radio MIMO broadcast channels. IEEE International Conference on Communications : 3679-3683. ScholarBank@NUS Repository.
Abstract: In this paper, we consider a cognitive radio (CR) network in which the unlicensed (secondary) users (SUs) are allowed to concurrently access the spectrum allocated to the licensed (primary) users provided that their interference to the primary users (PUs) satisfies certain constraints. We study a weighted sum rate maximization problem for the secondary user (SU) multiple input multiple output (MIMO) broadcast channel (BC), in which the SUs have not only the sum power constraint but also interference constraints. We first transform this multiconstraint maximization problem into its equivalent form, which involves a single constraint with multiple auxiliary variables. Fixing these multiple auxiliary variables, we establish a duality result for the equivalent problem. Our duality result can be viewed as an extension of the previously known results, which depend on either a sum power constraint or per-antenna power constraints. Furthermore, we develop an efficient sub-gradient based iterative algorithm to solve the equivalent problem and show that the developed algorithm converges to a globally optimal solution. Computer simulations are also provided to corroborate the effectiveness of the proposed algorithm. ©2008 IEEE.
Source Title: IEEE International Conference on Communications
ISBN: 9781424420742
ISSN: 05361486
DOI: 10.1109/ICC.2008.692
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Dec 5, 2018


checked on Nov 20, 2018

Page view(s)

checked on Oct 20, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.