Please use this identifier to cite or link to this item:
|Title:||Optimal power allocation for fading channels in cognitive radio networks: Ergodic capacity and outage capacity|
|Authors:||Kang, X. |
Interference power constraint
|Source:||Kang, X., Liang, Y.-C., Nallanathan, A., Garg, H.K., Zhang, R. (2009-02). Optimal power allocation for fading channels in cognitive radio networks: Ergodic capacity and outage capacity. IEEE Transactions on Wireless Communications 8 (2) : 940-950. ScholarBank@NUS Repository. https://doi.org/10.1109/TWC.2009.071448|
|Abstract:||A cognitive radio network (CRN) is formed by either allowing the secondary users (SUs) in a secondary communication network (SCN) to opportunistically operate in the frequency bands originally allocated to a primary communication network (PCN) or by allowing SCN to coexist with the primary users (PUs) in PCN as long as the interference caused by SCN to each PU is properly regulated. In this paper, we consider the latter case, known as spectrum sharing, and study the optimal power allocation strategies to achieve the ergodic capacity and the outage capacity of the SU fading channel under different types of power constraints and fading channel models. In particular, besides the interference power constraint at PU, the transmit power constraint of SU is also considered. Since the transmit power and the interference power can be limited either by a peak or an average constraint, various combinations of power constraints are studied. It is shown that there is a capacity gain for SU under the average over the peak transmit/interference power constraint. It is also shown that fading for the channel between SU transmitter and PU receiver is usually a beneficial factor for enhancing the SU channel capacities. © 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 Dec 7, 2017
WEB OF SCIENCETM
checked on Nov 29, 2017
checked on Dec 11, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.