Abstract:Long-term beamforming substantially reduces the channel estimation and inversion overhead of conventional massive MU-MIMO receivers; yet, its construction still hinges on the inversion of a large Hermitian matrix, whose condition number deteriorates with the per-user SNR dynamic range. When this inversion is approximated in hardware via the conjugate gradient (CG) algorithm, the deterioration directly inflates the iteration count and, consequently, the energy and latency budget. We propose a hardware-friendly low-rank preconditioning framework that targets exactly this bottleneck. The preconditioner is constructed from the top eigenpairs of the long-term covariance matrix through a randomized complex eigenvalue decomposition (RC-EVD), whose inner QR factorizations are realized via a Cholesky-based scheme (QRC), confining the dominant cost to generalized matrix multiplication (GEMM) and small triangular solves that map naturally onto systolic arrays. We further show that performing the preconditioned CG inversion in the beamspace domain induces sparsification of the system matrix and provides additional convergence acceleration at negligible transformation cost. Ray-tracing simulations confirm that the joint scheme reduces the required CG iteration count by two to three while matching the post-equalization SINR of the exact inversion.
Abstract: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.
Abstract:Fully digital massive MIMO systems with large numbers (1000+) of antennas offer dramatically increased capacity gains from spatial multiplexing and beamforming. Designing digital receivers that can scale to these array dimensions presents significant challenges regarding both channel estimation overhead and digital computation. This paper presents a computationally efficient and low-overhead receiver design based on long-term beamforming. The method combines finding a low-rank projection from the spatial covariance estimate with a fast polynomial matrix inverse. Ray tracing simulations show minimal loss relative to complete instantaneous beamforming while offering significant overhead and computational gains.