Resource allocation algorithms for minimum rates scheduling in MIMO-OFDM systems

In this paper, we consider a multiple-input-multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) downlink scenario, where each receiving mobile station has quality of service requirements, namely minimum rate requirements. For this problem we propose three heuristic resource allocation algorithms, which have a much lower complexity than the existing optimal solution (opt). We compare and evaluate these algorithms according to sum rate performance and complexity. The first strategy is based on a heuristic sum rate maximisation algorithm using the so-called eigenvalue updates. In our second algorithm, we make use of the duality of uplink and downlink, which allows us to do the allocation in the dual uplink. Finally, our third algorithm is based on the well-known zero-forcing dirty paper coding (ZF-DPC) principles, which use the Gram Schmidt process to orthogonalise the transmissions towards the different users. Copyright (C) 2010 John Wiley & Sons, Ltd.