.png){kind=icon}
.png){kind=icon}
Return
ORBGRAND Is Exactly Capacity-Achieving via Rank Companding
.png){kind=icon}
PRE
AI
W
DOI：10.1109/tcomm.2026.3714294.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Within the family of guessing-based decoding algorithms, ordered reliability bits GRAND (ORBGRAND) has attracted considerable attention due to its efficient use of soft information and suitability for hardware implementation. It has also been shown that ORBGRAND achieves a rate very close to the capacity of an additive white Gaussian noise channel under antipodal signaling. In this work, it is further established that, for general binary-input memoryless channels under symmetric input distribution, via suitably companding the ranks in ORBGRAND according to the inverse cumulative distribution function (CDF) of channel reliability, the resulting CDF-ORBGRAND algorithm exactly achieves the mutual information, i.e., the symmetric capacity. This result is then applied to bit-interleaved coded modulation (BICM) systems to handle high-order input constellations. Via considering the effects of mismatched decoding due to both BICM and ORBGRAND, it is shown that CDF-ORBGRAND is capable of achieving the BICM capacity, which was initially derived in the literature by treating BICM as a set of independent parallel channels.
Keywords:
Achievable rate
bit-interleaved coded modulation
capacity-achieving
generalized mutual information
guessing random additive noise decoding
ordered reliability bits
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers