Efficient subcarrier, power, and rate allocation with fairness consideration for OFDMA uplink

被引:61
作者
Gao, Long [1 ]
Cui, Shuguang [1 ]
机构
[1] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 USA
基金
美国国家科学基金会;
关键词
OFDMA; subcarrier; power; and rate allocation; fairness consideration;
D O I
10.1109/TWC.2008.061059
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Subcarrier, power, and rate allocation schemes for the orthogonal frequency division multiple access (OFDMA) uplink are considered. A low-complexity algorithm with fairness consideration is proposed to maximize the sum rate under individual rate and transmit power constraints. The complexity reduction and fairness are achieved by performing subcarrier allocation in two steps: Initial subcarrier allocation that considers per-user fairness; and residual subcarrier allocation that further increases the sum rate. The proposed algorithm achieves superior outage performance and has linear complexity in the number of users and subcarriers, while incurring negligible sum-rate degradation when the average path-loss is the same among users.
引用
收藏
页码:1507 / 1511
页数:5
相关论文
共 12 条
[1]  
CAI J, 2004, P WCNC 04, V4, P2143
[2]  
CHENG RS, 1993, IEEE T INFORM THEORY, V39, P773, DOI 10.1109/18.256487
[3]  
CIOFFI JM, 2005, LECT NOTES ADV DIGIT, P285
[4]  
DIGGAVI SN, 1996, P GLOBECOM 96, V3, P1566
[5]  
Erceg V., 2001, IEEE802163C0129R4
[6]   Joint subcarrier and power allocation in uplink OFDMA systems [J].
Kim, K ;
Han, Y ;
Kim, SL .
IEEE COMMUNICATIONS LETTERS, 2005, 9 (06) :526-528
[7]  
Münz G, 2002, GLOB TELECOMM CONF, P681
[8]  
Nee R. V., 2000, OFDM WIRELESS MULTIM
[9]   Multiaccess fading channels - Part I: Polymatroid structure, optimal resource allocation and throughput capacities [J].
Tse, DNC ;
Hanly, SV .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (07) :2796-2815
[10]   Iterative water-filling for Gaussian vector multiple-access channels [J].
Yu, W ;
Rhee, WJ ;
Boyd, S ;
Cioffi, JM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (01) :145-152