Tree-structure Expectation Propagation for Decoding LDPC codes over Binary Erasure Channels

Details Tree-structure Expectation Propagation for Decoding LDPC codes over Binary Erasure Channels Tree-structure Expectation Propagation for Decoding LDPC codes over Binary Erasure Channels

2010-06-08

arxiv.org/abs/1006.1535v1

Computer Science

Information Theory

Scientific paper

10.1109/ISIT.2010.5513636

Expectation Propagation is a generalization to Belief Propagation (BP) in two ways. First, it can be used with any exponential family distribution over the cliques in the graph. Second, it can impose additional constraints on the marginal distributions. We use this second property to impose pair-wise marginal distribution constraints in some check nodes of the LDPC Tanner graph. These additional constraints allow decoding the received codeword when the BP decoder gets stuck. In this paper, we first present the new decoding algorithm, whose complexity is identical to the BP decoder, and we then prove that it is able to decode codewords with a larger fraction of erasures, as the block size tends to infinity. The proposed algorithm can be also understood as a simplification of the Maxwell decoder, but without its computational complexity. We also illustrate that the new algorithm outperforms the BP decoder for finite block-size

Affiliated with

Also associated with

No associations

Rating

Tree-structure Expectation Propagation for Decoding LDPC codes over Binary Erasure Channels 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 Tree-structure Expectation Propagation for Decoding LDPC codes over Binary Erasure Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree-structure Expectation Propagation for Decoding LDPC codes over Binary Erasure Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30123