.png){kind=icon}
.png){kind=icon}
Return
An optimized preprocessing Gauss-Seidel iterative detection algorithm for massive MIMO systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asej.2025.103358.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The mini-mum mean square error(MMSE) algorithm nearly achieves optimal performance in massive MultipleInput Multiple-Output (MIMO) detection, but its direct application is limited by the computational burden of high-dimensional matrix inversions. we propose an Optimized Preprocessing Gauss-Seidel (OPGS) iterative detection algorithm in this paper. The OPGS algorithm transforms the MMSE filter matrix into a linear equation, reducing complexity and eliminating the need for direct inversion. Additionally, by introducing a banded matrix to optimize the filter vector, we derived a novel iterative method that significantly improves both performance and convergence speed. We tested the proposed algorithm under various conditions, and simulations show that it requires fewer iterations to achieve detection performance similar to the MMSE algorithm under the same conditions. Specifically, in system with 256 x 32, after two iterations, the performance between our algorithm and the MMSE method is only 0.04 dB. Notably, this result was accomplished with a minimal iteration.
Keywords:
Preprocessing
Signal Detection
Massive MIMO
Gauss-Seidel Method
Journal
IF:
5.9
Papers:
3.4K
Citations:
1.2W