Finite-Length Scaling of SC-LDPC Codes With a Limited Number of Decoding Iterations
Artikel i vetenskaplig tidskrift, 2023
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.
Error analysis
window decoding
Decoding
Optimization
finite-length code performance
Iterative decoding
Propagation losses
Mathematical models
spatially-coupled LDPC codes
spatially coupled LDPC codes
Error probability
Codes-on-graphs
Författare
Roman Sokolovskii
Chalmers, Elektroteknik, Kommunikation, Antenner och Optiska Nätverk
Alexandre Graell I Amat
Chalmers, Elektroteknik, Kommunikation, Antenner och Optiska Nätverk
Fredrik Brännström
Chalmers, Elektroteknik, Kommunikation, Antenner och Optiska Nätverk
IEEE Transactions on Information Theory
0018-9448 (ISSN) 1557-9654 (eISSN)
Vol. 69 8 4869-4888Pålitliga accessmetoder för kritisk kommunikation med låga fördröjningar
Vetenskapsrådet (VR) (2016-04026), 2017-01-01 -- 2020-12-31.
Ämneskategorier (SSIF 2011)
Telekommunikation
Beräkningsmatematik
Kommunikationssystem
Sannolikhetsteori och statistik
Infrastruktur
C3SE (Chalmers Centre for Computational Science and Engineering)
DOI
10.1109/TIT.2023.3257235