Dynamic Conjugate Gradient Unfolding for Symbol Detection in Time-Varying Massive MIMO

This article addresses the problem of symbol detection in time-varying Massive Multiple-Input Multiple-Output (M-MIMO) systems. While conventional detection techniques either exhibit subpar performance or impose excessive computational burdens in such systems, learning-based methods which have shown great potential in stationary scenarios, struggle to adapt to non-stationary conditions. To address these challenges, we introduce innovative extensions to the Learned Conjugate Gradient Network (LcgNet) M-MIMO detector. Firstly, we expound Preconditioned LcgNet (PrLcgNet), which incorporates a preconditioner during training to enhance the uplink M-MIMO detector's filter matrix. This modification enables the detector to achieve faster convergence with fewer layers compared to the original approach. Secondly, we introduce an adaptation of PrLcgNet referred to as Dynamic Conjugate Gradient Network (DyCoGNet), specifically designed for time-varying environments. DyCoGNet leverages self-supervised learning with Forward Error Correction (FEC), enabling autonomous adaptation without the need for explicit labeled data. It also employs meta-learning, facilitating rapid adaptation to unforeseen channel conditions. Our simulation results demonstrate that in stationary scenarios, PrLcgNet achieves faster convergence than LCgNet, which can be leveraged to reduce system complexity or improve Symbol Error Rate (SER) performance. Furthermore, in non-stationary scenarios, DyCoGNet exhibits rapid and efficient adaptation, achieving significant SER performance gains compared to baseline cases without meta-learning and a recent benchmark using self-supervised learning.