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

• Original Articles •     Next Articles

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 E-mail:yzli@mail.xidian.edu.cn

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

CLC Number: 

  • TN929.5