On asymptotic ensemble weight enumerators of LDPC-like codes

  • Authors:
  • Chung-Li Wang;Marc P. C. Fossorier

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of California, Davis, CA;ETIS Laboratory, Cergy Pontoise, France

  • Venue:
  • IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

For LDPC-like codes such as LDPC, GLDPC, and DGLDPC codes, it is well known that the error floor can be caused by the codewords of small weights or stopping sets of small sizes. In this paper, we investigate the computation of asymptotic weight enumerators such that it becomes a convenient tool to determine a good distribution of code ensembles. In addition, by analyzing the first order approximation, we derive a condition to obtain a negative asymptotic growth rate of the codewords of small linear-sized weights, which is an important constraint for distribution optimization. Also the weight enumerators of turbo and repeat-accumulate codes are investigated. Furthermore, we extend our results to nonbinary DGLDPC codes. Generalization to N-layer and convolutional code based LDPC-like codes are also developed.