publication . Article . 2010

Optimal OFDMA Downlink Scheduling Under a Control Signaling Cost Constraint

Erik G. Larsson;
Open Access English
  • Published: 01 Jan 2010
  • Publisher: Linköpings universitet, Kommunikationssystem
  • Country: Sweden
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 boundedby O(K^4N) 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. <p>©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertisin...
Persistent Identifiers
Subjects
free text keywords: Engineering and Technology, Teknik och teknologier, Electrical and Electronic Engineering, Computational complexity theory, Rate-monotonic scheduling, Scheduling (computing), Viterbi algorithm, symbols.namesake, symbols, Fair-share scheduling, Theoretical computer science, Mathematical optimization, Mathematics, Earliest deadline first scheduling, Dynamic priority scheduling, Frequency-division multiple access
Related Organizations
Any information missing or wrong?Report an Issue