Please use this identifier to cite or link to this item:
|Title:||Fading cognitive multiple access channels: Outage capacity regions and optimal power allocation|
|Authors:||Kang, X. |
multiple access channel
|Source:||Kang, X., Liang, Y.-C., Garg, H.K. (2010-07). Fading cognitive multiple access channels: Outage capacity regions and optimal power allocation. IEEE Transactions on Wireless Communications 9 (7) : 2382-2391. ScholarBank@NUS Repository. https://doi.org/10.1109/TWC.2010.07.091743|
|Abstract:||This paper considers a spectrum sharing based cognitive radio network where a M-user fading multiple access network shares the same spectrum with an existing primary network. The primary network's transmission is assumed to be protected by the interference power constraint. Under this interference power constraint together with the individual transmit power constraint of each user, the outage capacity regions for the fading cognitive multiple access channel (C-MAC) are defined for two different scenarios, i.e., an outage must be declared simultaneously for all users (common outage) and outages are declared individually for each user (individual outage). Then, optimal power allocation strategies to achieve the boundary points of these outage capacity regions are derived by considering their equivalent problems, i.e., the common/individual usage probability maximization for given rate vectors. It is rigorously proved that the optimal decoding strategy is the successive decoding strategy, and the decoding order is determined by the dual variables and the channel power gains of the involved channels. Then, a modified ellipsoid method is proposed to obtain the optimal dual variables. Finally, several numerical examples are given to validate the proposed studies. © 2006 IEEE.|
|Source Title:||IEEE Transactions on Wireless Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 8, 2018
WEB OF SCIENCETM
checked on Feb 7, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.