Fast Converging Gauss-Seidel Iterative Algorithm for Massive MIMO Systems
preprint
OA: closed
Abstract
For massive multiple-input multiple-output (MIMO) communications, the minimum mean square error (MMSE) scheme provides close to optimal recognition but involves inverting the high-dimensional matrix. A Gauss-Seidel (GS) detector based on conjugate gradient and Jacobi iteration (CJ) joint processing is introduced to address this problem. Firstly, the signal is initialized with the best of the three initialization regimes for faster algorithm convergence. Secondly, the signal is processed together with CJ. Finally, the pre-processed result is transferred to the GS detector. The simulation results indicate that the proposed iterative algorithm has a lower BER performance than the GS and improved iterative scheme based on GS in channels with different correlation levels.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00