.png){kind=icon}
.png){kind=icon}
Return
Box Decoding With Probabilistic Tree Pruning for Scalable Sort-Free MIMO Detection
.png){kind=icon}
PRE
AI
DOI：10.1109/LWC.2026.3658890.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Box Decoding is a promising sort-free tree-search MIMO detection algorithm whose complexity is independent of the QAM order, achieved by selecting a fixed set (“box”) of candidates around a reference point at each tree layer. However, its detection complexity scales rapidly with the MIMO order due to the lack of pruning mechanisms. This letter proposes probabilistic tree pruning (PTP) strategy for Box Decoding, termed Box-PTP, which employs a statistically derived threshold to discard unlikely candidates during tree traversal. The pruning threshold combines the minimum distance metric at each layer with a noise-dependent statistical offset. We further derive analytical expressions for the expected number of visited nodes and propose a low-complexity method for computing the minimum distance metric. Simulation results show that Box-PTP offers substantial complexity reduction with negligible performance loss and remains sort-free, making Box Decoding scalable for large MIMO systems.
Keywords:
MIMO detection
low-complexity
box decoding
K-best algorithm
sort-free
large-scale MIMO
Journal
I
IF:
5.5
Papers:
665
Citations:
0