Rate-Compatible Spatially-Coupled LDPC Code Ensembles With Nearly-Regular Degree Distributions

Spatially-coupled regular LDPC code ensembles have outstanding performance with belief propagation decoding and can perform arbitrarily close to the Shannon limit without requiring irregular graph structures. In this paper, we are concerned with the performance and complexity of spatially-coupled ensembles with a rate-compatibility constraint. Spatially-coupled regular ensembles that support rate-compatibility through extension have been proposed before and show very good performance if the node degrees and the coupling width are chosen appropriately. But due to the strict constraint of maintaining a regular degree, there exist certain unfavorable rates that exhibit bad performance and high decoding complexity. We introduce an altered LDPC ensemble construction that changes the evolution of degrees over subsequent incremental redundancy steps in such a way, that the degrees can be kept low to achieve outstanding performance close to Shannon limit for all rates. These ensembles always outperform their regular counterparts at small coupling width.