Abstract
Quasi-cyclic (QC) LDPC codes whose parity-check matrices have diagonal structure play an important role in channel coding of 5G communications. In this paper, we study an algebraic-based method for constructing QC LDPC codes with diagonal structure of parity-check matrices. We first analyze the cycle structure of this class of QC LDPC codes and then divide the diagonal parity-check matrix into two parts, i.e., the diagonal matrix and the non-diagonal matrix. By employing the masking technique, we design the non-diagonal matrix based on prime field and QC LDPC codes with diagonal structure of parity-check matrices are proposed. Numerical results show that the constructed QC LDPC codes perform much better than the WiMAX-LDPC codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Gallager, R.: Low-density parity-check codes. IRE Trans. Inf. Theory 8, 21–28 (1962)
MacKay, D., Neal, R.: Near shannon limit performance of low density parity-check codes. Electron. Lett. 32, 1645–1646 (1996)
MacKay, D.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45, 399–431 (1999)
Ryan, W.E., Lin, S.: Channel Codes: Classical and Modern. Cambridge University Press, New York (2009)
Zhou, H., Li, Q., Tong, W., Kausar, S., Zhu, H.: P-Aware: a proportional multi-resource scheduling strategy in cloud data center. Clust. Comput. 19, 1089–1103 (2016)
Fossorier, M.P.C.: Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inf. Theory 50, 1788–1793 (2004)
Huang, Q., Diao, Q., Lin, S., Abdel-Ghaffar, K.: Cyclic and quasi-cyclic LDPC codes on constrained parity-check matrices and their trapping sets. IEEE Trans. Inf. Theory 58, 2648–2671 (2012)
Zhang, L., Lin, S., Abdel-Ghaffar, K., Zhou, B.: Circulant arrays: rank analysis and construction of quasi-cyclic LDPC codes. In: 2010 IEEE International Symposium on Information Theory, pp. 814–818. IEEE Press, New York (2010)
Li, J., Liu, K., Lin, S., Abdel-Ghaffar, K.: Quasi-cyclic LDPC codes on two arbitrary sets of a finite field. In: 2014 IEEE International Symposium on Information Theory, pp. 2454–2458. IEEE Press, New York (2014)
Digital Video Broadcasting (DVB), Europe Telecommunication Standards Institution (2009)
Short Block Length LDPC Codes for TC Synchronization and Channel Coding, CCSDS 231.1-O-1 (2015)
Zhang, P., Yu, S., Liu, C., Jiang, L.: Efficient encoding of QC-LDPC codes with multiple-diagonal parity-check structure. Electron. Lett. 50, 320–321 (2014)
Li, P., Leung, W.K., Phamdo, N.: Low density parity check codes with semi-random parity check matrix. Electron. Lett. 35, 38–39 (1999)
3GPP TSG RAN WG1 Meeting \(\sharp \)87: RAN1 Chairmans Notes (2016)
Air Interface for Fixed Broadband Wireless Access Systems, IEEE Standard P802.16e/D12 (2005)
Bocharova, I., Kudryashov, B., Johannesson, R.: Searching for binary and nonbinary block and convolutional LDPC codes. IEEE Trans. Inf. Theory 62, 163–183 (2016)
Zhang, L., Lin, S., Abdel-Ghaffar, K., Ding, Z., Zhou, B.: Quasi-cyclic LDPC codes on cyclic subgroups of finite fields. IEEE Trans. Commun. 59, 2330–2336 (2011)
Lan, L., Tai, Y., Lin, S., Memari, B., Honary, B.: New constructions of quasi-cyclic LDPC codes based on special classes of BIBD’s for the AWGN and binary erasure channels. IEEE Trans. Commun. 56, 39–48 (2008)
Falsafain, H., Esmaeili, M.: Construction of structured regular LDPC codes: a design-theoretic approach. IEEE Trans. Commun. 61, 1640–1647 (2013)
Xu, H., Feng, D., Sun, C., Bai, B.: Construction of LDPC codes based on resolvable group divisible designs. In: 2015 International Workshop on High Mobility Wireless Communications, pp. 111–115. IEEE Press, New York (2015)
Diao, Q., Tai, Y., Lin, S., Abdel-Ghaffar, K.: LDPC codes on partial geometries: construction, trapping set structure, and puncturing. IEEE Trans. Inf. Theory 59, 7898–7914 (2013)
Diao, Q., Li, J., Lin, S., Blake, I.F.: New classes of partial geometries and their associated LDPC codes. IEEE Trans. Inf. Theory 62, 2947–2965 (2016)
Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 533–547 (1981)
Tasdighi, A., Banihashemi, A.H., Sadeghi, M.: Efficient search of girth-optimal QC-LDPC codes. IEEE Trans. Inf. Theory 62, 1552–1564 (2016)
Zhao, S., Ma, X.: Construction of high-performance array-based non-binary LDPC codes with moderate rates. IEEE Commun. Lett. 20, 13–16 (2016)
Liu, Y., Li, Y.: Design of masking matrix for QC-LDPC codes. In: IEEE Information Theory Workshop, pp. 1–5. IEEE Press, New York (2013)
Xu, H., Feng, D., Luo, R., Bai, B.: Construction of quasi-cyclic LDPC codes via masking with successive cycle elimination. IEEE Commun. Lett. 20, 13–16 (2016)
Sun, C., Xu, H., Feng, D., Bai, B.: (3, L) Quasi-cyclic LDPC codes: simplified exhaustive search and designs. In: 2016 9th International Symposium on Turbo Codes and Iterative Information Processing, pp. 271–275. IEEE Press, New York (2016)
Acknowledgment
This work was supported in part by National Natural Science Foundation of China under Grants 61771364, 61701368, and 61103143, the Joint Funds of the National Natural Science Foundation of China under Grants U1504601 and U1404622, Key Scientific and Technological Project of Henan under Grants 162102310589 and 172102310124, Key Scientific Research Projects of Henan Educational Committee under Grant 18B510022, and the School-Based Program of Zhoukou Normal University under Grant ZKNUB2201705.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Xu, H., Li, H., Zhu, M., Zhang, B., Bai, B. (2018). Construction of Quasi-Cyclic LDPC Codes with Diagonal Structure of Parity-Check Matrices. In: Li, B., Shu, L., Zeng, D. (eds) Communications and Networking. ChinaCom 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 236. Springer, Cham. https://doi.org/10.1007/978-3-319-78130-3_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-78130-3_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-78129-7
Online ISBN: 978-3-319-78130-3
eBook Packages: Computer ScienceComputer Science (R0)