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.
Cite
@article{arxiv.1202.1348,
title = {Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction},
author = {Dung Viet Nguyen and Bane Vasic and Michael W. Marcellin},
journal= {arXiv preprint arXiv:1202.1348},
year = {2012}
}
Comments
5 pages, 1 figure, accepted for presentation at the IEEE International Symposium on Information Theory (ISIT) 2012