尚鹏, 朱光喜, 苏钢, 曾宇辉. 基于正交空分复用的多用户调度策略[J]. 微电子学与计算机, 2010, 27(10): 18-22.
引用本文: 尚鹏, 朱光喜, 苏钢, 曾宇辉. 基于正交空分复用的多用户调度策略[J]. 微电子学与计算机, 2010, 27(10): 18-22.
SHANG Peng, ZHU Guang-xi, SU Gang, ZENG Yu-hui. Multiuser Scheduling with Orthogonal Space-Division Multiplexing[J]. Microelectronics & Computer, 2010, 27(10): 18-22.
Citation: SHANG Peng, ZHU Guang-xi, SU Gang, ZENG Yu-hui. Multiuser Scheduling with Orthogonal Space-Division Multiplexing[J]. Microelectronics & Computer, 2010, 27(10): 18-22.

基于正交空分复用的多用户调度策略

Multiuser Scheduling with Orthogonal Space-Division Multiplexing

  • 摘要: 为了消除多用户MIMO下行系统的多用户间干扰以及改进系统的误码率性能, 研究了块对角化预编码与几何均值分解的联合方案 (BD-GMD) .针对BD-GMD系统的资源分配和用户调度, 对比了等功率分配和注水算法对系统的影响, 并基于系统容量最大化, 提出了一种根据用户信道的子空间特性的低复杂度的用户调度算法.此外, 对比分析了穷举搜索算法和传统的贪婪算法.数值仿真结果表明, 文中所提出的基于正交投影的多用户调度算法充在保证系统容量的同时降低了算法复杂度.

     

    Abstract: The combined Block Digonalization precoding and Geometric Mean Decomposition (BD-GMD) scheme is developed to eliminate the multi-user interference and improve the system performance of bit error rate (BER) in a multiuser multiple input multiple output (MU-MIMO) .For the resource allocation and scheduling of BD-GMD system, the equal power allocation and water-filling algorithm for the impact of the system is compared.According to the subspace characteristics, a multi-user scheduling scheme based on maximizing the system throughput with low computational complexity is proposed.At the meantime, the brute-force search algorithm and conventional greedy algorithm is analyzed and compared with the proposed algorithm.Simulation results show that the proposed algorithm based on the orthogonal projection can reduce the computational complexity while maintaining the system throughput.

     

/

返回文章
返回