Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
From MaRDI portal
Publication:5272015
DOI10.1109/TIT.2011.2177439zbMATH Open1365.94540arXiv1010.4548OpenAlexW3100523383MaRDI QIDQ5272015FDOQ5272015
Authors: Aravind R. Iyengar, Marco Papaleo, Jack Keil Wolf, Alessandro Vanelli-Coralli, G. E. Corazza, Paul Siegel 
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code ensembles that exhibit good performance with the windowed decoder. We will consider the performance of these ensembles and codes over erasure channels with and without memory. We show that the structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed decoding. However, the same structure imposes limitations on the performance over erasure channels with memory.
Full work available at URL: https://arxiv.org/abs/1010.4548
Cited In (1)
This page was built for publication: Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272015)
