Metraipolis › archive › dc_e8a8c7e646fb
Hamiltonian Monte Carlo for Vector Perturbation Precoding in MU-MIMO via Continuous Relaxation — arXiv:2609.23011
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23011
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:55:23.474Z
- SHA-256 of the archived text
a9714e2731c9e30586ee07a50e057af39a9e66761b350643537cdd2cee05a4af- Stable URL of this page
https://metraipolis.com/documento/dc_e8a8c7e646fb
How to cite
Hamiltonian Monte Carlo for Vector Perturbation Precoding in MU-MIMO via Continuous Relaxation — arXiv:2609.23011 — arXiv (en), https://arxiv.org/abs/2609.23011 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e8a8c7e646fb (Metraipolis archive dc_e8a8c7e646fb, sha256 a9714e2731c9e30586ee07a50e057af39a9e66761b350643537cdd2cee05a4af)
BibTeX
@misc{dce8a8c7e646fb,
title = {Hamiltonian Monte Carlo for Vector Perturbation Precoding in MU-MIMO via Continuous Relaxation — arXiv:2609.23011},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23011},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e8a8c7e646fb; sha256 a9714e2731c9e30586ee07a50e057af39a9e66761b350643537cdd2cee05a4af},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23011. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.IT). Categorie arXiv: Information Theory (cs.IT) ; Networking and Internet Architecture (cs.NI). Pagina del lavoro: https://arxiv.org/abs/2609.23011 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T21:44:07.461Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).