Advertisement

On the search of smallest QC-LDPC code with girth six and eight

  • Jasvinder Singh
  • Manish GuptaEmail author
  • Jaskarn Singh Bhullar
Article
  • 17 Downloads

Abstract

In this paper, a new and simple method for the construction of Girth-6 (J,L) Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes is proposed. The method is further extended to the search of Girth-8 QC-LDPC codes with base matrices of order 3 × L and 4 × L. The construction is based on three different forms of exponent matrices and the parameters α, p, and q which satisfy the necessary algebraic conditions for a QC-LDPC code having girth 6 and 8. The proposed (J,L) QC-LDPC codes with girth at least six have optimal circulant permutation matrix (CPM) size for the cases where q = α + 1. Moreover, most of the girth-8 QC-LDPC codes searched by the proposed method have smaller CPM size than the existing codes of the same girth. In several cases, the method gives more than one exponent matrices for a code, as most of the existing methods cannot do so. Besides this, the proposed method not only search the QC-LDPC codes with smaller CPM size but also takes much less time than the existing search based methods to search code.

Keywords

Quasi-Cyclic Low-Density Parity-Check codes; Girth Circulant Permutation Matrix Exponent matrix 

MSC

94A24 

Notes

References

  1. 1.
    Gallager, R.G.: Low-density parity-check codes. IRE Transactions on Information Theory. 8(1), 21–28 (1962)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Mackay, D.J.C., Neal, R.M.: Near shannon limit performance of low density parity check codes. Electron. Lett. 32(18), 1645–1645 (1996)CrossRefGoogle Scholar
  3. 3.
    Berrou C., Glavieus A., Thitimajshima P.: Near shannon limit error-correcting coding and decoding: turbo-codes 1. IEEE International Conference on Communications. In: Proceeding of IEEE International Conference on Communications. (1993). 10.1109/icc.1993.397441Google Scholar
  4. 4.
    Myung, S., Yang, K.: A combining method of quasi-cyclic LDPC codes by the chinese remainder theorem. IEEE Commun. Lett. 9(9), 823–825 (2005)CrossRefGoogle Scholar
  5. 5.
    Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory. 27(5), 533–547 (1981)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Bajpai, A., Srirutchataboon, G., Kovintavewat, P.: Wuttisittikulkij L: A new construction method for large girth quasi-cyclic LDPC codes with optimized lower bound using chinese remainder theorem. Wirel. Pers. Commun. 91(1), 369–381 (2016)CrossRefGoogle Scholar
  7. 7.
    Gholami, M., Gholami, Z.: An explicit method to generate some QC-LDPC codes with girth 8. Iranian Journal of Science and Technology, Transactions A: Science. 40(2), 145–149 (2016)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Karimi, M., Banihashemi, A.H.: On the girth of quasi-cyclic protograph LDPC codes. IEEE Trans. Inf. Theory. 59(7), 4542–4552 (2013)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Mellinger, K.E.: LDPC codes from triangle-free line sets. Des. Codes Crypt. 32(1–3), 341–350 (2004)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Sakzad, A., Sadeghi, M., Panario, D.: Codes with girth 8 tanner graph representation. Des. Codes Crypt. 57(1), 71–81 (2010)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Tasdighi, A., Banihashemi, A.H., Sadeghi, M.R.: Efficient search of girth-optimal QC-LDPC codes. IEEE Trans. Inf. Theory. 62(4), 1552–1564 (2016)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Tasdighi, A., Banihashemi, A.H., Sadeghi, M.R.: Symmetrical constructions for regular girth-8 QC-LDPC codes. IEEE Trans. Commun. 65(1), 14–22 (2017)Google Scholar
  13. 13.
    Wang, Y., Yedidia, J.S., Draper, S.C.: Construction of high-girth QC-LDPC codes. In: Proceeding of 5th International Symposium on Turbo Codes and Related Topics (2007).  https://doi.org/10.1109/turbocoding.2008.4658694 CrossRefGoogle Scholar
  14. 14.
    Zhang, G., Sun, R., Wang, X.: Several explicit constructions for (3, L) QC-LDPC codes with girth at least eight. IEEE Commun. Lett. 17(9), 1822–1825 (2013)CrossRefGoogle Scholar
  15. 15.
    Zhang, J., Zhang, G.: Deterministic girth-eight QC-LDPC codes with large column weight. IEEE Communications Letters. 18(4), 656–659 (2014)CrossRefGoogle Scholar
  16. 16.
    Zhang, L., Li, B., Cheng, L.: Constructions of QC LDPC codes based on integer sequences. SCIENCE CHINA Inf. Sci. 57(6), 1–14 (2014)CrossRefGoogle Scholar
  17. 17.
    Fossorier, M.P.C.: Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inf. Theory. 50(8), 1788–1793 (2004)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Li, L., Li, H., Li, J., Jiang, H.: Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets. Optoelectron. Lett. 13(5), 358–362 (2017)CrossRefGoogle Scholar
  19. 19.
    O'sullivan, M.E.: Algebraic construction of sparse matrices with large girth. IEEE Trans. Inf. Theory. 52(2), 718–727 (2006)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Vandendriessche, P.: Some low-density parity-check codes derived from finite geometries. Des. Codes Crypt. 54(3), 287–297 (2010)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Yuan, J., Liang, M., Wang, Y., Lin, J., Pang, Y.: A novel construction method of QC-LDPC codes based on CRT for optical communications. Optoelectron. Lett. 12(3), 208–211 (2016)CrossRefGoogle Scholar
  22. 22.
    Zhang, G., Sun, R., Wang, X.: Construction of girth-eight QC-LDPC codes from greatest common divisor. IEEE Commun. Lett. 17(2), 369–372 (2013)CrossRefGoogle Scholar
  23. 23.
    Bocharova, I.E., Hug, F., Johannesson, R.: Searching for voltage graph-based LDPC tailbiting codes with large girth. IEEE Trans. Inf. Theory. 58(4), 2265–2279 (2012)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Kim, K.J., Chung, J.H., Yang, K.: Bounds on the size of parity-check matrices for quasi-cyclic low-density parity-check codes. IEEE Trans. Inf. Theory. 59(11), 7288–7298 (2013)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  • Jasvinder Singh
    • 1
    • 2
  • Manish Gupta
    • 2
    Email author
  • Jaskarn Singh Bhullar
    • 3
  1. 1.I.K.G. Punjab Technical UniversityJalandharIndia
  2. 2.Department of Applied SciencesBaba Farid College of Engineering and TechnologyBathindaIndia
  3. 3.Department of Applied SciencesMalout Institute of Management and Information TechnologyMaloutIndia

Personalised recommendations