← 研踪 PaperTrailarXiv:2605.05202 · v2
Optimizing Bit-Labeling of Voronoi Constellations
首次提交 2026-05-07 01:58
版本更新 2026-11-10 21:42
雷达观测 2026-11-11 13:08
摘要
We optimize the bit-to-symbol map of the $D_4$ and $E_8$ root lattices in reference to bit error rate, by implementing two searches on a performance metric, Hamming Density. The first search is a traditional gradient descent and the second is an efficient search using twisted theta functions. We hold other sources of lattice gain constant by fixing the lattice constellation, and consider basis changes that permute the integer labelings of the lattice points. After searching the possible basis matrices for $D_4$ and $E_8$, we found up to 0.09 dB of gain in $D_4$ bit error rate curves, and up to 0.36 dB of gain in $E_8$ compared to the standard bases commonly used in literature at a BER of $10^{-4}$, which is on the scale of gain from Gray coding uncoded QAMs.
作者备注：6 Pages, 5 Figures, and submitted to IEEE ICC 2027
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-10 21:42 · 最新观测版本
Optimizing Bit-Labeling of Voronoi Constellations
We optimize the bit-to-symbol map of the $D_4$ and $E_8$ root lattices in reference to bit error rate, by implementing two searches on a performance metric, Hamming Density. The first search is a traditional gradient descent and the second is an efficient search using twisted theta functions. We hold other sources of lattice gain constant by fixing the lattice constellation, and consider basis changes that permute the integer labelings of the lattice points. After searching the possible basis matrices for $D_4$ and $E_8$, we found up to 0.09 dB of gain in $D_4$ bit error rate curves, and up to 0.36 dB of gain in $E_8$ compared to the standard bases commonly used in literature at a BER of $10^{-4}$, which is on the scale of gain from Gray coding uncoded QAMs.
查看此版本解读 →查看此版本原文 ↗