Full diversity random LDPC codes

Dieter Duyck, Joseph Boutros, Marc Moeneclaey

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

2 Citations (Scopus)

Abstract

The block fading (BF) channel is a useful model for various communication systems in urban environments. Full-diversity error-correcting codes are required to approach the physical limits of the performance on BF channels. Low-density parity-check (LDPC) codes are good error-correcting codes, but full-diversity standard random LDPC codes for the BF channel are not known yet. We design full-diversity random LDPC ensembles at infinite block length by optimizing the threshold in multiple points in the fading space, which takes into account the randomness of the fading. However, this is not sufficient to achieve full-diversity at finite block length, because of stopping sets. We therefore propose a method to generate full-diversity code instances at finite length so that stopping sets over information bits are avoided. The asymptotic and finite length word error rate performance is verified by means of density evolution and Monte Carlo simulations, respectively, confirming that full-diversity standard random LDPC codes exist and perform well.

Original languageEnglish
Title of host publication2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011
DOIs
Publication statusPublished - 1 Dec 2011
Event2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011 - Ghent, Belgium
Duration: 22 Nov 201123 Nov 2011

Other

Other2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011
CountryBelgium
CityGhent
Period22/11/1123/11/11

Fingerprint

Fading channels
Communication systems
Monte Carlo simulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Automotive Engineering

Cite this

Duyck, D., Boutros, J., & Moeneclaey, M. (2011). Full diversity random LDPC codes. In 2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011 [6101300] https://doi.org/10.1109/SCVT.2011.6101300

Full diversity random LDPC codes. / Duyck, Dieter; Boutros, Joseph; Moeneclaey, Marc.

2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011. 2011. 6101300.

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

Duyck, D, Boutros, J & Moeneclaey, M 2011, Full diversity random LDPC codes. in 2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011., 6101300, 2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011, Ghent, Belgium, 22/11/11. https://doi.org/10.1109/SCVT.2011.6101300
Duyck D, Boutros J, Moeneclaey M. Full diversity random LDPC codes. In 2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011. 2011. 6101300 https://doi.org/10.1109/SCVT.2011.6101300
Duyck, Dieter ; Boutros, Joseph ; Moeneclaey, Marc. / Full diversity random LDPC codes. 2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011. 2011.
@inproceedings{e97e2074bd41460dbcd1e43fe79d9681,
title = "Full diversity random LDPC codes",
abstract = "The block fading (BF) channel is a useful model for various communication systems in urban environments. Full-diversity error-correcting codes are required to approach the physical limits of the performance on BF channels. Low-density parity-check (LDPC) codes are good error-correcting codes, but full-diversity standard random LDPC codes for the BF channel are not known yet. We design full-diversity random LDPC ensembles at infinite block length by optimizing the threshold in multiple points in the fading space, which takes into account the randomness of the fading. However, this is not sufficient to achieve full-diversity at finite block length, because of stopping sets. We therefore propose a method to generate full-diversity code instances at finite length so that stopping sets over information bits are avoided. The asymptotic and finite length word error rate performance is verified by means of density evolution and Monte Carlo simulations, respectively, confirming that full-diversity standard random LDPC codes exist and perform well.",
author = "Dieter Duyck and Joseph Boutros and Marc Moeneclaey",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/SCVT.2011.6101300",
language = "English",
isbn = "9781457712890",
booktitle = "2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011",

}

TY - GEN

T1 - Full diversity random LDPC codes

AU - Duyck, Dieter

AU - Boutros, Joseph

AU - Moeneclaey, Marc

PY - 2011/12/1

Y1 - 2011/12/1

N2 - The block fading (BF) channel is a useful model for various communication systems in urban environments. Full-diversity error-correcting codes are required to approach the physical limits of the performance on BF channels. Low-density parity-check (LDPC) codes are good error-correcting codes, but full-diversity standard random LDPC codes for the BF channel are not known yet. We design full-diversity random LDPC ensembles at infinite block length by optimizing the threshold in multiple points in the fading space, which takes into account the randomness of the fading. However, this is not sufficient to achieve full-diversity at finite block length, because of stopping sets. We therefore propose a method to generate full-diversity code instances at finite length so that stopping sets over information bits are avoided. The asymptotic and finite length word error rate performance is verified by means of density evolution and Monte Carlo simulations, respectively, confirming that full-diversity standard random LDPC codes exist and perform well.

AB - The block fading (BF) channel is a useful model for various communication systems in urban environments. Full-diversity error-correcting codes are required to approach the physical limits of the performance on BF channels. Low-density parity-check (LDPC) codes are good error-correcting codes, but full-diversity standard random LDPC codes for the BF channel are not known yet. We design full-diversity random LDPC ensembles at infinite block length by optimizing the threshold in multiple points in the fading space, which takes into account the randomness of the fading. However, this is not sufficient to achieve full-diversity at finite block length, because of stopping sets. We therefore propose a method to generate full-diversity code instances at finite length so that stopping sets over information bits are avoided. The asymptotic and finite length word error rate performance is verified by means of density evolution and Monte Carlo simulations, respectively, confirming that full-diversity standard random LDPC codes exist and perform well.

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

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

U2 - 10.1109/SCVT.2011.6101300

DO - 10.1109/SCVT.2011.6101300

M3 - Conference contribution

SN - 9781457712890

BT - 2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011

ER -