In this paper, we investigate the performance of the belief propagation (BP) algorithm for decoding low-density parity-check codes over the additive white Gaussian noise channel when there is an incorrect estimate of the channel signal-to-noise ratio (SNR) (referred to as "SNR mismatch") at the decoder. At the extremes for over- and underestimation of SNR, the performance of BP tends to that of min-sum algorithm and the channel bit-error rate, respectively. Our results for regular codes indicate that the sensitivity to mismatch increases by increasing the variable-node degree and by decreasing the check-node degree. The effect of variable-node degree, however, appears to be more profound, such that at a given rate, the codes with the smallest variable and check degrees are more robust against SNR mismatch. For irregular codes, by comparing the thresholds of a few ensembles, we demonstrate that the ensemble which performs better in the absence of mismatch can perform worse in the presence of it. To obtain our asymptotic results, we propose a computationally efficient method based on the Gaussian approximation of density evolution in the presence of SNR mismatch. We also show that the asymptotic results are consistent with simulation results for codes with finite block lengths.

Additional Metadata
Keywords Belief propagation (BP), Density evolution (DE), Gaussian approximation (GA), Low-density parity-check (LDPC) codes, Min-sum, Signal-to-noise ratio (SNR) estimation error, SNR mismatch, SNR threshold
Persistent URL dx.doi.org/10.1109/TCOMM.2006.887488
Journal IEEE Transactions on Communications
Citation
Saeedi, H. (Hamid), & Banihashemi, A. (2007). Performance of belief propagation for decoding LDPC codes in the presence of channel estimation error. IEEE Transactions on Communications, 55(1), 83–89. doi:10.1109/TCOMM.2006.887488