TY - GEN
T1 - Two-bit bit flipping decoding of LDPC codes
AU - Nguyen, Dung Viet
AU - Vasić, Bane
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
AN - SCOPUS:80054798082
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1995
EP - 1999
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -