论文部分内容阅读
为了降低有限反馈多用户MIMO系统中的用户选择算法的复杂度,使系统支持更多的用户,基于贪婪用户选择算法(GUS),提出了一种低复杂度用户选择算法。该算法将Schmidt正交化的思想引入GUS算法,通过计算相互正交的预编码向量来构成预编码矩阵,并估计信道容量,最后寻找最佳的用户组合进行下行数据的传输。该低复杂度算法利用预编码向量的正交性避免了矩阵求伪逆的过程,从而极大地降低了计算量。仿真结果表明,在相同反馈方式下,改进后的算法仍能取得和GUS近乎相同的系统总容量。
In order to reduce the complexity of user selection algorithm in finite feedback multi-user MIMO system and make the system support more users, a low complexity user selection algorithm is proposed based on greedy user selection algorithm (GUS). The algorithm introduces Schmidt’s orthogonalization into the GUS algorithm, constructs a precoding matrix by calculating the orthogonal precoding vectors, and estimates the channel capacity, and finally finds the best user combination for downlink data transmission. The low complexity algorithm makes use of the orthogonality of precoding vector to avoid the process of finding pseudo-inverse of matrix, which greatly reduces the computational complexity. The simulation results show that under the same feedback mode, the improved algorithm can still achieve almost the same system total capacity as GUS.