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

Fading channels
Iterative decoding

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

On iterative performance of LDPC and root-LDPC codes over block-fading channels. / Andriyanova, Iryna; Biglieri, Ezio; Boutros, Joseph.

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. p. 167-171 5706903.

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

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., 5706903, pp. 167-171, 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, Monticello, IL, United States, 29/9/10. https://doi.org/10.1109/ALLERTON.2010.5706903
Andriyanova I, Biglieri E, Boutros J. 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. 2010. p. 167-171. 5706903 https://doi.org/10.1109/ALLERTON.2010.5706903
Andriyanova, Iryna ; Biglieri, Ezio ; Boutros, Joseph. / On iterative performance of LDPC and root-LDPC codes over block-fading channels. 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. pp. 167-171
@inproceedings{a2f4ffca40f94b97a75e42f43dc67235,
title = "On iterative performance of LDPC and root-LDPC codes over block-fading channels",
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.",
author = "Iryna Andriyanova and Ezio Biglieri and Joseph Boutros",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/ALLERTON.2010.5706903",
language = "English",
isbn = "9781424482146",
pages = "167--171",
booktitle = "2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010",

}

TY - GEN

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

AU - Andriyanova, Iryna

AU - Biglieri, Ezio

AU - Boutros, Joseph

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79952429364&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952429364&partnerID=8YFLogxK

U2 - 10.1109/ALLERTON.2010.5706903

DO - 10.1109/ALLERTON.2010.5706903

M3 - Conference contribution

AN - SCOPUS:79952429364

SN - 9781424482146

SP - 167

EP - 171

BT - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

ER -