Short Regular Girth-8 QC-LDPC Codes From Exponent Matrices with Vertical Symmetry (2404.14962v1)
Abstract: To address the challenge of constructing short girth-8 quasi-cyclic (QC) low-density parity-check (LDPC) codes, a novel construction framework based on vertical symmetry (VS) is proposed. Basic properties of the VS structure are presented. With the aid of these properties, existing explicit constructions for column weights from three to five which can be transformed into the VS structure are sorted out. Then two novel explicit constructions with the VS structure which guarantee short codes are presented for column weights of three and six. Moreover, an efficient search-based method is also proposed to find short codes with the VS structure. Compared with the state-of-the-art benchmarks, both the explicit constructions and the search-based method presented in this paper can provide shorter codes for most cases. Simulation results show that the new shorter codes can perform almost the same as or better than the longer existing counterparts. Thus, the new shorter codes can fit better with the low-latency requirement for modern communication systems.
- R. M. Tanner, D. Sridhara, and T. E. Fuja, “A class of group-structured LDPC codes,” in Proc. Int. Symp. Commun. Theory and Applications, pp. 1-5, Ambleside, U.K., Jul. 2001.
- M. P. C. Fossorier, “Quasi-cyclic low-density parity-check codes from circulant permutation matrices,” IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
- L. Song, S. Yu, and Q. Huang, “Low-density parity-check codes: highway to channel capacity,” China Commun., vol. 20, no. 2, pp. 235-256, Feb. 2023.
- I. Kim and H.-Y. Song, “A simple construction for QC-LDPC codes of short lengths with girth at least 8,” in 2020 International Conference on Information and Communication Technology Convergence (ICTC), pp. 1462-1465, Jeju, Korea(South), 21-23 Oct. 2020.
- I. Kim, T. Kojima, and H.-Y. Song, “Some short-length girth-8 QC-LDPC codes from primes of the form t2+1superscript𝑡21t^{2}+1italic_t start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT + 1,” IEEE Commun. Lett., vol. 26, no. 6, pp. 1211-1215, Jun. 2022.
- I. Kim and H.-Y. Song, “A construction for girth-8 QC-LDPC codes using Golomb rulers,” Electron. Lett., vol. 58, no. 15, pp. 582-584, Jul. 2022.
- A. Gómez-Fonseca, R. Smarandache, and D. G. M. Mitchell, “A low complexity PEG-like algorithm to construct quasi-cyclic LDPC codes,” in 12th International Symposium on Topics in Coding (ISTC), pp. 1-5, Brest, France, 04-08 Sept. 2023.
- H. Chimal-Dzul and A. Gómez-Fonseca, “Using partial orthomorphisms to construct short quasi-cyclic LDPC codes with girth at least 6,” in 2023 12th International Symposium on Topics in Coding (ISTC), pp. 1-5, Brest, France, 04-08 Sept. 2023.
- A. Gómez-Fonseca, R. Smarandache, and D. G. M. Mitchell, “An efficient strategy to count cycles in the Tanner graph of quasi-cyclic LDPC codes,” IEEE J. Sel. Area. Inf. Theory, vol. 4, pp. 499-513, Sept. 2023.
- F. Amirzade, M.-R. Sadeghi, and D. Panario, “Construction of protograph-based LDPC codes with chordless short cycles,” IEEE Trans. Inf. Theory, vol. 70, no. 1, pp. 51-74, Jan. 2024.
- H. Li, H. Xu, C. Chen, and B. Bai, “Efficient construction of quasi-cyclic LDPC codes with multiple lifting sizes,” IEEE Commun. Lett., vol. 28, no. 4, pp. 754-758, Apr. 2024.
- Y. Zhang and X. Da, “Construction of girth-eight QC-LDPC codes from arithmetic progression sequence with large column weight,” Electron. Lett., vol. 51, no. 16, pp. 1257-1259, Aug. 2015.
- M. Majdzade and M. Gholami, “On the class of high-rate QC-LDPC codes with girth 8 from sequences satisfied in GCD condition,” IEEE Commun. Lett., vol. 24, no. 7, pp. 1391-1394, Jul. 2020.
- J. Wang, J. Zhang, Q. Zhou, and L. Zhang, “Full-length row-multiplier QC-LDPC codes with girth eight and short circulant sizes,” IEEE Access, vol. 11, pp. 22250-22265, Mar. 2023.
- A. Tasdighi, A. H. Banihashemi, and M.-R. Sadeghi, “Symmetrical constructions for regular girth-8 QC-LDPC codes,” IEEE Trans. Commun., vol. 65, no. 1, pp. 14-22, Jan. 2017.
- A. Tasdighi and E. Boutillon, “Integer ring sieve for constructing compact QC-LDPC codes with girths 8, 10, and 12,” IEEE Trans. Inf. Theory, vol. 68, no. 1, pp. 35-46, Jan. 2022.
- A. Kharin, A. Dryakhlov, E. Mirokhin, K. Zavertkin, A. Ovinnikov, and E. Likhobabin, “An approach to the generation of regular QC-LDPC codes with girth 8,” in Proc. 9th Medit. Conf. Embedded Comput. (MECO), pp. 1-4, Budva, Montenegro, 08-11 Jun. 2020.
- B. Vasic, K. Pedagani, and M. Ivkovic, “High-rate girth-eight low-density parity-check codes on rectangular integer lattices,” IEEE Trans. Commun., vol. 52, no. 8, pp. 1248-1252, Aug. 2004.
- G. Zhang, R. Sun, and X. Wang, “Explicit construction of girth-eight QC-LDPC codes and its application in CRT method,” J. Commun., vol. 33, no. 3, pp. 171-176, Mar. 2012. (in Chinese).
- G. Zhang, Y. Hu, Y. Fang, and J. Wang, “Constructions of type-II QC-LDPC codes with girth eight from Sidon sequence,” IEEE Trans. Commun., vol. 67, no. 6, pp. 3865-3878, Jun. 2019.
- L. Zhang and J. Wang, “Construction of QC-LDPC codes from Sidon sequence using permutation and segmentation,” IEEE Commun. Lett., vol. 26, no. 8, pp. 1710-1714, Aug. 2022.
- G. Zhang, R. Sun, and X. Wang, “Construction of girth-eight QC-LDPC codes from greatest common divisor,” IEEE Commun. Lett., vol. 17, no. 2, pp. 369-372, Feb. 2013.
- J. Zhang and G. Zhang, “Deterministic girth-eight QC-LDPC codes with large column weight,” IEEE Commun. Lett., vol. 18, no. 4, pp. 656-659, Apr. 2014.
- G. Zhang, Y. Fang, and Y. Liu, “Automatic verification of GCD constraint for construction of girth-eight QC-LDPC codes,” IEEE Commun. Lett., vol. 23, no. 9, pp. 1453-1456, Sept. 2019.
- G. Zhang, H. Liu, M. Lou, and Y. Fang, “Constructions of girth-eight QC-LDPC codes with dual-diagonal structure based on GCD framework,” in 2023 International Conference on Wireless Communications and Signal Processing (WCSP), pp. 269-274, Hangzhou, China, 02-04 Nov. 2023.
- G. Zhang, M. Ni, Y. Hu, and Y. Yang, “Quasi-cyclic LDPC codes with girth at least eight based on disjoint difference sets,” IEEE Commun. Lett., vol. 27, no. 1, pp. 55-59, Jan. 2023.