针对抑制邻小区干扰的多输入多输出块对角化系统,提出了一种新的低复杂度用户选择算法.该方法通过贪心搜索迭代地选择用户,在每一步中选择使小区系统容量增加最大的用户,并自适应地调整服务用户数而使小区系统容量最大化.仿真结果表明,该算法在高信噪比下可以达到穷举搜索约99%的小区系统容量,在低信噪比下该算法和穷举算法系统的容量几乎相同.
A new low-complexity user selection algorithm was proposed for multiple-input multiple-output (MIMO) system employing block diagonalization (BD) with other-cell interference (OCI) suppression. The algorithm iteratively selects users through greedy search. In each user selection step, the user who contributes most to the cell capacity is added to the selected user set, and the number of activated users is adaptively adjusted to maximize the cell capacity. The simulation results show that the proposed algorithm can achieve about 99% of the cell capacity of the complete search at high SNRs, and at low SNRs the two come out almost the same.