Please use this identifier to cite or link to this item:
Title: Cognitive multiple access channels: Optimal power allocation for weighted sum rate maximization
Authors: Zhang, L.
Xin, Y. 
Liang, Y.-C.
Poor, H.V.
Keywords: Cognitive radio networks
Multiple access channel
Power allocation
Sum rate maximization
Issue Date: 2009
Citation: Zhang, L., Xin, Y., Liang, Y.-C., Poor, H.V. (2009). Cognitive multiple access channels: Optimal power allocation for weighted sum rate maximization. IEEE Transactions on Communications 57 (9) : 2754-2762. ScholarBank@NUS Repository.
Abstract: Cognitive radio is an emerging technology that shows great promise to dramatically improve the efficiency of spectrum utilization. This paper considers a cognitive radio model, in which the secondary network is allowed to use the radio spectrum concurrently with primary users (PUs) provided that interference from the secondary users (SUs) to the PUs is constrained by certain thresholds. The weighted sum rate maximization problem is studied under interference power constraints and individual transmit power constraints, for a cognitive multiple access channel (C-MAC), in which each SU having a single transmit antenna communicates with the base station having multiple receive antennas. An iterative algorithm is developed to efficiently obtain the optimal solution of the weighted sum rate problem for the C-MAC. It is further shown that the proposed algorithm, although developed for single channel transmission, can be extended to the case of multiple channel transmission. Corroborating numerical examples illustrate the convergence behavior of the algorithm and present comparisons with other existing alternative algorithms. © 2009 IEEE.
Source Title: IEEE Transactions on Communications
ISSN: 00906778
DOI: 10.1109/TCOMM.2009.09.080145
Appears in Collections:Staff Publications

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


checked on Oct 23, 2020


checked on Oct 23, 2020

Page view(s)

checked on Oct 5, 2020

Google ScholarTM



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