Expected throughput of the proportional fair scheduling over rayleigh fading channels

Authors:
Erwu Liu;Kin K. Leung
Affiliations:
Department of Electrical and Electronic Engineering, Imperial College, London, United Kingdom;Department of Electrical and Electronic Engineering, Imperial College, London, United Kingdom
Venue:
IEEE Communications Letters
Year:
2010

Citing 2
Cited 2

Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
On the Mutual Information Distribution of OFDM-Based Spatial Multiplexing: Exact Variance and Outage Approximation

IEEE Transactions on Information Theory

Queue-Aware Resource Allocation for Multi-cell OFDMA Systems with QoS Provisioning

Wireless Personal Communications: An International Journal
Statistical Channel State Information Aided Proportional Fair Scheduling Scheme for Highly Transmit Correlated Channels

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing analytical work on the proportional fair scheduling (PFS) algorithm has some limitations: 1) it requires independent identically distributed (i.i.d) relationship among users, 2) it uses a modified version of preference metric different from the original one, and 3) it is only valid for single-input-single-output (SISO) communications. This letter presents an analytical expression for the expected throughput of PFS over Rayleigh fading channels without the limitations above. The derived expression can be easily evaluated, and applies to both SISO and multiple-input-multiple-output (MIMO) cases. In addition, existing analytic result can be derived by using our expression in corresponding scenarios.