| Summary: | In this paper, a novel iterative discrete estimation (IDE) algorithm, which is called the modified IDE (MIDE), is proposed to reduce the computational complexity in MIMO detection in uplink massive MIMO systems. MIDE is a revision of the alternating direction method of multipliers (ADMM)-based algorithm, in which a self-updating method is designed with the damping factor estimated and updated at each iteration based on the Euclidean distance between the iterative solutions of the IDE-based algorithm in order to accelerate the algorithm’s convergence. Compared to the existing ADMM-based detection algorithm, the overall computational complexity of the proposed MIDE algorithm is reduced from <inline-formula> <math display="inline"> <semantics> <mrow> <mi>O</mi> <mfenced separators="" open="(" close=")"> <msubsup> <mi>N</mi> <mi>t</mi> <mn>3</mn> </msubsup> </mfenced> <mo>+</mo> <mi>O</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>N</mi> <mi>r</mi> </msub> <msubsup> <mi>N</mi> <mi>t</mi> <mn>2</mn> </msubsup> </mrow> </mfenced> </mrow> </semantics> </math> </inline-formula> to <inline-formula> <math display="inline"> <semantics> <mrow> <mi>O</mi> <mfenced separators="" open="(" close=")"> <msubsup> <mi>N</mi> <mi>t</mi> <mn>2</mn> </msubsup> </mfenced> <mo>+</mo> <mi>O</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>N</mi> <mi>r</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mrow> </mfenced> </mrow> </semantics> </math> </inline-formula> in terms of the number of complex-valued multiplications, where Ntand Nr are the number of users and the number of receiving antennas at the base station (BS), respectively. Simulation results show that the proposed MIDE algorithm performs better in terms of the bit error rate (BER) than some recently-proposed approximation algorithms in MIMO detection of uplink massive MIMO systems.
|
|---|