IEEE Transactions on Signal Processing, vol. 54, no. 9, pp. 3658-3663, Sep. 2006.

Low Complexity User Selection Algorithms for Multiuser MIMO Systems with Block Diagonalization

Zukang Shen, Runhua Chen, Jeffrey G. Andrews, Robert W. Heath, Jr., and Brian L. Evans

Wireless Networking and Communications Group, The University of Texas at Austin, Austin, TX 78712 USA - - - -

Draft of Paper


Block Diagonaliation (BD) is a precoding technique that eliminates inter-user interference in downlink multiuser multiple-input multiple-output (MIMO) systems. The number of simultaneously supportable users with BD is limited by the number of transmit and receive antennas. In a downlink MIMO system with a large number of users, the basestation may select a subset of users to serve in order to maximize the total throughput. The brute-force search for the optimal user set, however, is computationally prohibitive. We propose two low complexity suboptimal user selection algorithms for multiuser MIMO systems with BD. Both algorithms aim to select a subset of users such that the total throughput is nearly maximized. The first user selection algorithm greedily maximizes the total throughput, whereas the criterion of the second algorithm is based on the channel energy. We show that both algorithms have linear complexity in the number of users and achieve around 95% of the total throughput of the complete search method in simulation.

COPYRIGHT NOTICE: All the documents on this server have been submitted by their authors to scholarly journals or conferences as indicated, for the purpose of non-commercial dissemination of scientific work. The manuscripts are put on-line to facilitate this purpose. These manuscripts are copyrighted by the authors or the journals in which they were published. You may copy a manuscript for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect these copyrights.

Last Updated 08/21/06.