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

Iryna Andriyanova, Ezio Biglieri, Joseph Boutros

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper presents our investigation on iterative decoding performances of some sparse-graph codes on blockfading 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.

Original languageEnglish
Title of host publication2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Pages167-171
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2010
Event48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 - Monticello, IL, United States
Duration: 29 Sep 20101 Oct 2010

Other

Other48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
CountryUnited States
CityMonticello, IL
Period29/9/101/10/10

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Andriyanova, I., Biglieri, E., & Boutros, J. (2010). On iterative performance of LDPC and root-LDPC codes over block-fading channels. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 (pp. 167-171). [5706903] https://doi.org/10.1109/ALLERTON.2010.5706903