Optimum Scheduling for Orthogonal Multiple Access over Fading Channels using Quantized Channel State Information

Abstract

The efficiency of multi-access communications over wireless fading links benefits from channel-adaptive allocation of the available bandwidth and power resources. Different from most existing approaches that allocate resources based on perfect channel state information (P-CSI), this work optimizes channel scheduling and resource allocation over orthogonal fading channels when user terminals and the scheduler rely on quantized channel state information (Q-CSI). The novel unifying approach optimizes an average transmit-performance criterion subject to average quality of service requirements. The resultant optimal policy per fading realization either allocates the entire channel to a single (winner) user, or, to a small group of winner users whose percentage of shared resources is found by solving a linear program. Both alternatives become possible by smoothing the allocation scheme. The smooth policy is asymptotically optimal and incurs reduced computational complexity.