Title :
Proportional fairness in multi-carrier system: upper bound and approximation algorithms
Author :
Kaneko, Megumi ; Popovski, Petar ; Dahl, Joachim
Author_Institution :
Dept. of Commun. Technol., Aalborg Univ.
fDate :
6/1/2006 12:00:00 AM
Abstract :
The solution for the optimal multi-carrier (MC) proportional fair scheduling (PFS) is prohibitively complex to obtain. In this letter we obtain an upper bound on the achievable proportional fairness (PF) performance in the case of finite PFS window size. Next, three approximation algorithms are proposed. The first one is computationally complex, but achieves near-optimal PF. The two others achieve a good tradeoff between throughput and PF with low complexity
Keywords :
OFDM modulation; approximation theory; computational complexity; frequency division multiple access; scheduling; PFS; approximation algorithm; computational complexity; multicarrier system; proportional fair scheduling; upper bound; Approximation algorithms; Downlink; Feeds; Frequency conversion; Processor scheduling; Radio spectrum management; Resource management; Scheduling algorithm; Throughput; Upper bound;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2006.1638616
