This paper describes a combinatorial approach to estimate the error rate performance of low-density parity-check (LDPC) codes decoded by (quantized) soft-decision iterative decoding algorithms. The method is based on efficient enumeration of input vectors with small distances to a reference vector whose elements are selected to be the most reliable values from the input alphabet. Several techniques, including modified cycle enumeration, are employed to reduce the complexity of the enumeration. The error rate estimate is derived by testing the input vectors of small distances and estimating the contribution of larger distance vectors. We demonstrate by a number of examples that the proposed method provides accurate estimates of error rate with computational complexity much lower than that of Monte Carlo simulations, especially at the error floor region.

Additional Metadata
Persistent URL dx.doi.org/10.1109/ISIT.2008.4595024
Conference 2008 IEEE International Symposium on Information Theory, ISIT 2008
Citation
Xiao, H. (Hua), & Banihashemi, A. (2008). Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms. In IEEE International Symposium on Information Theory - Proceedings (pp. 439–443). doi:10.1109/ISIT.2008.4595024