一种低复杂度的基于加权速率和最大化的多用户MIMO系统调度算法

针对多用户多输入多输出系统中，基于脏纸编码的迭代注水算法加权速率和最大化复杂度很高的问题，提出了一种基于迫零 脏纸编码的低复杂度多用户资源调度算法.该算法在发射功率限制条件下，结合功率分配和多用户调度，根据信道状态信息构造用户选择参量，依次选择用户.由于只需要有限次循环，同时根据用户摒弃准则去除了信道状态不好的用户，从而降低了复杂度.仿真结果表明， 所提出的算法与迭代注水算法相比，在相同的仿真条件下，可以获得后者90%以上的加权速率和，随着用户数的增加，加权速率和性能趋向于后者，同时复杂度由与用户数的平方成正比降到了与用户数成正比.

A Low Complexity Maximum Weighted Sum-rate Based Scheduling Algorithm in Multi-user MIMO System

To solve the problem that the dirty paper coding based iterative water filling algorithm to maximize weighted sum rate has high complexity in multi user multi input multi output (MIMO) system, a low complexity zero forcing dirty paper coding based multi user resource scheduling algorithm was proposed. Under the transmit power constraint, the proposed algorithm combines power allocation and user scheduling. Users are selected in sequence based on the user selection parameters which are constructed using the channel state information. The proposed algorithm only needs finite repetitions, and can drop off those users with poor channel quality through the user rejection criteria. Therefore the complexity is reduced. The simulation results show that, compared to the iterative water filling algorithm, the proposed algorithm achieves more than 90% weighted sum rate of the iterative water filling algorithm under similar simulation conditions. With the increasing user number the weighted sum rate of the proposed algorithm approximates to that of the iterative water filling algorithm. And the complexity is reduced from the one in proportion to the square of number of users to the one in proportion to the number of users.