Interference Suppression for Massive MU-MIMO Long-Term Beamforming with Matrix Inversion Approximation
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917389363314688 |
|---|---|
| author | Kiani, Amirreza Rasteh, Ali Mezzavilla, Marco Rangan, Sundeep |
| author_facet | Kiani, Amirreza Rasteh, Ali Mezzavilla, Marco Rangan, Sundeep |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_06355 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Interference Suppression for Massive MU-MIMO Long-Term Beamforming with Matrix Inversion Approximation Kiani, Amirreza Rasteh, Ali Mezzavilla, Marco Rangan, Sundeep Signal Processing Hardware Architecture 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. |
| title | Interference Suppression for Massive MU-MIMO Long-Term Beamforming with Matrix Inversion Approximation |
| topic | Signal Processing Hardware Architecture |
| url | https://arxiv.org/abs/2604.06355 |