Low Complexity Suboptimal User Selection Algorithm for Multiuser MIMO Systems with Block Diagonalization |
| |
Authors: | Chuiqiang Sun Jianhua Ge |
| |
Affiliation: | 1. The State Key Laboratory of Integrated Service Networks, Xidian University, Mailbox 11 No. 2 South Taibai Road, Xi’an, 710071, Shaanxi, China
|
| |
Abstract: | In downlink multiuser multiple-input multiple-output (MU-MIMO) systems, block diagonalization (BD) is a well-kown precoding technique that eliminates interuser interference. The number of simultaneously supportable users with BD is limited by the number of base station transmit antennas and the number of user receive antennas. The brute-force search for the optimal user set, however, is computationally prohibitive. Therefore, we propose a low complexity and suboptimal user selection algorithm based on block diagonalization for MU-MIMO systems. We introduce a strong tight upper bound of sum capacity as selection metric. Furthermore, we employ a substitution operation to improve system performance. The computational complexity analysis and simulation results show that the proposed algorithm achieves comparable throughput with low complexity compared to the existing algorithms. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|