Optimal OFDMA downlink scheduling under a control signaling cost constraint

Authors:
Erik G. Larsson
Affiliations:
Linköping University, Dept. of Electrical Engineering, Division of Communication Systems, Linköping, Sweden
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 8
Cited 0

Dynamic Programming and Optimal Control, Vol. II

Dynamic Programming and Optimal Control, Vol. II
3G Evolution, Second Edition: HSPA and LTE for Mobile Broadband

3G Evolution, Second Edition: HSPA and LTE for Mobile Broadband
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
Joint scheduling and resource allocation in uplink OFDM systems for broadband wireless access networks

IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Joint channel- and queue-aware scheduling for multiuser diversity in wireless OFDMA networks

IEEE Transactions on Communications
Rate-maximization scheduling schemes for uplink OFDMA

IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
Performance analysis of dynamic OFDMA systems with inband signaling

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new algorithm for downlink scheduling in OFDMA systems. The method maximizes the throughput, taking into account the amount of signaling needed to transmit scheduling maps to the users. A combinatorial problem is formulated and solved via a dynamic programming approach reminiscent of the Viterbi algorithm. The total computational complexity of the algorithm is upper bounded by O(K4N) where K is the number of users that are being considered for scheduling in a frame and N is the number of resource blocks per frame.