Skip to content
DraconiticResearch
Search Sources API
194,226 studies31 sourcesUpdated 48 min ago
PreprintarXiv licencearXiv

Deterministic Smoothed MAP Detection for High-Dimensional MIMO Systems

Abstract

We propose a deterministic smoothed maximum a posteriori (SMAP) framework for high-dimensional multiple-input multiple-output (MIMO) detection. The discrete constellation prior is approximated by an i.i.d. Gaussian mixture, yielding a differentiable MAP objective that retains the constellation structure while enabling continuous optimization. Unlike sampling-based approaches, SMAP formulates detection as a deterministic optimization problem and can be initialized by the output of an arbitrary detector, allowing it to operate either as a standalone detector or as a refinement stage. For hard detection, we introduce SMAP-KR, which complements the continuous solution with a local KR-neighbor search evaluated according to the original maximum-likelihood metric. Annealed continuation improves robustness for higher-order constellations, while a two-neighbor approximation reduces the cost of evaluating the mixture prior. We further develop a soft-output SMAP method in which a local Gaussian approximation based on the curvature of the smoothed posterior provides symbol probabilities and bit log-likelihood ratios without posterior sampling or explicit counterhypothesis lists. Numerical results for critically loaded MU-MIMO systems show that SMAP-KR provides an increasingly favorable performance-complexity tradeoff as the system dimension grows and can also effectively refine the output of existing detectors. For coded transmission, soft SMAP provides substantial block-error-rate gains over both LMMSE- and K-best-based soft detection.

Related

  1. Nonparametric Change-Point Detection and Inference for High-Dimensional Distributions
    Ping Zhao, Long Feng
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Sparse-group Convoluted Smoothed Quantile Regression in High Dimension
    Jing Lv, Anxi Wang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Boundary Detection for High-Dimensional Point Clouds
    Abigail Hickok, Valerio Galanti, Osama Al Dalahmah +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. QD-PINN:A Physics-Informed Neural Network Approach to Bayesian Quickest Detection in High-Dimensional Diffusions
    Hang Ye, Yi Liu, Haipeng Xing
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Adaptable High-Dimensional Change Point Detection via Ridge Regularization
    Haoran Li, Haotian Xu
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{ramos2026deterministic,
  title = {{Deterministic Smoothed MAP Detection for High-Dimensional MIMO Systems}},
  author = {Vitor Tucci Ramos and Stephane Senecal and Sheng Yang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.24592},
  eprint = {2609.24592},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.24592},
}
RIS
TY  - UNPB
TI  - Deterministic Smoothed MAP Detection for High-Dimensional MIMO Systems
AU  - Vitor Tucci Ramos
AU  - Stephane Senecal
AU  - Sheng Yang
PY  - 2026
DA  - 2026/09/21
PB  - arXiv
DO  - 10.48550/arxiv.2609.24592
UR  - https://arxiv.org/abs/2609.24592
AB  - We propose a deterministic smoothed maximum a posteriori (SMAP) framework for high-dimensional multiple-input multiple-output (MIMO) detection. The discrete constellation prior is approximated by an i.i.d. Gaussian mixture, yielding a differentiable MAP objective that retains the constellation structure while enabling continuous optimization. Unlike sampling-based approaches, SMAP formulates detection as a deterministic optimization problem and can be initialized by the output of an arbitrary detector, allowing it to operate either as a standalone detector or as a refinement stage. For hard detection, we introduce SMAP-KR, which complements the continuous solution with a local K_R-neighbor search evaluated according to the original maximum-likelihood metric. Annealed continuation improves robustness for higher-order constellations, while a two-neighbor approximation reduces the cost of evaluating the mixture prior. We further develop a soft-output SMAP method in which a local Gaussian approximation based on the curvature of the smoothed posterior provides symbol probabilities and bit log-likelihood ratios without posterior sampling or explicit counterhypothesis lists. Numerical results for critically loaded MU-MIMO systems show that SMAP-KR provides an increasingly favorable performance-complexity tradeoff as the system dimension grows and can also effectively refine the output of existing detectors. For coded transmission, soft SMAP provides substantial block-error-rate gains over both LMMSE- and K-best-based soft detection.
ER  -