Abstract
Row-column (RC) constraint structure plays an important role in the design of LDPC codes. In this paper, we study the construction of quasi-cyclic (QC) LDPC codes based on RC-constrained matrices. We first analyze the relation between the cycles and the exponent matrix of a QC LDPC code, and present a method to design the exponent matrices for a given degree distribution and an expansion factor k. By dispersing every element of the exponent matrix into circulant permutation matrix (CPM) or zero matrix (ZM) of size k × k, a QC LDPC code is obtained. Numerical simulation results show that our constructed QC LDPC codes have fast convergence of iterative decoding and good performance over the AWGN channel.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21–28 (1962)
Diao, Q., Li, J., Lin, S., Blake, I.F.: New classes of partial geometries and their associated LDPC codes. IEEE Trans. Inf. Theory 62(6), 2947–2965 (2016)
CCSDS 231.1-O-1. Short Block Length LDPC Codes for TC Synchronization and Channel Coding. Washington DC (2015)
Fossorier, M.P.C.: Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inf. Theory 50(8), 1788–1794 (2004)
Khodaiemehr, H., Kiani, D.: Construction and encoding of QC-LDPC codes using group rings. IEEE Trans. Inf. Theory 63(4), 2039–2060 (2017)
Li, Z., Chen, Z.L., Lin, S., Fong, W.H.: Efficient encoding of quasi-cyclic low-density parity-check codes. IEEE Trans. Commun. 54(1), 71–81 (2006)
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(5), 2648–2671 (2012)
Zhang, L., Lin, S., Abdel-Ghaffar, K., Zhou, B.: Circulant arrays: Rank analysis and construction of quasi-cyclic LDPC codes. In: IEEE International Symposium on Information Theory 2010, pp. 814–818 (2010)
Li, J., Liu, K., Lin, S., Abdel-Ghaffar, K.: Quasi-cyclic LDPC codes on two arbitrary sets of a finite field. In: IEEE International Symposium on Information Theory 2014, pp. 2454–2458 (2014)
Li, J., Liu, K., Lin, S., Abdel-Ghaffar, K., Ryan, W.: An unnoticed strong connection between algebraic-based and protograph-based LDPC codes, Part I: binary case and interpretation. In: Information Theory and Applications Workshop (ITA) 2015, pp. 36–45 (2015)
Mitchell, D.G.M., Smarandache, R., Costello, D.J.: Quasi-cyclic LDPC codes based on pre-lifted protographs. IEEE Trans. Inf. Theory 60(10), 5856–5874 (2014)
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 channels. IEEE Trans. Commun. 56(1), 39–48 (2008)
Xu, H., Feng, D., Sun, C., Bai, B.: Construction of LDPC codes based on resolvable group divisible designs. IEEE International Workshop on High Mobility Wireless Communications 2015, 111–115 (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(12), 7898–7914 (2013)
Song, S., Zhou, B., Lin, S., Abdel-Ghaffar, K.: A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields. IEEE Trans. Commun. 57(1), 84–93 (2009)
Bocharova, I., Kudryashov, B., Johannesson, R.: Searching for binary and nonbinary block and convolutional LDPC codes. IEEE Trans. Inf. Theory 62(1), 163–183 (2016)
Mackay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45(2), 399–431 (1999)
Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27(5), 533–547 (1981)
Xu, H., Feng, D., Luo, R., Bai, B.: Construction of quasi-cyclic LDPC codes via masking with successive cycle elimination. IEEE Commun. Lett. 20(12), 2370–2373 (2016)
Tasdighi, A., Banihashemi, A.H., Sadeghi, M.: Efficient search of girth-optimal QC-LDPC codes. IEEE Trans. Inf. Theory 62(4), 1552–1564 (2016)
Liu, Y., Li, Y.: Design of masking matrix for QC-LDPC codes. In: IEEE Information Theory Workshop (ITW) 2013, pp. 1–5 (2013)
Ryan, W.E., Lin, S.: Channel codes: Classical and Modern, pp. 452–453. Cambridge University Press, USA (2009)
Hu, Y., Eleftheriou, E., Arnold, D.M.: Regular and irregular progressive edge growth Tanner graphs. IEEE Trans. Inf. Theory 51(1), 386–398 (2005)
Huang, Q., Kang, J., Zhang, L., Lin, S., Abdel-Ghaffar, K.: Two reliability-based iterative majority-logic decoding algorithms for LDPC codes. IEEE Trans. Commun. 57(12), 3597–3606 (2009)
Acknowledgements
This work was supported in part by National Natural Science Foundation of China under Grants 61372074, 91438101, 61771364, 61103143, U1404622, and U1504601, Key Scientific and Technological Project of Henan under Grants 162102310589 and 172102310124, Key Scientific Research Projects of Henan Educational Committee under Grants 16A520105 and 18B510022, and 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 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Xu, H., Bai, B., Zhu, H., Xu, M., Zhang, B. (2018). Quasi-Cyclic LDPC Codes Constructed Based on Row-Column Constrained Matrices. In: Yu, Q. (eds) Space Information Networks. SINC 2017. Communications in Computer and Information Science, vol 803. Springer, Singapore. https://doi.org/10.1007/978-981-10-7877-4_27
Download citation
DOI: https://doi.org/10.1007/978-981-10-7877-4_27
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7876-7
Online ISBN: 978-981-10-7877-4
eBook Packages: Computer ScienceComputer Science (R0)