Finite-Length Scaling of Spatially Coupled LDPC Codes under Window Decoding over the BEC
Artikel i vetenskaplig tidskrift, 2020

We analyze the finite-length performance of spatially coupled low-density parity-check (SC-LDPC) codes under window decoding over the binary erasure channel. In particular, we propose a refinement of the scaling law by Olmos and Urbanke for the frame error rate (FER) of terminated SC-LDPC ensembles under full belief propagation (BP) decoding. The refined scaling law models the decoding process as two independent Ornstein-Uhlenbeck processes, in correspondence to the two decoding waves that propagate toward the center of the coupled chain for terminated SC-LDPC codes. We then extend the proposed scaling law to predict the performance of (terminated) SC-LDPC code ensembles under the more practical sliding window decoding. Finally, we extend this framework to predict the bit error rate (BER) and block error rate (BLER) of SC-LDPC code ensembles. The proposed scaling law yields very accurate predictions of the FER, BLER, and BER for both full BP and window decoding.

spatially coupled low-density parity-check (SC-LDPC) codes

window decoding

finite-length code performance

Codes-on-graphs

Författare

Roman Sokolovskii

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Alexandre Graell I Amat

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Fredrik Brännström

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

IEEE Transactions on Communications

00906778 (ISSN)

Vol. 68 10 5988-5998 9145741

Ämneskategorier

Telekommunikation

Beräkningsmatematik

Sannolikhetsteori och statistik

DOI

10.1109/TCOMM.2020.3010958

Mer information

Senast uppdaterat

2020-11-11