Reduced-Complexity Proportional Fair Scheduling for OFDMA Systems

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 complexity