Improved Linear Programming Decoding using Frustrated Cycles

Details Improved Linear Programming Decoding using Frustrated Cycles Improved Linear Programming Decoding using Frustrated Cycles

2011-05-24

arxiv.org/abs/1105.4665v1

Computer Science

Information Theory

5 Pages, Submitted to Information Theory Workshop (ITW) 2011

Scientific paper

We consider transmission over a binary-input additive white Gaussian noise channel using low-density parity-check codes. One of the most popular techniques for decoding low-density parity-check codes is the linear programming decoder. In general, the linear programming decoder is suboptimal. I.e., the word error rate is higher than the optimal, maximum a posteriori decoder. In this paper we present a systematic approach to enhance the linear program decoder. More precisely, in the cases where the linear program outputs a fractional solution, we give a simple algorithm to identify frustrated cycles which cause the output of the linear program to be fractional. Then adding these cycles, adaptively to the basic linear program, we show improved word error rate performance.

Affiliated with

Also associated with

No associations

Rating

Improved Linear Programming Decoding using Frustrated Cycles 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 Improved Linear Programming Decoding using Frustrated Cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Linear Programming Decoding using Frustrated Cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-515117