2017/07/04 by Irina E. Bocharova, Boris D. Kudryashov, Bocharova, Irina E. +5
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1707.01025
openalex publication_date 2017/07/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Parameters of LDPC codes, such as minimum distance, stopping distance,\nstopping redundancy, girth of the Tanner graph, and their influence on the\nframe error rate performance of the BP, ML and near-ML decoding over a BEC and\nan AWGN channel are studied. Both random and structured LDPC codes are\nconsidered. In particular, the BP decoding is applied to the code parity-check\nmatrices with an increasing number of redundant rows, and the convergence of\nthe performance to that of the ML decoding is analyzed. A comparison of the\nsimulated BP, ML, and near-ML performance with the improved theoretical bounds\non the error probability based on the exact weight spectrum coefficients and\nthe exact stopping size spectrum coefficients is presented. It is observed that\ndecoding performance very close to the ML decoding performance can be achieved\nwith a relatively small number of redundant rows for some codes, for both the\nBEC and the AWGN channels.\n