On Iterative Performance of LDPC and Root-LDPC Codes over Block-Fading Channels Conference Paper uri icon

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. ©2010 IEEE.

author list (cited authors)

  • Andriyanova, I., Biglieri, E., & Boutros, J. J.

citation count

  • 3

publication date

  • September 2010

publisher