Selecting two-bit bit flipping algorithms for collective error correction

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages2881-2885
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: Jul 1 2012Jul 6 2012

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
CountryUnited States
CityCambridge, MA
Period7/1/127/6/12

Fingerprint

Error correction
Error Correction
Trapping
Decoding
Low-density Parity-check (LDPC) Codes
Configuration
Trivial
High Speed
Binary

ASJC Scopus subject areas

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

Cite this

Nguyen, D. V., Vasic, B. V., & Marcellin, M. W. (2012). Selecting two-bit bit flipping algorithms for collective error correction. In 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.

IEEE International Symposium on Information Theory - Proceedings. 2012. p. 2881-2885 6284051.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nguyen, DV, Vasic, BV & Marcellin, MW 2012, Selecting two-bit bit flipping algorithms for collective error correction. in 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
Nguyen DV, Vasic BV, Marcellin MW. Selecting two-bit bit flipping algorithms for collective error correction. In IEEE International Symposium on Information Theory - Proceedings. 2012. p. 2881-2885. 6284051 https://doi.org/10.1109/ISIT.2012.6284051
Nguyen, Dung Viet ; Vasic, Bane V ; Marcellin, Michael W. / Selecting two-bit bit flipping algorithms for collective error correction. IEEE International Symposium on Information Theory - Proceedings. 2012. pp. 2881-2885
@inproceedings{e4a3fb18824642939129769615596041,
title = "Selecting two-bit bit flipping algorithms for collective error correction",
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.",
author = "Nguyen, {Dung Viet} and Vasic, {Bane V} and Marcellin, {Michael W}",
year = "2012",
doi = "10.1109/ISIT.2012.6284051",
language = "English (US)",
isbn = "9781467325790",
pages = "2881--2885",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

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 -