J4 ›› 2015, Vol. 42 ›› Issue (5): 1-6+32.doi: 10.3969/j.issn.1001-2400.2015.05.001

• 研究论文 •    下一篇

一种低复杂度的MIMO正交缺陷门限减格预编码算法

王伟;李勇朝;张海林   

  1. (西安电子科技大学 综合业务网理论及关键技术国家重点实验室,陕西 西安  710071)
  • 收稿日期:2014-04-28 出版日期:2015-10-20 发布日期:2015-12-03
  • 通讯作者: 李勇朝
  • 作者简介:王伟(1980-),男,西安电子科技大学博士研究生,E-mail: weiwang@mail.xidian.edu.cn.
  • 基金资助:

    高等学校博士学科点专项科研基金资助项目(2012020311000);新世纪优秀人才支持计划资助项目(NCET-12-0918, 72131855);国家重大科技专项资助项目(2013ZX03003008-004);国家111创新引智基地资助项目(B08038)

Low complexity lattice reduction aided precoding algorithm with orthogonality defect threshold for MIMO systems

WANG Wei;LI Yongzhao;ZHANG Hailin   

  1. (State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an  710071, China)
  • Received:2014-04-28 Online:2015-10-20 Published:2015-12-03
  • Contact: Yongzhao

摘要:

针对减格预编码算法复杂度较高的问题,提出了一种基于正交缺陷门限的低复杂度减格预编码算法.通过引入正交缺陷门限作为提前中止减格算法的条件,并对信道矩阵进行预排序来提高提前中止概率,有效降低了减格算法的复杂度.此外,为了获得预编码性能复杂度的折中,提出了一种功率损失因子(Power Loss Factor,PLF)来优化正交缺陷门限值.仿真结果表明,该算法能够显著降低减格预编码算法的复杂度,而误码率性能近似传统减格预编码算法.

关键词: 多用户, 多输入多输出, 减格, 预编码

Abstract:

To reduce the complexity of lattice reduction aided (LRA) precoding, a low complexity LRA precoding based on the orthogonality defect threshold is proposed. We introduce the orthogonality defect (od) threshold as an early-termination condition into the lattice reduction (LR) algorithm which can reduce computational complexity by adaptively early terminating the LR processing. And, sorted QR decomposition of the channel matrix is used to enhance the probability of the early termination which further reduces computational complexity. Moreover, to achieve a favorable tradeoff between performance and complexity, we define a power loss factor (PLF) to optimize the od threshold. Simulation results show that the proposed algorithm can achieve significant complexity savings with nearly the same bit-error-rate (BER) performance as the traditional LRA precoding algorithm.

Key words: multiuser, multiple input multiple output, lattice reduction, precoding

中图分类号: 

  • TN929.5