Controlling the Error Floor in LDPC Decoding
Information Theory
2012-10-10 v3 math.IT
Abstract
The error floor of LDPC is revisited as an effect of dynamic message behavior in the so-called absorption sets of the code. It is shown that if the signal growth in the absorption sets is properly balanced by the growth of set-external messages, the error floor can be lowered to essentially arbitrarily low levels. Importance sampling techniques are discussed and used to verify the analysis, as well as to discuss the impact of iterations and message quantization on the code performance in the ultra-low BER (error floor) regime.
Keywords
Cite
@article{arxiv.1209.0532,
title = {Controlling the Error Floor in LDPC Decoding},
author = {Shuai Zhang and Christian Schlegel},
journal= {arXiv preprint arXiv:1209.0532},
year = {2012}
}
Comments
11 pages, 7 figures, Submitted to IEEE Trans. Comm