Diversity and coding gain evolution in graph codes

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

26 Citations (Scopus)

Abstract

This work is a first attempt to analyze and understand the coding gain of full-diversity (MDS) low-density paritycheck (LDPC) codes. A diversity population evolution is derived. The steady-state distribution of energy coefficients is found. Based on this new analysis, we show new full-diversity LDPC codes with improved performance. Finally, we describe a family of graph codes where all variable nodes, including parity nodes, achieve full diversity after a large number of decoding iterations. Fulldiversity MDS low-density codes are not only useful for digital data transmission over wireless channels, some other applications can be found in situations where coding for a finite number of states is required.

Original languageEnglish
Title of host publicationInformation Theory and Applications Workshop, ITA 2009
Pages34-43
Number of pages10
DOIs
Publication statusPublished - 25 Sep 2009
EventInformation Theory and Applications Workshop, ITA 2009 - San Diego, CA, United States
Duration: 8 Feb 200913 Feb 2009

Other

OtherInformation Theory and Applications Workshop, ITA 2009
CountryUnited States
CitySan Diego, CA
Period8/2/0913/2/09

Fingerprint

Data communication systems
Decoding

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Boutros, J. (2009). Diversity and coding gain evolution in graph codes. In Information Theory and Applications Workshop, ITA 2009 (pp. 34-43). [5044920] https://doi.org/10.1109/ITA.2009.5044920

Diversity and coding gain evolution in graph codes. / Boutros, Joseph.

Information Theory and Applications Workshop, ITA 2009. 2009. p. 34-43 5044920.

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

Boutros, J 2009, Diversity and coding gain evolution in graph codes. in Information Theory and Applications Workshop, ITA 2009., 5044920, pp. 34-43, Information Theory and Applications Workshop, ITA 2009, San Diego, CA, United States, 8/2/09. https://doi.org/10.1109/ITA.2009.5044920
Boutros J. Diversity and coding gain evolution in graph codes. In Information Theory and Applications Workshop, ITA 2009. 2009. p. 34-43. 5044920 https://doi.org/10.1109/ITA.2009.5044920
Boutros, Joseph. / Diversity and coding gain evolution in graph codes. Information Theory and Applications Workshop, ITA 2009. 2009. pp. 34-43
@inproceedings{fc972c722eac40f1b592e60b699fc98c,
title = "Diversity and coding gain evolution in graph codes",
abstract = "This work is a first attempt to analyze and understand the coding gain of full-diversity (MDS) low-density paritycheck (LDPC) codes. A diversity population evolution is derived. The steady-state distribution of energy coefficients is found. Based on this new analysis, we show new full-diversity LDPC codes with improved performance. Finally, we describe a family of graph codes where all variable nodes, including parity nodes, achieve full diversity after a large number of decoding iterations. Fulldiversity MDS low-density codes are not only useful for digital data transmission over wireless channels, some other applications can be found in situations where coding for a finite number of states is required.",
author = "Joseph Boutros",
year = "2009",
month = "9",
day = "25",
doi = "10.1109/ITA.2009.5044920",
language = "English",
isbn = "9781424439904",
pages = "34--43",
booktitle = "Information Theory and Applications Workshop, ITA 2009",

}

TY - GEN

T1 - Diversity and coding gain evolution in graph codes

AU - Boutros, Joseph

PY - 2009/9/25

Y1 - 2009/9/25

N2 - This work is a first attempt to analyze and understand the coding gain of full-diversity (MDS) low-density paritycheck (LDPC) codes. A diversity population evolution is derived. The steady-state distribution of energy coefficients is found. Based on this new analysis, we show new full-diversity LDPC codes with improved performance. Finally, we describe a family of graph codes where all variable nodes, including parity nodes, achieve full diversity after a large number of decoding iterations. Fulldiversity MDS low-density codes are not only useful for digital data transmission over wireless channels, some other applications can be found in situations where coding for a finite number of states is required.

AB - This work is a first attempt to analyze and understand the coding gain of full-diversity (MDS) low-density paritycheck (LDPC) codes. A diversity population evolution is derived. The steady-state distribution of energy coefficients is found. Based on this new analysis, we show new full-diversity LDPC codes with improved performance. Finally, we describe a family of graph codes where all variable nodes, including parity nodes, achieve full diversity after a large number of decoding iterations. Fulldiversity MDS low-density codes are not only useful for digital data transmission over wireless channels, some other applications can be found in situations where coding for a finite number of states is required.

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

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

U2 - 10.1109/ITA.2009.5044920

DO - 10.1109/ITA.2009.5044920

M3 - Conference contribution

SN - 9781424439904

SP - 34

EP - 43

BT - Information Theory and Applications Workshop, ITA 2009

ER -