Abstract
Low-density parity-check (LDPC) codes have very good performance when they are decoded by iterative belief-propagation (BP) decoding algorithms and are widely used in many applications. However, the iterative decoding of LDPC codes has a huge complexity, especially for LDPC codes constructed over the nonbinary field GF(q). Traditionally, the iterative process is performed until the maximum number of iterations is reached or a codeword is found, which is unnecessary for undecodable code blocks. Hence, it is important to develop certain stopping criterion to identify these undecodable blocks and terminate the decoding process in advance. Based on the analysis of check-sum variations in the decoding process, a stopping criterion is proposed in this paper. Simulation results indicate the proposed criterion can greatly reduce the average number of iterations (ANI) over a wide range of signal-to-noise ratio (SNR) values, with little performance degradation compared with the traditional BP decoding.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory 8, 21–28 (1962)
MacKay, D.: Good error correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45, 399–431 (1999)
Davey, M.C., MacKay, D.: Low density parity check codes over GF(q). IEEE Commun. Lett. 2, 165–167 (1998)
Shin, D., Heo, K., Oh, S., Ha, J.: A stopping criterion for low-density parity-check codes. In Proceedings of IEEE 65th Vehicular Technology Conference, pp. 1529–1533 (2007)
Lin, C.-Y., Ku, M.-K.: Node operation reduced decoding for LDPC codes. In Proceedings of IEEE International Symposium on Circuits and Systems, pp. 896–899 (2009)
Han, G., Liu, X.: A unified early stopping criterion for binary and nonbinary LDPC codes based on check-sum variation patterns. IEEE Commun. Lett. 14, 1053–1055 (2010)
Wymeersch, H., Steendam, H., Moeneclaey, M.: Log-domain decoding of LDPC codes over GF(q). Proc. IEEE Int. Conf. Commun. 772–776 (2004)
Declercq, D., Fossorier, M.: Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Trans. Commun. 55, 633–643 (2007)
Acknowledgments
This work is sponsored by Huawei Innovation Research Program.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this paper
Cite this paper
Fan, W., Liu, H., Yang, W., Zhao, J., Jia, A.Z. (2016). A Stopping Criterion Based on Check-Sum Variations for Decoding Nonbinary LDPC Codes. In: Zeng, QA. (eds) Wireless Communications, Networking and Applications. Lecture Notes in Electrical Engineering, vol 348. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2580-5_38
Download citation
DOI: https://doi.org/10.1007/978-81-322-2580-5_38
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2579-9
Online ISBN: 978-81-322-2580-5
eBook Packages: EngineeringEngineering (R0)