Low Density Lattice Codes
| dc.creator | Sommer, Naftali | |
| dc.creator | Feder, Meir | |
| dc.creator | Shalvi, Ofir | |
| dc.date | 2007-04-11 | |
| dc.date.accessioned | 2026-07-07T08:15:56Z | |
| dc.date.available | 2026-07-07T08:15:56Z | |
| dc.description | 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 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. | |
| dc.description | 24 pages, 4 figures. Submitted for publication in IEEE transactions on Information Theory | |
| dc.identifier | https://arxiv.org/abs/0704.1317 | |
| dc.identifier | http://arxiv.org/abs/0704.1317 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133609 | |
| dc.subject | Information Theory | |
| dc.title | Low Density Lattice Codes | |
| dc.type | text |