Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction

Details Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction

2012-02-07

arxiv.org/abs/1202.1348v1

Computer Science

Information Theory

5 pages, 1 figure, submitted to the IEEE International Symposium on Information Theory (ISIT) 2012

Scientific paper

A class of two-bit bit flipping algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these algorithms operating in parallel can offer low error floor decoding for high-speed applications. As the number of two-bit bit flipping algorithms is large, designing such a decoder is not a trivial task. In this paper, we describe a procedure to select collections of algorithms that work well together. This procedure relies on a recursive process which enumerates error configurations that are uncorrectable by a given algorithm. The error configurations uncorrectable by a given algorithm form its trapping set profile. Based on their trapping set profiles, algorithms are selected so that in parallel, they can correct a fixed number of errors with high probability.

Affiliated with

Also associated with

No associations

Rating

Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction 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 Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578848