Optimizing Bit-Labeling of Voronoi Constellations
Information Theory
2026-05-07 v1 math.IT
Abstract
We define a novel search method and performance metric as a technique for optimizing the bit-to-symbol map of the and root lattices in reference to bit error rate. We hold other sources of lattice gain constant by fixing the lattice constellation, and consider basis matrices that permute the integer labelings of the lattice points. After searching the possible basis matrices for and , we found 0.1 dB of gain in bit error rate curves, and 0.5 dB of gain in compared to the standard bases commonly used in literature at a BER of .
Cite
@article{arxiv.2605.05202,
title = {Optimizing Bit-Labeling of Voronoi Constellations},
author = {Carilyn Rumrill and David Muzzey and Connor Davis and Stephen Mackes and Dan Chew},
journal= {arXiv preprint arXiv:2605.05202},
year = {2026}
}
Comments
6 Pages, 7 Figures, and submitted to IEEE ITW2026