By Topic

Optimal OFDMA Downlink Scheduling Under a Control Signaling Cost Constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Larsson, E.G. ; Dept. of Electr. Eng. (ISY), Linkoping Univ., Linkoping, Sweden

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(K4)N) 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.

Published in:

Communications, IEEE Transactions on  (Volume:58 ,  Issue: 10 )