pith. sign in

arxiv: 1611.04417 · v3 · pith:MT75RFPPnew · submitted 2016-11-14 · 💻 cs.IT · math.IT

Leech Constellations of Construction-A Lattices

classification 💻 cs.IT math.IT
keywords latticecodesconstellationsconstruction-avoronoicapacityencodinglattices
0
0 comments X
read the original abstract

The problem of communicating over the additive white Gaussian noise (AWGN) channel with lattice codes is addressed in this paper. Theoretically, Voronoi constellations have proved to yield very powerful lattice codes when the fine/coding lattice is AWGN-good and the coarse/shaping lattice has an optimal shaping gain. However, achieving Shannon capacity with these premises and practically implementable encoding algorithms is in general not an easy task. In this work, a new way to encode and demap Construction-A Voronoi lattice codes is presented. As a meaningful application of this scheme, the second part of the paper is focused on Leech constellations of low-density Construction-A (LDA) lattices: LDA Voronoi lattice codes are presented whose numerically measured waterfall region is situated at less than 0.8 dB from Shannon capacity. These LDA lattice codes are based on dual-diagonal nonbinary low-density parity-check codes. With this choice, encoding, iterative decoding, and demapping have all linear complexity in the blocklength.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.