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

  • Authors:

  • Gianluigi Liva;Balazs Matuz;Zoltán Katona;Enrico Paolini;Marco Chiani

  • Affiliations:

  • Institute of Communication and Navigation, Deutsches Zentrum fur Luft- und Raumfahrt, Wessling, Germany;Institute of Communication and Navigation, Deutsches Zentrum fur Luft- und Raumfahrt, Wessling, Germany;Institute of Communication and Navigation, Deutsches Zentrum fur Luft- und Raumfahrt, Wessling, Germany;DEIS, WiLAB, University of Bologna, Cesena, FC, Italy;DEIS, WiLAB, University of Bologna, Cesena, FC, Italy

  • Venue:
  • ICC'09 Proceedings of the 2009 IEEE international conference on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

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.