The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets
Information Theory
2014-11-11 v1 math.IT
Abstract
The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree . The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the convergence of the algorithm are derived and applied to trapping sets.
Cite
@article{arxiv.1411.2169,
title = {The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets},
author = {John O. Brevik and Michael E. O'Sullivan},
journal= {arXiv preprint arXiv:1411.2169},
year = {2014}
}
Comments
Unpublished, 26 pages