| Session: | 1.1.5 - LDPC Codes: Algebraic Constructions |
| Session Time: | Monday, July 10, 09:40 - 11:00 |
| Paper Time: | Monday, July 10, 10:20 - 10:40 |
| Title: |
Low Density Lattice Codes |
| Authors: |
Naftali Sommer; Texas Instruments / Tel-Aviv University | | |
| | Meir Feder; Tel-Aviv University | | |
| | Ofir Shalvi; Tel-Aviv University | | |
| 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, the inverse of G, 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. |
