Fairness based resource allocation for multiuser MISO-OFDMA systems with beamforming  

作　　者：SUN Kai WANG Ying CHEN Zi-xiong ZHANG Ping 

机构地区：[1]Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China [2]Wireless Technology Innovation Institute, Beijing University of Posts and Telecommunications, Beijing 100876, China [3]College of Electronic Information Engineering, Inner Mongolia University, Hohhot 010021, China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2009年第1期38-43,共6页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China (6077212);the Hi-Tech Research and Development Program of China (2006AA01Z260);the Youth Foundation of Inner Mongolia University (ND0404, ND0508).

摘　　要：Resource allocation problem in multiuser multiple input single output-orthogonal frequency division multiple access （MISO-OFDMA） systems with downlink beamforming for frequency selective fading channels is studied. The article aims at maximizing system throughput with the constraints of total power and bit error rate （BER） while supporting fairness among users. The downlink proportional fairness （PF） scheduling problem is reformulated as a maximization of the sum of logarithmic user data rate. From necessary conditions on optimality obtained analytically by Karush-Kuhn-Tucker （KKT） condition, an efficient user selection and resource allocation algorithm is proposed. The computer simulations reveal that the proposed algorithm achieves tradeoff between system throughput and fairness among users.Resource allocation problem in multiuser multiple input single output-orthogonal frequency division multiple access （MISO-OFDMA） systems with downlink beamforming for frequency selective fading channels is studied. The article aims at maximizing system throughput with the constraints of total power and bit error rate （BER） while supporting fairness among users. The downlink proportional fairness （PF） scheduling problem is reformulated as a maximization of the sum of logarithmic user data rate. From necessary conditions on optimality obtained analytically by Karush-Kuhn-Tucker （KKT） condition, an efficient user selection and resource allocation algorithm is proposed. The computer simulations reveal that the proposed algorithm achieves tradeoff between system throughput and fairness among users.

关 键 词：space-division multiple access （SDMA） multiuser diversity proportional fairness resource allocation 

分 类 号：TN929.531[电子电信—通信与信息系统] O224[电子电信—信息与通信工程]