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 , with 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 () and Leech () 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}
}