@inproceedings{Stinner2014,

title = {Analyzing Finite-length Protograph-Based Spatially Coupled LDPC Codes},

author = {Markus Stinner and Pablo M Olmos},

url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6874961},

isbn = {978-1-4799-5186-4},

year  = {2014},

date = {2014-01-01},

booktitle = {2014 IEEE International Symposium on Information Theory},

pages = {891--895},

publisher = {IEEE},

address = {Honolulu},

abstract = {The peeling decoding for spatially coupled low-density parity-check (SC-LDPC) codes is analyzed for a binary erasure channel. An analytical calculation of the mean evolution of degree-one check nodes of protograph-based SC-LDPC codes is given and an estimate for the covariance evolution of degree-one check nodes is proposed in the stable decoding phase where the decoding wave propagates along the chain of coupled codes. Both results are verified numerically. Protograph-based SC-LDPC codes turn out to have a more robust behavior than unstructured random SC-LDPC codes. Using the analytically calculated parameters, the finite-length scaling laws for these constructions are given and verified by numerical simulations.},

keywords = {binary erasure channel, covariance analysis, covariance evolution, Decoding, degree-one check nodes, Error analysis, finite-length protograph, mean evolution, Monte Carlo methods, parity check codes, peeling decoding, protograph-based SC-LDPC codes, spatially coupled low-density parity-check codes, stable decoding phase, Steady-state, Vectors},

pubstate = {published},

tppubtype = {inproceedings}

}