格上陪集码的高效解调

中文摘要 AI 辅助

格星座相较于传统正交幅度调制（QAM）能提供显著的编码和整形增益，但由于调制、解调和解码的高实现复杂度而未被广泛采用。Voronoi星座（VC）利用格的Voronoi单元实现高效的调制映射，从而获得整形增益。多级陪集码（MLCC）是最近提出的一种针对VC的编码调制方案，可实现更高效的解码。然而，MLCC仍面临软解调复杂度为$O(d2^{sd})$的问题，其中$d$为格维度，$s$为每实维度的频谱效率（比特/维度）。本文提出快速量化-游走解调（FQWD），一种针对MLCC的高效解调方案，将复杂度降至$O(sd2^d)$。该策略利用对$D_4$和$E_8$格的Voronoi单元的新型径向投影。实验结果表明，在加性高斯白噪声（AWGN）信道下，FQWD相对于最大似然解调的块错误率（BLER）损失可忽略不计。利用FQWD，我们首次在$s>2$比特/维度的更高维格上模拟了MLCC，在AWGN下，相较于QAM上的多级极化码，$D_4$格实现了高达0.6 dB的BLER增益，$E_8$格实现了1.2 dB的增益。

英文摘要

Lattice constellations can provide significant coding and shaping gains over traditional quadrature amplitude modulations (QAMs), but have not been widely adopted due to the high implementation complexity of modulation, demodulation, and decoding. Voronoi constellations (VCs) enable an efficient modulation map that achieves shaping gain using the Voronoi cell of a lattice. Multilevel coset codes (MLCCs) are a recently proposed coded modulation scheme for VCs that realizes more efficient decoding. However, MLCCs still suffer from a soft demodulation complexity of $O(d2^{sd})$ for a $d$-dimensional lattice with spectral efficiency $s$ bits per real dimension. In this paper, we propose fast quantize-walk demodulation (FQWD), an efficient demodulation scheme for MLCCs that reduces the complexity to $O(sd2^d)$. Our strategy utilizes novel radial projections onto the Voronoi cells of the $D_4$ and $E_8$ lattices. Experimental results demonstrate that FQWD has only negligible loss in block error rate (BLER) relative to maximum likelihood demodulation under the additive white Gaussian noise (AWGN) channel. Using FQWD, we simulate MLCCs on higher-dimensional lattices with $s>2$ bits per dimension under AGWN for the first time, achieving BLER gains over multilevel polar codes on QAMs of up to 0.6 dB for the $D_4$ lattice and 1.2 dB for $E_8$.

发表机构

• Rampart Communications

机构由 AI 辅助整理，请以论文原文为准。