The Benefit of Thresholding in LP Decoding of LDPC Codes

Details The Benefit of Thresholding in LP Decoding of LDPC Codes The Benefit of Thresholding in LP Decoding of LDPC Codes

2005-08-02

arxiv.org/abs/cs/0508014v1

Computer Science

Information Theory

To appear in Proc. 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005

Scientific paper

Consider data transmission over a binary-input additive white Gaussian noise channel using a binary low-density parity-check code. We ask the following question: Given a decoder that takes log-likelihood ratios as input, does it help to modify the log-likelihood ratios before decoding? If we use an optimal decoder then it is clear that modifying the log-likelihoods cannot possibly help the decoder's performance, and so the answer is "no." However, for a suboptimal decoder like the linear programming decoder, the answer might be "yes": In this paper we prove that for certain interesting classes of low-density parity-check codes and large enough SNRs, it is advantageous to truncate the log-likelihood ratios before passing them to the linear programming decoder.

Affiliated with

Also associated with

No associations

Rating

The Benefit of Thresholding in LP Decoding of LDPC 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 The Benefit of Thresholding in LP Decoding of LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Benefit of Thresholding in LP Decoding of LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-615487