Hamiltonian Monte Carlo for Vector Perturbation Precoding in MU-MIMO via Continuous Relaxation
Year: 2026
Type: preprint
Abstract: Multi-user multiple-input multiple-output (MU-MIMO) is a key technology that improves wireless capacity through multiple antennas. In MU-MIMO downlink precoding, vector perturbation (VP) is a representative nonlinear method that achieves high performance. However, its search for the integer perturbation vector reduces to a closest vector problem, whose complexity grows rapidly as the number of users increases. We propose a method that relaxes the discrete structure of the integer perturbation into a continuous mixture of $t$-distributions, enabling efficient search via gradient-based Hamiltonian Monte Carlo (HMC). Complexity analysis and numerical experiments demonstrate the effectiveness of the proposed method. Its search complexity scales as O(N^2) in the number of users N. At a symbol error rate of 10^-3, it performs within 2.4 dB of a hypersphere approximation benchmark, which approximates the performance limit of VP. This paper reframes the VP perturbation search as a probabilistic inference problem, providing a general formulation for handling high-dimensional discrete search in a continuous space.
Source: arXiv (Cornell University)
Institutions: Mukogawa Women's University, Hokkaido University
Language: English
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7214019193