Finite-Length Scaling of SC-LDPC Codes With a Limited Number of Decoding Iterations
Abstract
We propose four finite-length scaling laws to predict the frame error rate (FER) performance of spatially-coupled low-density parity-check codes under full belief propagation (BP) decoding with a limit on the number of decoding iterations and a scaling law for sliding window decoding, also with limited iterations. The laws for full BP decoding provide a choice between accuracy and computational complexity; a good balance between them is achieved by the law that models the number of decoded bits after a certain number of BP iterations by a time-integrated Ornstein-Uhlenbeck process. This framework is developed further to model sliding window decoding as a race between the integrated Ornstein-Uhlenbeck process and an absorbing barrier that corresponds to the left boundary of the sliding window. The proposed scaling laws yield accurate FER predictions.
Keywords
Cite
@article{arxiv.2203.08880,
title = {Finite-Length Scaling of SC-LDPC Codes With a Limited Number of Decoding Iterations},
author = {Roman Sokolovskii and Alexandre Graell i Amat and Fredrik Brännström},
journal= {arXiv preprint arXiv:2203.08880},
year = {2022}
}