Towards Low-Complexity Linear-Programming Decoding

Details Towards Low-Complexity Linear-Programming Decoding Towards Low-Complexity Linear-Programming Decoding

2006-02-26

arxiv.org/abs/cs/0602088v1

Proc. 4th Int. Symposium on Turbo Codes and Related Topics, Munich, Germany, April 3-7, 2006

Computer Science

Information Theory

Scientific paper

We consider linear-programming (LP) decoding of low-density parity-check (LDPC) codes. While it is clear that one can use any general-purpose LP solver to solve the LP that appears in the decoding problem, we argue in this paper that the LP at hand is equipped with a lot of structure that one should take advantage of. Towards this goal, we study the dual LP and show how coordinate-ascent methods lead to very simple update rules that are tightly connected to the min-sum algorithm. Moreover, replacing minima in the formula of the dual LP with soft-minima one obtains update rules that are tightly connected to the sum-product algorithm. This shows that LP solvers with complexity similar to the min-sum algorithm and the sum-product algorithm are feasible. Finally, we also discuss some sub-gradient-based methods.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-6339