Two-Bit Bit Flipping Decoding of LDPC Codes

Details Two-Bit Bit Flipping Decoding of LDPC Codes Two-Bit Bit Flipping Decoding of LDPC Codes

2011-03-03

arxiv.org/abs/1103.0801v1

Computer Science

Information Theory

6 pages. Submitted to IEEE International Symposium on Information Theory 2011

Scientific paper

In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed algorithms employ one additional bit at a variable node to represent its "strength." The introduction of this additional bit increases the guaranteed error correction capability by a factor of at least 2. An additional bit can also be employed at a check node to capture information which is beneficial to decoding. A framework for failure analysis of the proposed algorithms is described. These algorithms outperform the Gallager A/B algorithm and the min-sum algorithm at much lower complexity. Concatenation of two-bit bit flipping algorithms show a potential to approach the performance of belief propagation (BP) decoding in the error floor region, also at lower complexity.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320175