Hits:

Indexed by:会议论文

Date of Publication:2016-01-01

Included Journals:CPCI-S

Page Number:2601-2605

Key Words:massive MIMO system; successive interference cancellation; lyapunov central limit theorem; error propagation

Abstract:Though Successive Interference Cancellation (SIC) has low computational complexity which provides the potential to facilitate the detection of massive MIMO systems, the performance of the SIC detector is strongly impacted by the order in which the inputs are detected. Unfortunately, optimizing the detection order with low complexity is still a difficult problem that has not been addressed sufficiently. For massive MIMO systems, the large dimension makes the conditions of Lyapunov central limit theorem satisfied. Using this theorem, we propose an algorithm from the global optimal condition of binary quadratic programming to calculate the probability that the inputs can be correctly decided. Then, the detection is descendingly ordered by such decision probability. In this way, the error propagation of SIC can be overcome efficiently. Simulation results substantiate the performance of the proposed detector.