MIMO Detection Using Gradient-Based Markov Chain Monte Carlo Methods

Optimal detection of symbols transmitted over multiple-input multiple-output (MIMO) wireless channels is known to entail exponentially increasing complexity with MIMO dimensions, making it impractical for large-scale systems. Recently, Markov chain Monte Carlo (MCMC) has been combined with the gradient descent (GD) method to create a promising machine learning solution to this issue. This paper proposes a novel algorithm for approaching optimal detection via MCMC random walk accelerated by Nesterov's gradient method, efficiently exploring the discrete search space for MIMO detection. Our proposed method utilizes multiple GDs per random walk and guarantees high sampling efficiency while mitigating the complexity associated with matrix inversions. Simulation results and complexity analysis reveal that the proposed method achieves near-optimal performance and scales effectively to large MIMO dimensions.