From product codes to structured generalized LDPC codes

Michael Lentmaier; Gianluigi Liva; Enrico Paolini; Gerhard Fettweis

5th International ICST Conference on Communications and Networking in China

Research Article

From product codes to structured generalized LDPC codes

Download513 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/chinacom.2010.81,
    author={Michael Lentmaier and Gianluigi Liva and Enrico Paolini and Gerhard Fettweis},
    title={From product codes to structured generalized LDPC codes},
    proceedings={5th International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2011},
    month={1},
    keywords={Iterative decoding product codes turbo codes low-density parity-check codes},
    doi={10.4108/chinacom.2010.81}
}

Michael Lentmaier
Gianluigi Liva
Enrico Paolini
Gerhard Fettweis
Year: 2011
From product codes to structured generalized LDPC codes
CHINACOM
ICST
DOI: 10.4108/chinacom.2010.81

Michael Lentmaier¹^,*, Gianluigi Liva²^,*, Enrico Paolini³^,*, Gerhard Fettweis¹^,*

1: Vodafone Chair Mobile Communications Systems, Dresden University of Technology (TU Dresden), 01062 Dresden, Germany
2: Institute of Communications and Navigation, German Aerospace Center (DLR), Oberpfaffenhofen, 82234 Wessling, Germany
3: DEIS, WiLAB, University of Bologna, 47023 Cesena (FC), Italy

*Contact email: michael.lentmaier@ifn.et.tu-dresden.de, Gianluigi.Liva@dlr.de, e.paolini@unibo.it, fettweis@ifn.et.tu-dresden.de

Abstract

Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors. In this paper, we show by means of an ensemble weight enumerator analysis that the minimum distance multiplicities of product codes are much higher than those obtainable by other generalized LDPC (GLDPC) constructions employing the same component codes. We then propose a simple construction of quasi-cyclic GLDPC codes which leads to significantly lower error floors while leaving the decoder architecture of product codes almost untouched.

Keywords: Iterative decoding product codes turbo codes low-density parity-check codes

Published: 2011-01-10
Publisher: IEEE

: http://dx.doi.org/10.4108/chinacom.2010.81