Improved schemes for subcarrier, bit, and power allocation in multiuser OFDM systems

  • Authors:
  • Wei-Cheng Pao;Yung-Fang Chen;Jia-Hong Lai

  • Affiliations:
  • Department of Communication Engineering, National Central University, Taiwan, R.O.C.;Department of Communication Engineering, National Central University, Taiwan, R.O.C.;Department of Communication Engineering, National Central University, Taiwan, R.O.C.

  • Venue:
  • WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, the subcarrier, bit, and power allocation problem for minimizing total transmit power in multiuser OFDM systems is considered and a near-optimal allocation scheme is developed. The heuristic algorithms based on initial subcarrier assignment and iterative improvement two steps have been proposed by Wong et al. and Chen et al. for real-time services [4- 5]. However, an appropriate method for the initial assignment should be selected or designed to offer even better performance. In this paper, one subcarrier allocation algorithm proposed by Zhang [6] is adopted as an initial subcarrier assignment method for the allocation problem. Its advantage is that there is no need to pre-determine the number of the assigned subcarriers for each user, and it outperforms the constructive initial assignment method proposed by Wong et al.. We adopt the subcarrier allocation algorithm proposed by Zhang along with iterative improvement schemes to obtain better performance. Detailed discussions of the subcarrier allocation algorithm proposed by Zhang are presented in this paper. As indicated in the simulation results, it reveals that the better initial subcarrier assignment with the iterative improvement schemes achieves better performance. We utilize the linear integer programming-based branch-and-bound algorithm to provide the optimum solution as the performance bound. The simulation results show that the performance is improved with the new proposed heuristic polynomial time algorithm and is close to that of the optimum solution.