Papers
Topics
Authors
Recent
Search
2000 character limit reached

Voronoi Shaping with Efficient Encoding

Published 20 Apr 2020 in eess.SP, cs.IT, and math.IT | (2004.09680v2)

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 $\Lambda_s \subseteq \textbf{K}\mathbb{Z}n \subseteq \Lambda_c$, with $\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 ($E_8$) and Leech ($\Lambda_{24}$) lattices as shaping lattices.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.