Summary
International Symposium on Nonlinear Theory and its Applications
2009
Session Number:A1L-A
Session:
Number:A1L-A1
Constrained Scale-Free LDPC Codes
Xia Zheng, Francis C.M. Lau, Yejun He, Chi K. Tse,
pp.-
Publication Date:2009/10/18
Online ISSN:2188-5079
Summary:
Short-length scale-free low-density-parity-check (SF-LDPC) codes have been found to outperform codes optimized by the density-evolution technique. However, a large fraction of degree-2 variable nodes will exist in SF-LDPC codes when the code rate is high. Consequently, small-size cycles with no external connections can easily be created by these degree-2 nodes, producing a large error rate. In this paper, we propose constraining the proportion of degree-2 variable nodes in the design SF-LDPC codes. We will evaluate the error performance of the high-rate SF-LDPC codes under the new constraint.