Emergent Mind

Voronoi Shaping with Efficient Encoding

(2004.09680)
Published Apr 20, 2020 in eess.SP , cs.IT , and 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 $\Lambdas \subseteq \textbf{K}\mathbb{Z}n \subseteq \Lambdac$, 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 ($E8$) and Leech ($\Lambda{24}$) lattices as shaping lattices.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.