| 采用Tomlinson-Harashima预编码的多天线多用户系统的低复杂度用户选择算法 |
| |
| 引用本文： | 史林,邱玲.采用Tomlinson-Harashima预编码的多天线多用户系统的低复杂度用户选择算法[J].高技术通讯,2009,19(8). |
| |
| 作者姓名： | 史林 邱玲 |
| |
| 作者单位： | 中国科学技术大学个人通信与扩频实验室,合肥,230027 |
| |
| 基金项目： | 国家自然科学基金，863计划 |
| |
| 摘 要： | 针对采用Tomlinson-Harashima预编码(THP)的下行多天线多用户系统,提出了一种基于启发式Gram-Schmidt(G-S)正交化的低复杂度的贪婪用户选择算法.仿真结果表明,该算法的系统吞吐量性能非常接近最优遍历搜索的性能,优于迫零波束成型准正交用户选择(ZFBF-SUS)方案的性能,并且在容量域上具有渐进最优性.
|
| 关 键 词： | 下行多天线多用户系统 Tomlinson-Harashima预编码(THP) 启发式G-S正交化 用户选择 渐进最优 |
A low complexity user selection algorithm for multi-antenna multi-user systems with tomlinson-harashima precoding |
| |
| Shi Lin,Qiu Ling.A low complexity user selection algorithm for multi-antenna multi-user systems with tomlinson-harashima precoding[J].High Technology Letters,2009,19(8). |
| |
| Authors: | Shi Lin Qiu Ling |
| |
| Affiliation: | Shi Lin,Qiu Ling(Personal Communication Network and Spread Spectrum Laboratory,University of Scienceand Technology of China,Hefei 230027) |
| |
| Abstract: | This paper proposes a low complexity greedy 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. |
| |
| Keywords: | downlink multi-antenna multi-user systems tomlinson-harashima precoding(THP) heuristic gramschmidt orthogonalization user selection asymptotic optimality |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
