### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Pages | 2881-2885 |

Number of pages | 5 |

DOIs | |

State | Published - 2012 |

Event | 2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: Jul 1 2012 → Jul 6 2012 |

### Other

Other | 2012 IEEE International Symposium on Information Theory, ISIT 2012 |
---|---|

Country | United States |

City | Cambridge, MA |

Period | 7/1/12 → 7/6/12 |

### Fingerprint

### ASJC Scopus subject areas

- Applied Mathematics
- Modeling and Simulation
- Theoretical Computer Science
- Information Systems

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*(pp. 2881-2885). [6284051] https://doi.org/10.1109/ISIT.2012.6284051

**Selecting two-bit bit flipping algorithms for collective error correction.** / Nguyen, Dung Viet; Vasic, Bane V; Marcellin, Michael W.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Symposium on Information Theory - Proceedings.*, 6284051, pp. 2881-2885, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 7/1/12. https://doi.org/10.1109/ISIT.2012.6284051

}

TY - GEN

T1 - Selecting two-bit bit flipping algorithms for collective error correction

AU - Nguyen, Dung Viet

AU - Vasic, Bane V

AU - Marcellin, Michael W

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867540132&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867540132&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2012.6284051

DO - 10.1109/ISIT.2012.6284051

M3 - Conference contribution

SN - 9781467325790

SP - 2881

EP - 2885

BT - IEEE International Symposium on Information Theory - Proceedings

ER -