Low Density Lattice Codes

Author

Sommer, Naftali ; Feder, Meir ; Shalvi, Ofir

Author_Institution

Dept. of Electr. Eng., Tel Aviv Univ.

fYear

2006

fDate

9-14 July 2006

Firstpage

88

Lastpage

92

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.5 dB from capacity at block length of n = 100,000 symbols. The paper also discusses convergence results and implementation considerations

Keywords

AWGN channels; channel coding; iterative decoding; linear codes; matrix algebra; transforms; AWGN channel; additive white Gaussian noise channel; codeword; integer message vector; linear transformation; linear-time iterative decoding scheme; low density lattice codes; n-dimensional Euclidean space; AWGN channels; Additive white noise; Algebra; Channel capacity; Convergence; Iterative decoding; Lattices; Linear code; Parity check codes; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2006 IEEE International Symposium on

Conference_Location

Seattle, WA

Print_ISBN

1-4244-0505-X

Electronic_ISBN

1-4244-0504-1

Type

conf

DOI

10.1109/ISIT.2006.261680

Filename

4035927