On iterative performance of LDPC and Root-LDPC codes over block-fading channels

Iryna Andriyanova (1) , Ezio Biglieri (2) , Joseph J. Boutros (3)

1 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
2 DITIC, universitat Pompeu Fabra
3 Texas A&M University System

This paper1 presents our investigation on iterative decoding performances of some sparse-graph codes on block-fading Rayleigh channels. The considered code ensembles are standard LDPC codes and Root-LDPC codes, first proposed in [1] and shown to be able to attain the full transmission diversity. We study the iterative threshold performance of those codes as a function of fading gains of the transmission channel and propose a numerical approximation of the iterative threshold versus fading gains, both both LDPC and Root-LDPC codes. Also, we show analytically that, in the case of 2 fading blocks, the iterative threshold γ*root of Root-LDPC codes is proportional to (α1α2)-1, where α1 and α2 are corresponding fading gains. From this result, the full diversity property of Root-LDPC codes immediately follows.

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Iryna Andriyanova, Ezio Biglieri, Joseph J. Boutros. On iterative performance of LDPC and Root-LDPC codes over block-fading channels. 48th Annual Allerton Conference on Communication, Control, and Computing, Sep 2010, Monticello, United States. ⟨hal-00591838⟩