DocumentCode
27902
Title
A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes
Author
Olmos, Pablo M. ; Urbanke, Rudiger L.
Author_Institution
Dept. de Teor. de la Senal y Comun., Univ. Carlos III de Madrid, Leganés, Spain
Volume
61
Issue
6
fYear
2015
fDate
Jun-15
Firstpage
3164
Lastpage
3184
Abstract
Spatially-coupled low-density parity-check (SC-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 code 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 SC-LDPC codes under practical constraints.
Keywords
channel coding; parity check codes; probability; SC-LDPC codes; asymptotic analysis; asymptotic properties; binary erasure channel; error probability; finite length performance; finite length spatially coupled code; finite-length performance; scaling law; spatially coupled LDPC codes; Couplings; Decoding; Differential equations; Error probability; Iterative decoding; Sockets; Codes on graphs; codes on graphs; finite-length code performance; iterative decoding thresholds; spatially-coupled LDPC codes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2015.2422816
Filename
7086074
Link To Document