论文标题
Orbgrand几乎是能力实现的
ORBGRAND Is Almost Capacity-Achieving
论文作者
论文摘要
通过依次猜测接收到的嘈杂序列中的误差模式的解码最近已受到关注，并且已经提出了Orbgrand作为一种能够利用接收到的噪声序列中的软信息的解码算法。对Orbgrand进行了信息理论研究，并显示出使用独立且相同分布的随机代码簿的Orbgrand的可实现速率几乎与通道容量重合，而在抗虫输入下，添加剂的白色高斯噪声通道。对于有限长度的代码，提出了由信息理论研究激励的改进的猜测方案，该方案的误差率较低，尤其是在高信噪比的比率方面。
Decoding via sequentially guessing the error pattern in a received noisy sequence has received attention recently, and ORBGRAND has been proposed as one such decoding algorithm that is capable of utilizing the soft information embedded in the received noisy sequence. An information theoretic study is conducted for ORBGRAND, and it is shown that the achievable rate of ORBGRAND using independent and identically distributed random codebooks almost coincides with the channel capacity, for an additive white Gaussian noise channel under antipodal input. For finite-length codes, improved guessing schemes motivated by the information theoretic study are proposed that attain lower error rates than ORBGRAND, especially in the high signal-to-noise ratio regime.
