Deterministic Sort-Free Candidate Pruning for Scalable MIMO Box Decoding

arXiv:2512.00653v2 Announce Type: replace-cross Abstract: 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 numb...

🔗 Read more: https://arxiv.org/abs/2512.00653

#News #Tech #Policy #Academic