Computer Science – Information Theory
Scientific paper
2009-01-21
Computer Science
Information Theory
Submitted for publication
Scientific paper
10.1109/ALLERTON.2009.5394798
The recent work of Sommer, Feder and Shalvi presented a new family of codes called low density lattice codes (LDLC) that can be decoded efficiently and approach the capacity of the AWGN channel. A linear time iterative decoding scheme which is based on a message-passing formulation on a factor graph is given. In the current work we report our theoretical findings regarding the relation between the LDLC decoder and belief propagation. We show that the LDLC decoder is an instance of non-parametric belief propagation and further connect it to the Gaussian belief propagation algorithm. Our new results enable borrowing knowledge from the non-parametric and Gaussian belief propagation domains into the LDLC domain. Specifically, we give more general convergence conditions for convergence of the LDLC decoder (under the same assumptions of the original LDLC convergence analysis). We discuss how to extend the LDLC decoder from Latin square to full rank, non-square matrices. We propose an efficient construction of sparse generator matrix and its matching decoder. We report preliminary experimental results which show our decoder has comparable symbol to error rate compared to the original LDLC decoder.%
Bickson Danny
Dolev Danny
Ihler Alexander T.
No associations
LandOfFree
A Low Density Lattice Decoder via Non-Parametric Belief Propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Low Density Lattice Decoder via Non-Parametric Belief Propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Low Density Lattice Decoder via Non-Parametric Belief Propagation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-684153