Finite-length scaling based on belief propagation for spatially coupled\n LDPC codes

2016/04/18 by Markus Stinner, Stinner, Markus, Luca Barletta +3
Computer Science · Engineering · #Error Correcting Code Techniques #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding

paper · pdf · doi:10.48550/arxiv.1604.05111

Abstract

The equivalence of peeling decoding (PD) and Belief Propagation (BP) for\nlow-density parity-check (LDPC) codes over the binary erasure channel is\nanalyzed. Modifying the scheduling for PD, it is shown that exactly the same\nvariable nodes (VNs) are resolved in every iteration than with BP. The decrease\nof erased VNs during the decoding process is analyzed instead of resolvable\nequations. This quantity can also be derived with density evolution, resulting\nin a drastic decrease in complexity. Finally, a scaling law using this quantity\nis established for spatially coupled LDPC codes.\n

Related

• Finite-Length Scaling of SC-LDPC Codes With a Limited Number of Decoding Iterations
• Analyzing Finite-length Protograph-based Spatially Coupled LDPC Codes
• On the Convergence Speed of Spatially Coupled LDPC Ensembles
• Triggering Wave-Like Convergence of Tail-biting Spatially Coupled LDPC\n Codes
• Finite-Length Scaling for Iteratively Decoded LDPC Ensembles