Low density lattice codes

Naftali Sommer*, Meir Feder, Ofir Shalvi

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Low density lattice codes (LDLC) are novel lattice codes that can approach the capacity of the additive white Gaussian noise (AWGN) channel and be decoded efficiently. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G-1 is restricted to be sparse. The fact that H is sparse is utilized to develop a linear-time iterative decoding scheme which attains, as demonstrated by simulations, good error performance within ∼ 0.5dB from capacity at block length of n = 100,000 symbols. The paper also discusses convergence results and implementation considerations.

Original languageEnglish
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages88-92
Number of pages5
DOIs
StatePublished - 2006
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: 9 Jul 200614 Jul 2006

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/TerritoryUnited States
CitySeattle, WA
Period9/07/0614/07/06

Fingerprint

Dive into the research topics of 'Low density lattice codes'. Together they form a unique fingerprint.

Cite this