User selection plays a crucial role when aiming to improve channel throughput in multiuser multiple- input multiple-output downlink systems with block diagonalization linear precoding. While an optimal group of users can be found by exhaustively searching all possible combinations of users, the process becomes prohibitively complex when there is a large number of users. In this paper, we propose a greedy suboptimal user selection algorithm, which iteratively selects a user to maximize the product of the singular values of the effective channels from a set of unselected users. The proposed algorithm is based on the iterative precoder design method, whereby interuser interference is perfectly cancelled with lower complexity than with the singular value decomposition-based precoding technique. Moreover, to avoid frequent use of singular value decomposition, the proposed algorithm applies QR decomposition to the selected channel matrices in order to obtain singular values, which are equivalent to the product of diagonal elements in the upper triangular matrix. Simulation results show that, under a high SNR regime, the proposed algorithm outperforms several other greedy algorithms and can provide the same performance as a capacity-based algorithm for both correlated and uncorrelated channels with significantly reduced complexity.
Read full abstract