Optimizing a communication of a Q-antenna Access Point (AP)
with K single antenna terminals is not straightforward. Since a
global optimization might not be solvable in real time, the AP has
several alternatives involving both the physical layer, e.g. beamforming
and power/bit allocation, and the DLC, such as scheduling.
The purpose of this paper is twofold. First, for K ≤ Q we
compare traditional bit allocation strategies with a novel modified
approach, especially in terms of fairness. Second, we focus on the
combinatorial problem that arises whenK >Q, and propose several
alternatives for the scheduling of the users into groups, which
is done together with the bit allocation. Simulations show that better
performance is obtained at the expense of complexity.
CitationPérez, A.; Bartolome, D.; Pascual, T. Multiuser spatial scheduling algorithms for wireless systems. A: ICASSP Conference 2003. "ICASSP Conference 2003". Hong Kong: 2003, p. 185-188.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org