On the Waterfall Performance of Finite-Length SC-LDPC Codes Constructed From Protographs
Lists
Only you see this
Abstract
An analysis of spatially coupled low-density parity-check (SC-LDPC) codes constructed from protographs is proposed. Given the protograph used to generate the SC-LDPC code ensemble, a set of scaling parameters to characterize the average finite-length performance in the waterfall region is computed. The error performance of structured SC-LDPC code ensembles is shown to follow a scaling law similar to that of unstructured randomly constructed SC-LDPC codes. Under a finite-length perspective, some of the most relevant SC-LDPC protograph structures proposed to date are compared. The analysis reveals significant differences in their finite-length scaling behavior, which is corroborated by simulation. Spatially coupled repeat-accumulate codes present excellent finite-length performance, as they outperform in the waterfall region SC-LDPC codes of the same rate and better asymptotic thresholds.
BibTeX
@article{stinner2016waterfall,
author = {Markus Stinner and Pablo M. Olmos},
title = {{On the Waterfall Performance of Finite-Length SC-LDPC Codes Constructed From Protographs}},
journal = {IEEE J. Sel. Areas Commun.},
year = {2016},
url = {https://openreview.net/forum?id=giJ9E8iW0b},
}Loading related content...