A Proportional Fair Space Time Scheduling for Wireless Communications

A Proportional Fair Space Time Scheduling for Wireless Communications We extend proportional fair scheduling algorithm to systems with multiple antennas. There are
$K$
client users and one access point. The access point has
$n_R$
antenna while the client device has single transmit antenna. We assume slow fading channel where clients are moving with pedestrian speed. Qualcomm's original proportional fair scheduling algorithm satisfies the proportional fair (PF) criteria only when the communication is constrained to one user at a time and peak power constraint . However, the original PF algorithm does not generalize easily when we have
$n_R$
receive antenna at the access point. We shall derive a generalized proportional fair scheduler for the communication system. System capacity is enhanced by exploiting the multi-user selection diversity as well as the distributed MIMO configuration.