论文标题
宏伟的最佳调制
GRAND-assisted Optimal Modulation
论文作者
论文摘要
已知具有峰值和平均功率限制的高斯通道的最佳调制（OM）方案需要在信号点上不均匀的概率分布，这带来了实际的挑战。将均匀二进制源映射到非均匀符号分布的一种既定方法是将不同数量的位分配给不同的星座点。但是，这样做意味着接收器处的错误解调会导致位插入或删除，从而导致二进制误差传播。在本文中，我们引入了一种轻量级的变体，该变体使用简单的填充方案猜测随机的添加噪声解码（GARN），以在接收器上解决插入和删除错误。绩效评估表明，与128个二次振幅调制（QAM）相比，我们的方法会导致超过2 dB EB/N0的比位误差总体增益（QAM）。宏伟的OM方案的表现优于与我们简单填充相同的平均速率的低密度均衡检查代码编码。
Optimal modulation (OM) schemes for Gaussian channels with peak and average power constraints are known to require nonuniform probability distributions over signal points, which presents practical challenges. An established way to map uniform binary sources to non-uniform symbol distributions is to assign a different number of bits to different constellation points. Doing so, however, means that erroneous demodulation at the receiver can lead to bit insertions or deletions that result in significant binary error propagation. In this paper, we introduce a light-weight variant of Guessing Random Additive Noise Decoding (GRAND) to resolve insertion and deletion errors at the receiver by using a simple padding scheme. Performance evaluation demonstrates that our approach results in an overall gain in demodulated bit-error-rate of over 2 dB Eb/N0 when compared to 128-Quadrature Amplitude Modulation (QAM). The GRAND-aided OM scheme outperforms coding with a low-density parity check code of the same average rate as that induced by our simple padding.
