We propose a windowed decoding scheme for protograph-based LDPC convolutional codes (LDPC-CC) that allows us to efficiently trade-off decoding performance for gains in latency. We study the performance of regular LDPC-CC with the windowed decoding scheme. In particular, we show that the class of LDPC-CC proposed in the literature with good belief propagation performance is ill-suited for windowed decoding. Further, we establish properties of code ensembles with good windowed decoding performance over erasure channels with and without memory.
G. E. Corazza, A. R. Iyengar, M. Papaleo, P. H. Siegel, A. Vanelli-Coralli, J. K. Wolf (2010). Latency constrained protograph-based LDPC-CC. BREST : International symposium on turbo codes.
Latency constrained protograph-based LDPC-CC
CORAZZA, GIOVANNI EMANUELE;PAPALEO, MARCO;VANELLI CORALLI, ALESSANDRO;
2010
Abstract
We propose a windowed decoding scheme for protograph-based LDPC convolutional codes (LDPC-CC) that allows us to efficiently trade-off decoding performance for gains in latency. We study the performance of regular LDPC-CC with the windowed decoding scheme. In particular, we show that the class of LDPC-CC proposed in the literature with good belief propagation performance is ill-suited for windowed decoding. Further, we establish properties of code ensembles with good windowed decoding performance over erasure channels with and without memory.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
