Metraipolis › archive › dc_54e1263a05cd

Box-Shift: Fixed-Complexity Counter-Hypothesis Generation for Soft-Output MIMO Box Decoding — arXiv:2611.06566

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06566
License (as archived)
CC0-1.0
Archived
2026-11-05T18:40:07.976Z
SHA-256 of the archived text
1d429770aa766bff813429e1393f0e8c52bb5c88429e0ec6bf773ae50534a7cf
Stable URL of this page
https://metraipolis.com/documento/dc_54e1263a05cd

How to cite

Box-Shift: Fixed-Complexity Counter-Hypothesis Generation for Soft-Output MIMO Box Decoding — arXiv:2611.06566 — arXiv (en), https://arxiv.org/abs/2611.06566 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_54e1263a05cd (Metraipolis archive dc_54e1263a05cd, sha256 1d429770aa766bff813429e1393f0e8c52bb5c88429e0ec6bf773ae50534a7cf)
BibTeX
@misc{dc54e1263a05cd,
  title = {Box-Shift: Fixed-Complexity Counter-Hypothesis Generation for Soft-Output MIMO Box Decoding — arXiv:2611.06566},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06566},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_54e1263a05cd; sha256 1d429770aa766bff813429e1393f0e8c52bb5c88429e0ec6bf773ae50534a7cf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06566. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Box Decoding is a sort-free tree-search multiple-input multiple-output (MIMO) detector with a fixed per-layer cost independent of the quadrature amplitude modulation (QAM) order. Its regular datapath is well suited to hardware implementation, but the detector has so far been limited to hard-output operation in uncoded systems. Its fixed four-point box spans two adjacent Gray-coded QAM levels per axis, leaving most bits without counter-hypotheses for higher-order QAM. This missing counter-hypothesis (MCH) problem prevents the direct computation of finite max-log log-likelihood ratios (LLRs). We propose the \emph{Box-Shift} algorithm, which shifts the existing box to the nearest node carrying the complementary value of each Gray-coded bit at each detection layer. Unlike Bit-Flip, Box-Shift analytically identifies the partially optimal counter-hypothesis using one inverter per bit and updates the path metric through an index-domain increment. The proposed method preserves the sort-free, QAM-order-independent structure of Box Decoding. Coded $4\times4$ MIMO simulations using 5G~NR low-density parity-check (LDPC) coding show that Box Decoding with Box-Shift achieves a $0.7$--$1.5$\,dB gain in $E_b/N_0$ over the same detector with Bit-Flip at a bit error rate of $10^{-5}$, with equal soft-candidate budgets. For the soft-candidate metrics, the incremental update of Box-Shift needs $75\%$ fewer real multiplications than the explicit evaluation of Bit-Flip at a comparable number of real additions.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv eess.SP, nuovi lavori del giorno).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2611.06566 — 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-11-05T18:32:01.585Z dalla pagina https://arxiv.org/list/eess.SP/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).