低复杂度的多用户MIMO下行链路块对角化算法

张健; 刘元安; 谢刚; 毛峻岭; 刘芳

doi:10.3969/j.issn.1001-0548.2011.05.005

低复杂度的多用户MIMO下行链路块对角化算法

北京邮电大学泛网无线通信教育部重点实验室北京海淀区 100876

基金项目:

中加国际科学与技术合作项目(2010DFA11320);国家自然科学基金(60802033, 60873190);中央高校基本科研业务费专项资金(2009RC0308, G470209);国家科技重大专项(2010ZX03005-001-03, 2010ZX03007-003-04)

详细信息

作者简介:
张健(1983-)，男，博士生，主要从事宽带无线移动通信方面的研究

中图分类号: TN911
计量
- 文章访问数: 4880
- HTML全文浏览量: 135
- PDF下载量: 92
出版历程
- 收稿日期: 2009-11-07
- 修回日期: 2011-05-02
- 刊出日期: 2011-10-14

Low Complexity Block Diagonalization Algorithm for Multiuser MIMO Downlink Systems

Key Laboratory of Universal Wireless Communications of Ministry of Education,Beijing University of Posts and Telecommunications Haidian Beijing 100876

摘要

摘要: 提出了一种低复杂度的多用户多输入多输出(MIMO)下行链路块对角化预编码算法，证明了该算法能够实现与传统块对角化算法完全相同的系统总容量。算法基于迫零方法进行改造，通过对迫零向量实施格拉姆-施密特正交，可以快速实现等效下行链路的全局块对角化，从而获得最终的预编码矩阵。由于算法避免了传统块对角化算法求解零空间所进行的矩阵奇异值分解运算，其计算复杂度相比传统方法有显著下降，下降幅度接近50%。
- 块对角化 /
- 计算复杂度 /
- 多输入多输出 /
- 预编码
Abstract: A low complexity block diagonalization precoding algorithm is proposed for multiuser multiple-input multiple-output (MIMO) downlink systems. It is proved that the algorithm can achieve the same sum capacity with that of the traditional block diagonalization one. The algorithm improves the existing zero forcing method. By performing Gram-Schmidt orthogonalization to zero forcing beams, the algorithm can achieve fast global block diagonalization of the equivalent downlink channel, thus further obtaining the precoders. Avoiding matrix singular value decomposition required when calculating null space in the traditional block diagonalization algorithm, the computational complexity of the proposed algorithm is greatly reduced by about 50%.
- block diagonalization /
- computational complexity /
- multiple-input multiple-output /
- precoding