Finite-Length Scaling of SC-LDPC Codes With a Limited Number of Decoding Iterations
Preprint, 2022

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.

Codes-on-graphs

window decoding

spatially coupled LDPC codes

finite-length code performance

Author

Roman Sokolovskii

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks, Communication Systems

Alexandre Graell I Amat

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks, Communication Systems

Fredrik Brännström

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks, Communication Systems

Reliable Uncoordinated Medium Access for Critical Low-Latency Communication

Swedish Research Council (VR) (2016-04026), 2017-01-01 -- 2020-12-31.

Subject Categories

Telecommunications

Communication Systems

Infrastructure

C3SE (Chalmers Centre for Computational Science and Engineering)

DOI

10.48550/arXiv.2203.08880

More information

Latest update

3/18/2022