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.
A. Iyengar, M. Papaleo, P. Siegel, J. K. Wolf, A. Vanelli-Coralli, G. E. Corazza (2012). Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels. IEEE TRANSACTIONS ON INFORMATION THEORY, 58, 2303-2320 [10.1109/TIT.2011.2177439].
Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
PAPALEO, MARCO;VANELLI CORALLI, ALESSANDRO;CORAZZA, GIOVANNI EMANUELE
2012
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.