Deterministic Sort-Free Candidate Pruning for Scalable MIMO Box Decoding
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915794581979136 |
|---|---|
| author | Yang, Shengchun Bora, Amit Sravan Matus, Emil Fettweis, Gerhard |
| author_facet | Yang, Shengchun Bora, Amit Sravan Matus, Emil Fettweis, Gerhard |
| contents | Box Decoding is a sort-free tree-search MIMO detector whose complexity is independent of the QAM order, achieved by searching a fixed candidate box around a zero-forcing (ZF) estimate. However, without pruning, the number of visited nodes grows exponentially with the MIMO dimension, limiting scalability. This work proposes two deterministic, low-complexity, sort-free pruning strategies to control node growth. By exploiting the geometric symmetry of the QAM grid and the relative displacement between the ZF estimate and nearby constellation points, the proposed methods eliminate unnecessary metric evaluations while preserving QAM-order independence. The resulting detector achieves substantial complexity reduction with negligible error-rate degradation and enables fully parallel, hardware-efficient implementations for large-scale MIMO and higher-order QAM systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_00653 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Deterministic Sort-Free Candidate Pruning for Scalable MIMO Box Decoding Yang, Shengchun Bora, Amit Sravan Matus, Emil Fettweis, Gerhard Signal Processing Information Theory Box Decoding is a sort-free tree-search MIMO detector whose complexity is independent of the QAM order, achieved by searching a fixed candidate box around a zero-forcing (ZF) estimate. However, without pruning, the number of visited nodes grows exponentially with the MIMO dimension, limiting scalability. This work proposes two deterministic, low-complexity, sort-free pruning strategies to control node growth. By exploiting the geometric symmetry of the QAM grid and the relative displacement between the ZF estimate and nearby constellation points, the proposed methods eliminate unnecessary metric evaluations while preserving QAM-order independence. The resulting detector achieves substantial complexity reduction with negligible error-rate degradation and enables fully parallel, hardware-efficient implementations for large-scale MIMO and higher-order QAM systems. |
| title | Deterministic Sort-Free Candidate Pruning for Scalable MIMO Box Decoding |
| topic | Signal Processing Information Theory |
| url | https://arxiv.org/abs/2512.00653 |