SPARApr 7

Interference Suppression for Massive MU-MIMO Long-Term Beamforming with Matrix Inversion Approximation

arXiv:2604.0635547.3h-index: 33
AI Analysis

This work addresses computational challenges for VLSI implementations in 5G networks, but it is incremental as it builds on existing beamforming and inversion methods.

The paper tackles the performance degradation of long-term beamforming in massive MIMO systems due to dominant interferers affecting matrix inversion, and shows that a subspace nulling method reduces conjugate gradient iterations by improving numerical stability in simulations.

Long-term beamforming (LTBF) is a widely-used scalable alternative to instantaneous multi-user MIMO processing that leverages slowly varying spatial channel statistics. VLSI implementations require matrix inversion that become computationally challenging for massive MIMO systems with large number of antennas. In this work, we show that dominant interferers significantly degrade the numerical conditioning of the LTBF covariance matrix, leading to severe performance loss in finite-precision implementations of polynomial and conjugate gradient (CG) based inversion methods. To address this issue, we propose a subspace nulling approach that operates solely on long-term channel statistics and acts as an implicit preconditioning step for LTBF. By projecting the received signal onto the orthogonal complement of the dominant interference subspace, the proposed method reduces the eigenvalue spread of the covariance matrix and improves numerical stability. Through ray-tracing simulations in a realistic 5G scenario, we demonstrate that the proposed method substantially reduces the number of CG iterations required to achieve near-optimal performance across floating-point and fixed-point implementations while preserving the low-overhead nature of LTBF.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes