Approximate Iteration Detection and Precoding in Massive MIMO

Chuan Tang

doi:10.1109/CC.2018.8387997

Approximate Iteration Detection and Precoding in Massive MIMO

2018-05-01

13

PRE

AI

DOI：10.1109/CC.2018.8387997

原文链接

原文求助

摘要

En 中文

Massive multiple-input multiple-output provides improved energy efficiency and spectral efficiency in 5G. However it requires large-scale matrix computation with tremendous complexity, especially for data detection and precoding. Recently, many detection and precoding methods were proposed using approximate iteration methods, which meet the demand of precision with low complexity. In this paper, we compare these approximate iteration methods in precision and complexity, and then improve these methods with iteration refinement at the cost of little complexity and no extra hardware resource. By derivation, our proposal is a combination of three approximate iteration methods in essence and provides remarkable precision improvement on desired vectors. The results show that our proposal provides 27%-83% normalized mean-squared error improvement of the detection symbol vector and precoding symbol vector. Moreover, we find the bit-error rate is mainly controlled by soft-input soft-output Viterbi decoding when using approximate iteration methods. Further, only considering the effect on soft-input soft-output Viterbi decoding, the simulation results show that using a rough estimation for the filter matrix of minimum mean square error detection to calculating log-likelihood ratio could provide enough good bit-error rate performance, especially when the ratio of base station antennas number and the users number is not too large.

Keyword:

massive MIMO

detection and precoding

matrix inversion

iteration refinement

soft Viterbi decoding

Approximate Iteration Detection and Precoding in Massive MIMO

摘要

AI总结

期刊

机构

引用论文