Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Leech Constellations of Construction-A Lattices (1611.04417v3)

Published 14 Nov 2016 in cs.IT and math.IT

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.

Citations (16)

Summary

We haven't generated a summary for this paper yet.