中国邮电高校学报(英文) ›› 2009, Vol. 16 ›› Issue (1): 38-43.doi: 10.1016/S1005-8885(08)60175-2

• Wireless • 上一篇    下一篇

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

孙锴,王莹,陈子雄,张平   

  1. Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-02-26
  • 通讯作者: 孙锴

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
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-02-26
  • Contact: SUN Kai

摘要:

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

Abstract:

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.

Key words:

space-division multiple access (SDMA);multiuser diversity;proportional fairness;resource allocation