On Ergodic Sum Capacity of Fading Cognitive Multiple-Access and Broadcast Channels

被引:165
作者
Zhang, Rui [1 ]
Cui, Shuguang [2 ]
Liang, Ying-Chang [1 ]
机构
[1] ASTAR, Inst Infocomm Res, Singapore, Singapore
[2] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 USA
基金
美国国家科学基金会;
关键词
Broadcast channel; cognitive radio; convex optimization; dynamic resource allocation; ergodic capacity; fading channel; interference temperature; multiple-access channel; spectrum sharing; time-division multiple access (TDMA); OPTIMAL RESOURCE-ALLOCATION; POWER ALLOCATION; PART I; RADIO; LIMITS;
D O I
10.1109/TIT.2009.2030449
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies the information-theoretic limits of a secondary or cognitive radio (CR) network under spectrum sharing with an existing primary radio network. In particular, the fading cognitive multiple-access channel (C-MAC) is first studied, where multiple secondary users transmit to the secondary base station (BS) under both individual transmit-power constraints and a set of interference-power constraints each applied at one of the primary receivers. This paper considers the long-term (LT) or the short-term (ST) transmit-power constraint over the fading states at each secondary transmitter, combined with the LT or ST interference-power constraint at each primary receiver. In each case, the optimal power allocation scheme is derived for the secondary users to achieve the ergodic sum capacity of the fading C-MAC, as well as the conditions for the optimality of the dynamic time-division multiple-access (D-TDMA) scheme in the secondary network. The fading cognitive broadcast channel (C-BC) that models the downlink transmission in the secondary network is then studied under the LT/ST transmit-power constraint at the secondary BS jointly with the LT/ST interference-power constraint at each of the primary receivers. It is shown that D-TDMA is indeed optimal for achieving the ergodic sum capacity of the fading C-BC for all combinations of transmit-power and interference-power constraints.
引用
收藏
页码:5161 / 5178
页数:18
相关论文
共 38 条
[1]  
[Anonymous], 1991, ELEMENTS INFORM THEO
[2]  
[Anonymous], 2000, THESIS KTH STOCKHOLM
[3]   THE ELLIPSOID METHOD - A SURVEY [J].
BLAND, RG ;
GOLDFARB, D ;
TODD, MJ .
OPERATIONS RESEARCH, 1981, 29 (06) :1039-1091
[4]  
Boyd S., 2004, CONVEX OPTIMIZATION, DOI DOI 10.1017/CBO9780511804441
[5]   Optimum power control over fading channels [J].
Caire, G ;
Taricco, G ;
Biglieri, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) :1468-1489
[6]  
CHENG RS, 1993, IEEE T INFORM THEORY, V39, P773, DOI 10.1109/18.256487
[7]  
Cordeiro C, 2005, 2005 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, Conference Record, P328
[8]   Achievable rates in cognitive radio channels [J].
Devroye, N ;
Mitran, P ;
Tarokh, V .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :1813-1827
[9]   On capacity under receive and spatial spectrum-sharing constraints [J].
Gastpar, Michael .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (02) :471-487
[10]   Fundamental limits of spectrum-sharing in fading environments [J].
Ghasemi, Amir ;
Sousa, Elvino S. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007, 6 (02) :649-658