English
Related papers

Related papers: Leech Constellations of Construction-A Lattices

200 papers

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…

Information Theory · Computer Science 2016-03-10 Nicola di Pietro , Gilles Zémor , Joseph J. Boutros

We study some structural properties of Construction-A lattices obtained from low density parity check (LDPC) codes over prime fields. Such lattices are called low density Construction-A (LDA) lattices, and permit low-complexity belief…

Information Theory · Computer Science 2017-05-12 Shashank Vatedka , Navin Kashyap

Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional…

Information Theory · Computer Science 2007-07-13 Naftali Sommer , Meir Feder , Ofir Shalvi

In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity $\frac{1}{2}\log(1+\SNR)$ of the additive white Gaussian-noise (AWGN) channel. Our construction follows the…

Information Theory · Computer Science 2018-10-16 Ling Liu , Yanfei Yan , Cong Ling , Xiaofu Wu

We propose two low-complexity lattice code constructions that have competitive coding and shaping gains. The first construction, named systematic Voronoi shaping, maps short blocks of integers to the dithered Voronoi integers, which are…

Information Theory · Computer Science 2016-08-04 Nuwan S. Ferdinand , Brian M. Kurkoski , Matthew Nokleby , Behnaam Aazhang

A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of this short note is to point out that by concatenating a…

Information Theory · Computer Science 2016-08-24 Shashank Vatedka , Navin Kashyap

Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but are also a key ingredient to many multiterminal schemes that exploit linearity properties. However, constructing lattice codes…

Information Theory · Computer Science 2019-05-07 Paulo Ricardo Branco da Silva , Danilo Silva

Most multi-dimensional (more than two dimensions) lattice partitions only form additive quotient groups and lack multiplication operations. This prevents us from constructing lattice codes based on multi-dimensional lattice partitions…

Information Theory · Computer Science 2017-10-05 Min Qiu , Lei Yang , Yixuan Xie , Jinhong Yuan

In this paper, we propose the explicit construction of a new class of lattices based on polar codes, which are provably good for the additive white Gaussian noise (AWGN) channel. We follow the multilevel construction of Forney \textit{et…

Information Theory · Computer Science 2013-07-05 Yanfei Yan , Cong Ling , Xiaofu Wu

Designs and methods for nested lattice codes using Construction D' lattices for coding and convolutional code lattices for shaping are described. Two encoding methods and a decoding algorithm for Construction D' coding lattices that can be…

Information Theory · Computer Science 2022-01-03 Fan Zhou , Brian M. Kurkoski

In this paper, we propose a new approach to proving results regarding channel coding schemes based on construction-A lattices for the Additive White Gaussian Noise (AWGN) channel that yields new characterizations of the code construction…

Information Theory · Computer Science 2016-11-18 Wael Alghamdi , Walid Abediseid , Mohamed-Slim Alouini

This paper focuses on the encoding and decoding of Construction D' coding lattices that can be used with shaping lattices for power-constrained channels. Two encoding methods and a decoding algorithm for Construction D' lattices are given.…

Information Theory · Computer Science 2021-09-14 Fan Zhou , Arini Fitri , Khoirul Anwar , Brian M. Kurkoski

Voronoi constellations (VCs) are finite sets of vectors of a coding lattice enclosed by the translated Voronoi region of a shaping lattice, which is a sublattice of the coding lattice. In conventional VCs, the shaping lattice is a scaled-up…

Information Theory · Computer Science 2024-01-25 S. Li , A. Mirani , M. Karlsson , E. Agrell

In the decades following Shannon's work, the quest to design codes for the additive white Gaussian noise (AWGN) channel led to the development of a rich theory, revealing a number of beautiful connections between information theory and…

Information Theory · Computer Science 2017-12-21 Laura Luzzi , Roope Vehkalahti

Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian…

Information Theory · Computer Science 2017-12-19 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

A novel construction of lattices is proposed. This construction can be thought of as a special class of Construction A from codes over finite rings that can be represented as the Cartesian product of $L$ linear codes over…

Information Theory · Computer Science 2017-06-23 Yu-Chih Huang , Krishna R. Narayanan

Lattice coding and decoding have been shown to achieve the capacity of the additive white Gaussian noise (AWGN) channel. This was accomplished using a minimum mean-square error scaling and randomization to transform the AWGN channel into a…

Information Theory · Computer Science 2013-08-08 Charles H. Swannack , Uri Erez , Gregory W. Wornell

We propose a new coding scheme using only one lattice that achieves the $\frac{1}{2}\log(1+\SNR)$ capacity of the additive white Gaussian noise (AWGN) channel with lattice decoding, when the signal-to-noise ratio $\SNR>e-1$. The scheme…

Information Theory · Computer Science 2018-06-28 Cong Ling , Jean-Claude Belfiore

Approaching Shannon's capacity via geometric shaping has usually been regarded as challenging due to modulation and demodulation complexity, requiring look-up tables to store the constellation points and constellation bit labeling. To…

Signal Processing · Electrical Eng. & Systems 2024-01-25 Ali Mirani , Erik Agrell , Magnus Karlsson

Low density lattice codes (LDLC) are a family of lattice codes that can be decoded efficiently using a message-passing algorithm. In the original LDLC decoder, the message exchanged between variable nodes and check nodes are continuous…

Information Theory · Computer Science 2018-06-15 Shuiyin Liu , Yi Hong , Emanuele Viterbo , Alessia Marelli , Rino Micheloni
‹ Prev 1 2 3 10 Next ›