Voronoi Shaping with Efficient Encoding
H. Buglia, R. R. Lopes

TL;DR
This paper introduces a Voronoi shaping method that simplifies encoding for certain lattices, making the process more efficient by reducing complexity to linear code encoding, especially for lattices derived from error-correcting codes.
Contribution
It presents a novel Voronoi shaping technique with reduced encoding complexity applicable to specific lattice structures, including construction-D lattices with well-known shapes.
Findings
Encoding complexity is reduced to linear code encoding.
Explicit coset representatives are obtained for the lattices.
Method is demonstrated with E8 and Leech lattices.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · DNA and Biological Computing · graph theory and CDMA systems
