English

Voronoi Shaping with Efficient Encoding

Signal Processing 2020-08-05 v2 Information Theory math.IT

Abstract

In this letter, we propose a Voronoi shaping method with reduced encoding complexity. The method works for integer shaping and coding lattices satisfying the chain ΛsKZnΛc\Lambda_s \subseteq \textbf{K}\mathbb{Z}^n \subseteq \Lambda_c, with K\textbf{K} an integer diagonal matrix. This assumption is easily satisfied for lattices obtained from error-correcting codes. For those lattices, using this strategy, an explicit set of coset representatives is obtained and lattice encoding complexity is reduced to the linear code encoding complexity. Our proposal is illustrated in construction-D lattices with Gosset (E8E_8) and Leech (Λ24\Lambda_{24}) lattices as shaping lattices.

Cite

@article{arxiv.2004.09680,
  title  = {Voronoi Shaping with Efficient Encoding},
  author = {H. Buglia and R. R. Lopes},
  journal= {arXiv preprint arXiv:2004.09680},
  year   = {2020}
}
R2 v1 2026-06-23T14:59:02.124Z