Feedback Allocation For OFDMA Systems With Slow Frequency-domain Scheduling
Dimitrov, Nedialko B.
MetadataShow full item record
We study the problem of allocating limited feedback resources across multiple users in an orthogonalfrequency- division-multiple-access downlink system with slow frequency-domain scheduling. Many flavors of slow frequency-domain scheduling (e.g., persistent scheduling, semi-persistent scheduling), that adapt user-sub-band assignments on a slower time-scale, are being considered in standards such as 3GPP Long- Term Evolution (LTE). In this paper, we develop a feedback allocation algorithm that operates in conjunction with any arbitrary slow frequency-domain scheduler with the goal of improving the throughput of the system. Given a user-sub-band assignment chosen by the scheduler, the feedback allocation algorithm involves solving a weighted sum-rate maximization at each (slow) scheduling instant. We first develop an optimal dynamic-programming-based algorithm to solve the feedback allocation problem with pseudo-polynomial complexity in the number of users and in the total feedback bit budget. We then propose two approximation algorithms with complexity further reduced, for scenarios where the problem exhibits additional structure.
IEEE Transactions on Signal Processing, December, 2012The article of record as published may be located at http://dx.doi.org/10.1109/TSP.2012.2218243
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Framework for Augmenting Current Fleet with Commercially Available Assets for Logistics Support in Contested Environment Apte, Aruna; Doerr, Ken; Apte, Uday (Monterey, California. Naval Postgraduate School, 2020-09-02); NPS-LM-20-155China believes logistics in the contested environment is an Achilles’s heel for the U.S. Navy (USN). It is therefore critical that we explore ways to develop capabilities to replenish potential combating forces in the ...
Negelspach, Greg L. (Monterey, California. Naval Postgraduate School, 1994-09);Optimal scheduling of parallel programs onto multiprocessor computers is an exponentially hard problem. Because of this, most scheduling algorithms in use today rely on heuristics to determine the best balance of computation ...
Banham, Stephen R. (Monterey, California. Naval Postgraduate School, 1992-03);This thesis investigates the use of current graphical interface techniques to build more effective computer-user interfaces to Operations Research (OR) schedule optimization models. The design is directed at the scheduling ...