Jack Holtzman

Asymptotic analysis of proportional fair algorithm

It was previously shown (under simplifying assumptions) that the proportional fair algorithm gives equal power and time to users who only differ in their distance from the BS, their fading characteristics being the same (see Holtzman, J.M., Proc. VTC2000-Spring, p.1663-7, 2000). We give here a more general result for two classes of users with different fading characteristics. All other things being equal, the user class with more fading variability gets more throughput with a lower (but not much lower) fraction of time transmitting. We also demonstrate a separability property-the effects of variability and distance from the base station are separable.

CDMA forward link waterfilling power control

Waterfilling is used here to mean transmitting delay-tolerant data users mostly when the channel is good. First, a result is given which yields a simple interpretation of an algorithm which shows how it provides a throughput levelling and an appealing tradeoff between throughput and fairness. Then, an extension is given of the algorithm from transmitting a single user at a time to transmitting more than one user at a time. Finally, a comparison with more traditional power control is given. The results indicate promising improvement.