Low Density Lattice Codes
Authors:
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 88-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 considerationsKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Signal codes2008
- Low Density Lattice Codes2006
- Achieving$ 1over 2log (1+ hboxSNR)$on the AWGN Channel With Lattice Encoding and DecodingIEEE Transactions on Information Theory, 2004
- Lattice codes can achieve capacity on the AWGN channelIEEE Transactions on Information Theory, 1998
- On coding without restrictions for the AWGN channelIEEE Transactions on Information Theory, 1994
- Coset codes. I. Introduction and geometrical classificationIEEE Transactions on Information Theory, 1988
- Sphere Packings, Lattices and Groups1988
- New trellis codes based on lattices and cosetsIEEE Transactions on Information Theory, 1987
- The Noisy Channel Coding Theorem for Erasure ChannelsThe American Mathematical Monthly, 1974
- Probability of Error for Optimal Codes in a Gaussian ChannelBell System Technical Journal, 1959