Integer low-density lattices based on construction A

Nicola Di Pietro, Joseph Boutros, Gilles Zemor, Loic Brunel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

35 Citations (Scopus)

Abstract

We describe a new family of integer lattices built from construction A and non-binary LDPC codes. An iterative message-passing algorithm suitable for decoding in high dimensions is proposed. This family of lattices, referred to as LDA lattices, follows the recent transition of Euclidean codes from their classical theory to their modern approach as announced by the pioneering work of Loeliger (1997), Erez, Litsyn, and Zamir (2004-2005). Besides their excellent performance near the capacity limit, LDA lattice construction is conceptually simpler than previously proposed lattices based on multiple nested binary codes and LDA decoding is less complex than real-valued message passing.

Original languageEnglish
Title of host publication2012 IEEE Information Theory Workshop, ITW 2012
Pages422-426
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2012
Event2012 IEEE Information Theory Workshop, ITW 2012 - Lausanne, Switzerland
Duration: 3 Sep 20127 Sep 2012

Other

Other2012 IEEE Information Theory Workshop, ITW 2012
CountrySwitzerland
CityLausanne
Period3/9/127/9/12

Fingerprint

Message passing
Decoding
Binary codes

ASJC Scopus subject areas

  • Information Systems

Cite this

Di Pietro, N., Boutros, J., Zemor, G., & Brunel, L. (2012). Integer low-density lattices based on construction A. In 2012 IEEE Information Theory Workshop, ITW 2012 (pp. 422-426). [6404707] https://doi.org/10.1109/ITW.2012.6404707

Integer low-density lattices based on construction A. / Di Pietro, Nicola; Boutros, Joseph; Zemor, Gilles; Brunel, Loic.

2012 IEEE Information Theory Workshop, ITW 2012. 2012. p. 422-426 6404707.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Di Pietro, N, Boutros, J, Zemor, G & Brunel, L 2012, Integer low-density lattices based on construction A. in 2012 IEEE Information Theory Workshop, ITW 2012., 6404707, pp. 422-426, 2012 IEEE Information Theory Workshop, ITW 2012, Lausanne, Switzerland, 3/9/12. https://doi.org/10.1109/ITW.2012.6404707
Di Pietro N, Boutros J, Zemor G, Brunel L. Integer low-density lattices based on construction A. In 2012 IEEE Information Theory Workshop, ITW 2012. 2012. p. 422-426. 6404707 https://doi.org/10.1109/ITW.2012.6404707
Di Pietro, Nicola ; Boutros, Joseph ; Zemor, Gilles ; Brunel, Loic. / Integer low-density lattices based on construction A. 2012 IEEE Information Theory Workshop, ITW 2012. 2012. pp. 422-426
@inproceedings{5c6c9b027d6d434a8f4d304b917f2b18,
title = "Integer low-density lattices based on construction A",
abstract = "We describe a new family of integer lattices built from construction A and non-binary LDPC codes. An iterative message-passing algorithm suitable for decoding in high dimensions is proposed. This family of lattices, referred to as LDA lattices, follows the recent transition of Euclidean codes from their classical theory to their modern approach as announced by the pioneering work of Loeliger (1997), Erez, Litsyn, and Zamir (2004-2005). Besides their excellent performance near the capacity limit, LDA lattice construction is conceptually simpler than previously proposed lattices based on multiple nested binary codes and LDA decoding is less complex than real-valued message passing.",
author = "{Di Pietro}, Nicola and Joseph Boutros and Gilles Zemor and Loic Brunel",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/ITW.2012.6404707",
language = "English",
isbn = "9781467302234",
pages = "422--426",
booktitle = "2012 IEEE Information Theory Workshop, ITW 2012",

}

TY - GEN

T1 - Integer low-density lattices based on construction A

AU - Di Pietro, Nicola

AU - Boutros, Joseph

AU - Zemor, Gilles

AU - Brunel, Loic

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We describe a new family of integer lattices built from construction A and non-binary LDPC codes. An iterative message-passing algorithm suitable for decoding in high dimensions is proposed. This family of lattices, referred to as LDA lattices, follows the recent transition of Euclidean codes from their classical theory to their modern approach as announced by the pioneering work of Loeliger (1997), Erez, Litsyn, and Zamir (2004-2005). Besides their excellent performance near the capacity limit, LDA lattice construction is conceptually simpler than previously proposed lattices based on multiple nested binary codes and LDA decoding is less complex than real-valued message passing.

AB - We describe a new family of integer lattices built from construction A and non-binary LDPC codes. An iterative message-passing algorithm suitable for decoding in high dimensions is proposed. This family of lattices, referred to as LDA lattices, follows the recent transition of Euclidean codes from their classical theory to their modern approach as announced by the pioneering work of Loeliger (1997), Erez, Litsyn, and Zamir (2004-2005). Besides their excellent performance near the capacity limit, LDA lattice construction is conceptually simpler than previously proposed lattices based on multiple nested binary codes and LDA decoding is less complex than real-valued message passing.

UR - http://www.scopus.com/inward/record.url?scp=84873135811&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873135811&partnerID=8YFLogxK

U2 - 10.1109/ITW.2012.6404707

DO - 10.1109/ITW.2012.6404707

M3 - Conference contribution

SN - 9781467302234

SP - 422

EP - 426

BT - 2012 IEEE Information Theory Workshop, ITW 2012

ER -