Diversity and coding gain evolution in graph codes Conference Paper uri icon

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. 2009 IEEE.

name of conference

  • 2009 Information Theory and Applications Workshop (ITA)

published proceedings

  • 2009 Information Theory and Applications Workshop

author list (cited authors)

  • Boutros, J. J.

citation count

  • 24

complete list of authors

  • Boutros, JJ

publication date

  • February 2009

publisher