LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel Academic Article

abstract

• 1963-2012 IEEE. This paper deals with Low-Density Construction-A (LDA) lattices, which are obtained via Construction A from non-binary low-density parity-check codes. More precisely, a proof is provided that Voronoi constellations of LDA lattices achieve capacity of the AWGN channel under lattice encoding and decoding for every signal-to-noise ratio greater than 1. This is obtained after showing the same result for more general Construction-A lattice constellations. The theoretical analysis is carried out in a way that allows to describe how the prime number underlying Construction A behaves as a function of the lattice dimension. Moreover, no dithering is required in the transmission scheme, simplifying some previous solutions of the problem. Remarkably, capacity is achievable with LDA lattice codes whose parity-check matrices have constant row and column Hamming weights. Some expansion properties of random bipartite graphs constitute an extremely important tool for dealing with sparse matrices and allow to find a lower bound for the minimum Euclidean distance of LDA lattices in our ensemble.

authors

• Boutros, Joseph

published proceedings

• IEEE TRANSACTIONS ON INFORMATION THEORY

author list (cited authors)

• di Pietro, N., Zemor, G., & Boutros, J. J.

citation count

• 12

complete list of authors

• di Pietro, Nicola||Zemor, Gilles||Boutros, Joseph J

publication date

• March 2018

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Awgn Channel Capacity
• Construction A
• Lattice Decoding
• Lda Lattices
• Voronoi Constellations

Digital Object Identifier (DOI)

• 10.1109/TIT.2017.2778158

start page

• 1561

end page

• 1594

volume

• 64

issue

• 3

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Ftit.2017.2778158