.png){kind=icon}
.png){kind=icon}
Return
Low-Complexity Implicit Detection for Massive MIMO Using Neumann Series
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2022.3172950.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In massive MIMO systems, the high complexity of signal detection comes mainly from computing a Gram matrix and its inversion. In this correspondence, we propose a low-complexity MIMO detection method based on the Neumann series (NS), which does not require explicitly computing the Gram matrix and its inversion. The proposed method leverages the statistical information of the Gram matrix to compute an initialization matrix, which guarantees the convergence of NS expansion. The signal detection is conducted implicitly by transforming matrix inversion and product operations into matrix-vector multiplication operations. By doing so, it reduces the computational complexity of MIMO signal detection from O(BU2 + U-3) to O(BUN), where B, U, and N are the numbers of antennas at the base station, at the user equipment, and NS terms, respectively. Simulation results show that, compared with existing approaches, the proposed method can significantly reduce the signal detection complexity while achieving similar performance.
Keywords:
Implicit detection
low-complexity
massive MIMO
matrix inversion approximation
neumann series expansion
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W