A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

DOI10.1109/TIT.2015.2422816MaRDI QIDQ2977418zbMATH OpenOpenAlexFDO

Authors Pablo M. Olmos, Ruediger Urbanke

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.5719

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: Spatially-coupled LDPC codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially-coupled ensembles when transmission takes place over the binary erasure channel. We discuss how the parameters of the scaling law are connected to fundamental quantities appearing in the asymptotic analysis of these ensembles and we verify that the predictions of the scaling law fit well to the data derived from simulations over a wide range of parameters. The ultimate goal of this line of research is to develop analytic tools for the design of spatially-coupled LDPC codes under practical constraints.

Cited in

(2)

• On the Decoding Performance of Spatially Coupled LDPC Codes With Sub-Block Access
• Performance of LDPC Decoding Algorithms with a Statistical Physics Theory Approach

This page was built for publication: A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977418)