Optimum scheduling for orthogonal multiple access over fading channels using quantized channel state information
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 c...
Saved in:
Published in | 2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications pp. 366 - 370 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.07.2008
|
Subjects | |
Online Access | Get full text |
ISBN | 1424420458 9781424420452 |
ISSN | 1948-3244 |
DOI | 10.1109/SPAWC.2008.4641631 |
Cover
Summary: | 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. |
---|---|
ISBN: | 1424420458 9781424420452 |
ISSN: | 1948-3244 |
DOI: | 10.1109/SPAWC.2008.4641631 |