"We consider terminated LDPC convolutional codes (LDPC-CC) constructed from protographs and explore the performance of these codes on correlated erasure channels including a single-burst channel (SBC) and Gilbert-Elliott channel (GEC). We consider code performance with a latency-constrained message passing decoder and the belief propagation decoder. We give theoretical bounds on the code efficiency over the SBC and describe a construction that achieves this bound. We show that the designed codes with belief propagation (BP) decoding perform as well as the regular LDPC-CCs presented in the literature on the binary erasure channel (BEC) and the GEC, while achieving significant gains on the SBC. In the case of windowed decoding, our codes perform much better than the best known regular LDPC-CCs over the BEC and the GEC, with very low decoding latencies."
A. R. Iyengar, M. Papaleo, G. Liva, P. H. Siegel, J. K. Wolf, G. E. Corazza (2010). Protograph-based LDPC convolutional codes for correlated erasure channels. s.l : IEEE.
Protograph-based LDPC convolutional codes for correlated erasure channels
PAPALEO, MARCO;CORAZZA, GIOVANNI EMANUELE
2010
Abstract
"We consider terminated LDPC convolutional codes (LDPC-CC) constructed from protographs and explore the performance of these codes on correlated erasure channels including a single-burst channel (SBC) and Gilbert-Elliott channel (GEC). We consider code performance with a latency-constrained message passing decoder and the belief propagation decoder. We give theoretical bounds on the code efficiency over the SBC and describe a construction that achieves this bound. We show that the designed codes with belief propagation (BP) decoding perform as well as the regular LDPC-CCs presented in the literature on the binary erasure channel (BEC) and the GEC, while achieving significant gains on the SBC. In the case of windowed decoding, our codes perform much better than the best known regular LDPC-CCs over the BEC and the GEC, with very low decoding latencies."I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.