Self-Corrected Min-Sum decoding of LDPC codes

Details Self-Corrected Min-Sum decoding of LDPC codes Self-Corrected Min-Sum decoding of LDPC codes

2008-03-07

arxiv.org/abs/0803.1090v2

Computer Science

Information Theory

5 pages, ISIT08 second version: acknowledgement footnote added (no content modification)

Scientific paper

In this paper we propose a very simple but powerful self-correction method for the Min-Sum decoding of LPDC codes. Unlike other correction methods known in the literature, our method does not try to correct the check node processing approximation, but it modifies the variable node processing by erasing unreliable messages. However, this positively affects check node messages, which become symmetric Gaussian distributed, and we show that this is sufficient to ensure a quasi-optimal decoding performance. Monte-Carlo simulations show that the proposed Self-Corrected Min-Sum decoding performs very close to the Sum-Product decoding, while preserving the main features of the Min-Sum decoding, that is low complexity and independence with respect to noise variance estimation errors.

Affiliated with

Also associated with

No associations

Rating

Self-Corrected Min-Sum 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 Self-Corrected Min-Sum decoding of LDPC codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Corrected Min-Sum decoding of LDPC codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-253023