On Doped SC-LDPC Codes for Streaming
Open Access
- 30 March 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (7) , 2123-2127
Abstract
In streaming applications, doping improves the performance of spatially-coupled low-density parity-check (SC-LDPC) codes by creating reduced-degree check nodes in the coupled chain. We formulate a scaling law to predict the bit and block error rate of periodically-doped semi-infinite SC-LDPC code ensembles streamed over the binary erasure channel under sliding window decoding for a given finite component block length. The scaling law assumes that with some probability doping is equivalent to full termination and triggers two decoding waves; otherwise, decoding performs as if the coupled chain had not been doped at all. We approximate that probability and use the derived scaling laws to predict the error rates of SC-LDPC code ensembles in the presence of doping. The proposed scaling law provides accurate error rate predictions. We further use it to show that in streaming applications periodic doping can yield higher rates than periodic full termination for the same error-correcting performance.Keywords
All Related Versions
Funding Information
- Swedish Research Council (2016-4026)
This publication has 12 references indexed in Scilit:
- A Refined Scaling Law for Spatially Coupled LDPC Codes Over the Binary Erasure Channel2019
- Triggering wave-like convergence of tail-biting spatially coupled LDPC codes2016
- On the Waterfall Performance of Finite-Length SC-LDPC Codes Constructed From ProtographsIEEE Journal on Selected Areas in Communications, 2015
- A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC CodesIEEE Transactions on Information Theory, 2015
- Spatially Coupled Ensembles Universally Achieve Capacity Under Belief PropagationIEEE Transactions on Information Theory, 2013
- Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure ChannelsIEEE Transactions on Information Theory, 2011
- Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BECIEEE Transactions on Information Theory, 2011
- Iterative Decoding Threshold Analysis for LDPC Convolutional CodesIEEE Transactions on Information Theory, 2010
- Finite-Length Scaling for Iteratively Decoded LDPC EnsemblesIEEE Transactions on Information Theory, 2009
- Time-varying periodic convolutional codes with low-density parity-check matrixIEEE Transactions on Information Theory, 1999