The design of moderate-length erasure correcting low-density parity-check (LDPC) codes over correlated erasure channels is considered. Although the asymptotic LDPC code design remains the same as for a memoryless erasure channel, robustness to the channel correlation shall be guaranteed for the finite length LDPC code. This further requirement is of great importance in several wireless communication scenarios where packet erasure correcting codes represent a simple countermeasure for correlated fade events (e.g., in mobile wireless broadcasting services) and where the channel coherence time is often comparable with the code length. In this paper, the maximum tolerable erasure burst length (MTBL) is adopted as a simple metric for measuring the code robustness to the channel correlation. Correspondingly, a further step in the code construction is suggested, consisting of improving the LDPC code MTBL. Numerical results conducted over a Gilbert erasure channel, under both iterative and maximum likelihood decoding, highlight both the importance of the MTBL improvement in the finite-length code construction and the possibility to tightly approach the performance of maximum distance separable codes.

E. Paolini, G. Liva, B. Matuz, M. Chiani (2009). On construction of moderate-length LDPC codes over correlated erasure channels. PISCATAWAY, NJ : IEEE.

On construction of moderate-length LDPC codes over correlated erasure channels

PAOLINI, ENRICO;CHIANI, MARCO
2009

Abstract

The design of moderate-length erasure correcting low-density parity-check (LDPC) codes over correlated erasure channels is considered. Although the asymptotic LDPC code design remains the same as for a memoryless erasure channel, robustness to the channel correlation shall be guaranteed for the finite length LDPC code. This further requirement is of great importance in several wireless communication scenarios where packet erasure correcting codes represent a simple countermeasure for correlated fade events (e.g., in mobile wireless broadcasting services) and where the channel coherence time is often comparable with the code length. In this paper, the maximum tolerable erasure burst length (MTBL) is adopted as a simple metric for measuring the code robustness to the channel correlation. Correspondingly, a further step in the code construction is suggested, consisting of improving the LDPC code MTBL. Numerical results conducted over a Gilbert erasure channel, under both iterative and maximum likelihood decoding, highlight both the importance of the MTBL improvement in the finite-length code construction and the possibility to tightly approach the performance of maximum distance separable codes.
2009
IEEE Int. Conf. on Commun. (ICC)
1
5
E. Paolini, G. Liva, B. Matuz, M. Chiani (2009). On construction of moderate-length LDPC codes over correlated erasure channels. PISCATAWAY, NJ : IEEE.
E. Paolini; G. Liva; B. Matuz; M. Chiani
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/87186
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 0
social impact