The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets
Abstract
The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree 2. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.