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

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