Reduced-Complexity Proportional Fair Scheduling for OFDMA Systems
- 1 June 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1221-1225
Abstract
Orthogonal frequency division multiple access (OFDMA) is an attractive technique to implement multiuser diversity for the downlink. In this paper, we focus on the proportional fair (PF) scheduling for OFDMA systems and our goal is to strike the balance between maximizing the total system throughput and maintaining fairness among users. We draw necessary conditions for optimality and then derive the scheduling scheme. Simulation results show that our proposed PF scheme can providing almost near optimal solutions with low computational complexityKeywords
This publication has 6 references indexed in Scilit:
- Proportional fair spatial scheduling for wireless access point with multiple antenna - reverse link with scalar feedback2003
- Asymptotic analysis of proportional fair algorithm2002
- Opportunistic beamforming using dumb antennasIEEE Transactions on Information Theory, 2002
- Rate control for communication networks: shadow prices, proportional fairness and stabilityJournal of the Operational Research Society, 1998
- Charging and rate control for elastic trafficEuropean Transactions on Telecommunications, 1997
- Variable-rate variable-power MQAM for fading channelsIEEE Transactions on Communications, 1997