A method for estimating the performance of low-density parity-check (LDPC) codes decoded by hard-decision iterative decoding algorithms on binary symmetric channels (BSCs) is proposed. Based on the enumeration of the smallest weight error patterns that cannot be all corrected by the decoder, this method estimates both the frame error rate (FER) and the bit error rate (BER) of a given LDPC code with very good precision for all crossover probabilities of practical interest. Through a number of examples, we show that the proposed method can be effectively applied to both regular and irregular LDPC codes and to a variety of hard-decision iterative decoding algorithms. Compared with the conventional Monte Carlo simulation, the proposed method has a much smaller computational complexity, particularly for lower error rates.

Additional Metadata
Keywords Binary symmetric channels (BSC), Error floor, Finite-length low-density parity-check (LDPC) codes, Hard-decision decoding algorithms, Iterative decoding, LDPC codes
Persistent URL dx.doi.org/10.1109/TCOMM.2007.910589
Journal IEEE Transactions on Communications
Citation
Xiao, H. (Hua), & Banihashemi, A. (2007). Estimation of bit and frame error rates of finite-length low-density parity-check codes on binary symmetric channels. IEEE Transactions on Communications, 55(12), 2234–2239. doi:10.1109/TCOMM.2007.910589