arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.11901cs.ITmath.IT
收藏

ORBGRAND:通用比特信道的可达速率及其在BICM中的应用

ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM

Zhuang Li, Wenyi Zhang

AI总结:

本文将ORBGRAND的可达速率分析扩展至通用无记忆二进制输入比特信道,并应用于BICM,数值结果表明其可达速率与信道互信息差距小,适用于高阶编码调制。

摘要:

猜测随机加性噪声解码(GRAND)近期受到了广泛关注,在其变体中,有序可靠性比特GRAND(ORBGRAND)因高效利用软信息且易于硬件实现而尤为引人瞩目。近期研究表明,在二进制对极输入的加性高斯白噪声信道下,ORBGRAND几乎可达信道容量。在本研究中,我们首先将ORBGRAND可达速率的分析扩展至具有通用输出条件概率分布的无记忆二进制输入比特信道。该分析结果也为理解ORBGRAND可达速率与信道互信息之间的差距提供了深刻见解。作为该分析的应用,我们研究了比特交织编码调制(BICM)的ORBGRAND可达速率。数值结果表明,对于BICM,ORBGRAND可达速率与信道互信息之间的差距通常较小,从而表明了ORBGRAND应用于高阶编码调制方案信道的可行性。

英文摘要:

Guessing random additive noise decoding (GRAND) has received widespread attention recently, and among its variants, ordered reliability bits GRAND (ORBGRAND) is particularly attractive due to its efficient utilization of soft information and its amenability to hardware implementation. It has been recently shown that ORBGRAND is almost capacity-achieving in additive white Gaussian noise channels under antipodal input. In this work, we first extend the analysis of ORBGRAND achievable rate to memoryless binary-input bit channels with general output conditional probability distributions. The analytical result also sheds insight into understanding the gap between the ORBGRAND achievable rate and the channel mutual information. As an application of the analysis, we study the ORBGRAND achievable rate of bit-interleaved coded modulation (BICM). Numerical results indicate that for BICM, the gap between the ORBGRAND achievable rate and the channel mutual information is typically small, and hence suggest the feasibility of ORBGRAND for channels with high-order coded modulation schemes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑