Two-bit bit flipping decoding of LDPC codes

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

6 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages1995-1999
Number of pages5
DOIs
StatePublished - 2011
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: Jul 31 2011Aug 5 2011

Other

Other2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
CountryRussian Federation
CitySt. Petersburg
Period7/31/118/5/11

Fingerprint

Low-density Parity-check (LDPC) Codes
Decoding
Low Complexity
Failure Analysis
Belief Propagation
Concatenation
Error correction
Error Correction
Vertex of a graph
Failure analysis
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. (2011). Two-bit bit flipping decoding of LDPC codes. In IEEE International Symposium on Information Theory - Proceedings (pp. 1995-1999). [6033902] https://doi.org/10.1109/ISIT.2011.6033902

Two-bit bit flipping decoding of LDPC codes. / Nguyen, Dung Viet; Vasic, Bane V; Marcellin, Michael W.

IEEE International Symposium on Information Theory - Proceedings. 2011. p. 1995-1999 6033902.

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

Nguyen, DV, Vasic, BV & Marcellin, MW 2011, Two-bit bit flipping decoding of LDPC codes. in IEEE International Symposium on Information Theory - Proceedings., 6033902, pp. 1995-1999, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russian Federation, 7/31/11. https://doi.org/10.1109/ISIT.2011.6033902
Nguyen DV, Vasic BV, Marcellin MW. Two-bit bit flipping decoding of LDPC codes. In IEEE International Symposium on Information Theory - Proceedings. 2011. p. 1995-1999. 6033902 https://doi.org/10.1109/ISIT.2011.6033902
Nguyen, Dung Viet ; Vasic, Bane V ; Marcellin, Michael W. / Two-bit bit flipping decoding of LDPC codes. IEEE International Symposium on Information Theory - Proceedings. 2011. pp. 1995-1999
@inproceedings{89296be33a694f3cba2416132a3d04df,
title = "Two-bit bit flipping decoding of LDPC codes",
abstract = "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.",
author = "Nguyen, {Dung Viet} and Vasic, {Bane V} and Marcellin, {Michael W}",
year = "2011",
doi = "10.1109/ISIT.2011.6033902",
language = "English (US)",
isbn = "9781457705953",
pages = "1995--1999",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Two-bit bit flipping decoding of LDPC codes

AU - Nguyen, Dung Viet

AU - Vasic, Bane V

AU - Marcellin, Michael W

PY - 2011

Y1 - 2011

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

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

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

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

U2 - 10.1109/ISIT.2011.6033902

DO - 10.1109/ISIT.2011.6033902

M3 - Conference contribution

SN - 9781457705953

SP - 1995

EP - 1999

BT - IEEE International Symposium on Information Theory - Proceedings

ER -