论文部分内容阅读
为了解决多输入多输出(MIMO)广播信道存在大尺度衰落条件下的多用户调度问题,将zero-forcing dirty-paper(ZF-DP)发送方案和最大权重匹配方法相结合,给出了一种时分的调度算法。在此基础上,采用用户排序和减小匹配搜索范围的方法,给出了2种简化算法,并且分析和比较了它们的复杂度。仿真结果表明:与相同发送方案下的线性最优调度相比,这2种简化算法的性能差距不超过15%,而且它们的复杂度较低,易于实现,具有较高的实用价值。结果还为调度间隔、匹配搜索范围等参数的选择提供了参考。
In order to solve the problem of multi-user scheduling under the condition of large-scale fading in a multiple-input multiple-output (MIMO) broadcast channel, a zero-forcing dirty-paper (ZF-DP) transmission scheme and a maximum weight matching method are combined Scheduling algorithm. Based on this, two kinds of simplification algorithms are given, and the complexity of them is analyzed and compared. The simulation results show that compared with the linear optimal scheduling under the same transmission scheme, the performance of the two simplified algorithms does not exceed 15%, and their complexity is low and easy to implement, which is of high practical value. The results also provide reference for the selection of parameters such as scheduling interval and matching search range.