Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes

Details Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes

2008-07-19

arxiv.org/abs/0807.3065v1

Computer Science

Information Theory

40 Pages, Submitted to IEEE Transactions on Information Theory

Scientific paper

Consider communication over a binary-input memoryless output-symmetric channel with low density parity check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic formula for the average input-output conditional entropy per bit in the infinite block length limit. Montanari proved a lower bound for this entropy, in the case of LDPC ensembles with convex check degree polynomial, which matches the replica formula. Here we extend this lower bound to any irregular LDPC ensemble. The new feature of our work is an analysis of the second derivative of the conditional input-output entropy with respect to noise. A close relation arises between this second derivative and correlation or mutual information of codebits. This allows us to extend the realm of the interpolation method, in particular we show how channel symmetry allows to control the fluctuations of the overlap parameters.

Affiliated with

Also associated with

No associations

Rating

Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes 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 Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-390495