DMCA
Windowed decoding of protograph-based LDPC convolutional codes over erasure channels (2012)
| Venue: | IEEE TRANS. ON INFORMATION THEORY |
| Citations: | 20 - 3 self |
BibTeX
@ARTICLE{Iyengar12windoweddecoding,
author = {Aravind R. Iyengar and Marco Papaleo and Paul H. Siegel and Jack Keil Wolf and Alessandro Vanelli-coralli and Giovanni E. Corazza},
title = {Windowed decoding of protograph-based LDPC convolutional codes over erasure channels},
journal = {IEEE TRANS. ON INFORMATION THEORY},
year = {2012},
volume = {58},
number = {4},
pages = {2011}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
Keyphrases
erasure channel protograph-based ldpc convolutional code windowed decoding ldpc convolutional code ensemble good performance iterative decoding index term belief propagation certain characteristic windowed decoder memoryless erasure channel theoretical limit bp decoder ldpc convolutional code low-density parity-check code convolutional code
