Saved in:
Bibliographic Details
Main Authors: Rumrill, Carilyn, Muzzey, David, Davis, Connor, Mackes, Stephen, Chew, Dan
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.05202
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913095663747072
author Rumrill, Carilyn
Muzzey, David
Davis, Connor
Mackes, Stephen
Chew, Dan
author_facet Rumrill, Carilyn
Muzzey, David
Davis, Connor
Mackes, Stephen
Chew, Dan
contents We define a novel search method and performance metric as a technique for optimizing the bit-to-symbol map of the $D_4$ and $E_8$ 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 $D_4$ and $E_8$, we found 0.1 dB of gain in $D_4$ bit error rate curves, and 0.5 dB of gain in $E_8$ compared to the standard bases commonly used in literature at a BER of $10^{-4}$.
format Preprint
id arxiv_https___arxiv_org_abs_2605_05202
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Optimizing Bit-Labeling of Voronoi Constellations
Rumrill, Carilyn
Muzzey, David
Davis, Connor
Mackes, Stephen
Chew, Dan
Information Theory
We define a novel search method and performance metric as a technique for optimizing the bit-to-symbol map of the $D_4$ and $E_8$ 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 $D_4$ and $E_8$, we found 0.1 dB of gain in $D_4$ bit error rate curves, and 0.5 dB of gain in $E_8$ compared to the standard bases commonly used in literature at a BER of $10^{-4}$.
title Optimizing Bit-Labeling of Voronoi Constellations
topic Information Theory
url https://arxiv.org/abs/2605.05202