Research on stopping criterion for irregular LDPC codes decoding

Authors:
Changhao Zhai;Chengxin Xu;Xin Zhang;Yafeng Wang
Affiliations:
Beijing University of Posts and Telecommunications, Beijing, P. R. China;Beijing University of Posts and Telecommunications, Beijing, P. R. China;Beijing University of Posts and Telecommunications, Beijing, P. R. China;Beijing University of Posts and Telecommunications, Beijing, P. R. China
Venue:
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Year:
2009

Citing 5
Cited 0

Analysis of low density codes and improved designs using irregular graphs

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Iterative decoding of binary block and convolutional codes

IEEE Transactions on Information Theory
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an improved stopping criterion for irregular LDPC decoding is proposed. This scheme considers the decoding property of irregular LDPC codes. When the lowest degree variable nodes reach stable state, the decoder gets the final decoding result. Therefore, the improved criterion is based on the convergence of the mean magnitude of the log-likelihood ratio (LLR) information of the lowest degree variable nodes at the output of each decoding iteration. Compared with existing schemes, this scheme decreases average number of iterations (ANI) and reduces computation complexity under slight performance degradation.