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.
Cite
@article{arxiv.1103.0801,
title = {Two-Bit Bit Flipping Decoding of LDPC Codes},
author = {Dung Viet Nguyen and Bane Vasic and Michael W. Marcellin},
journal= {arXiv preprint arXiv:1103.0801},
year = {2016}
}
Comments
6 pages. Submitted to IEEE International Symposium on Information Theory 2011