采用Tomlinson-Harashima预编码的多天线多用户系统的低复杂度用户选择算法  

A low complexity user selection algorithm for multi-antenna multi-user systems with tomlinson-harashima precoding

作　　者：史林[1] 邱玲[1] 

机构地区：[1]中国科学技术大学个人通信与扩频实验室,合肥230027

出　　处：《高技术通讯》2009年第8期790-794,共5页Chinese High Technology Letters

基　　金：国家自然科学基金(60496314);863计划(2006AA01Z256)资助项目

摘　　要：针对采用Tomlinson-Harashima预编码(THP)的下行多天线多用户系统,提出了一种基于启发式Gram-Schmidt(G-S)正交化的低复杂度的贪婪用户选择算法。仿真结果表明,该算法的系统吞吐量性能非常接近最优遍历搜索的性能,优于迫零波束成型准正交用户选择(ZFBF-SUS)方案的性能,并且在容量域上具有渐进最优性。This paper proposes a low complexity greety user selection algorithm based on heuristic Gram-Schmidt orthogonalization for the downlink multi-antenna multi-user systems with Tomlinson-Harashima precoding. The simulation results show that the throughput performance of the proposed algorithm is very close to that of the exhaustive search method, better than the performance of the ZFBF-SUS scheme. Furthermore, it has the asymptotic optimality in the capacity domain.

关 键 词：下行多天线多用户系统 Tomlinson-Harashima预编码(THP) 启发式G-S正交化 用户选择 渐进最优 

分 类 号：TN919.3[电子电信—通信与信息系统]