Optimal OFDMA Downlink Scheduling Under a Control Signaling Cost Constraint
2010 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 58, no 10, 2776-2781 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
Piscataway, NJ, United States: IEEE , 2010. Vol. 58, no 10, 2776-2781 p.
National CategoryEngineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-58553DOI: 10.1109/TCOMM.2010.082010.090215ISI: 000283444300005OAI: oai:DiVA.org:liu-58553DiVA: diva2:343541
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Erik G. Larsson, Optimal OFDMA Downlink Scheduling Under a Control Signaling Cost Constraint, 2010, IEEE Transactions on Communications, (58), 10. http://dx.doi.org/10.1109/TCOMM.2010.0902152010-08-132010-08-132014-01-13Bibliographically approved