DocumentCode
3268266
Title
Reduced-Complexity Proportional Fair Scheduling for OFDMA Systems
Author
Sun, Zhishui ; Yin, Changchuan ; Yue, Guangxin
Author_Institution
Dept. of Telecommun. Eng., Beijing Univ. of Posts & Telecommun.
Volume
2
fYear
2006
fDate
25-28 June 2006
Firstpage
1221
Lastpage
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 complexity
Keywords
OFDM modulation; computational complexity; frequency division multiple access; OFDMA systems; computational complexity; multiuser diversity; orthogonal frequency division multiple access; proportional fair scheduling; Bandwidth; Downlink; Frequency conversion; Intersymbol interference; Narrowband; OFDM; Resource management; Scheduling algorithm; Throughput; Transceivers;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems Proceedings, 2006 International Conference on
Conference_Location
Guilin
Print_ISBN
0-7803-9584-0
Electronic_ISBN
0-7803-9585-9
Type
conf
DOI
10.1109/ICCCAS.2006.284866
Filename
4064107
Link To Document