Abstract
Block diagonalization is a downlink preceding technique that pre-cancels inter-user interference in multiuser MIMO systems. When there are a large number of users, the system throughput can be significantly increased by selecting a subset of users and a subset of receive antennas for each user. The optimal user and antenna subset can be obtained by exhaustively searching over all possible user and antenna combinations to find the one with the highest sum throughput. This brute-force solution, however, is prohibitively complicated. To reduce the complexity, in this paper we propose a low-complexity suboptimal user and antenna selection algorithm. For most system configurations, we show that our proposed algorithm achieves up to 98% of the optimal sum throughput of the exhaustive search, where the complexity is orders of magnitude lower than the exhaustive search method.

This publication has 8 references indexed in Scilit: