The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm

摘要

The throughput (total bit per second per hertz) of a modified Proportional Fair Algorithm (PFA) is analyzed and computed . The modified PFA introduces a dynamic threshold to filter the feedbacks of Channel Quality (CQ) based on which the users' priorities are calculated for scheduling. Only those in good CQs ( relative to their own average CQ) can be the candidates for scheduling, The results show that the modified PFA with a low CQ threshold can not only reduce some feedback overhead but also maintain the throughput of traditional PFA. Interestingly, for a certain combination of system parameters, the throughput gain over traditional PFA can be achieved by this modified PFA. Two methods of calculating priority, one based on signal to noise ratio, and the other on information rate, are considered. Their performances are generally similar in terms of throughput.