Skip to main content
SpringerLink
Log in

A New Construction Method for Large Girth Quasi-Cyclic LDPC Codes with Optimized Lower Bound using Chinese Remainder Theorem

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

This paper presents a new construction algorithm of Quasi-cyclic low-density parity-check (QC-LDPC) codes of medium to large block-length by combining QC-LDPC codes of small block-length as their component codes, via Chinese remainder theorem. Such component codes were constructed by permuting each column block sequentially to attain the desire local girth. After combining all component codes to generate an expanded parity-check matrix, the resulting girth is greater than or at least equal to the highest girth of component codes. We investigate a lower bound for circulant permutation matrices in the proposed method, which provides efficient and fast encoding for a desired girth, and has very simple structure and more economical in terms of hardware implementation. As already proven, a high girth parameter of the parity-check matrix ensures a good error correcting performance. Thus, simulation results show that our proposed construction method of the parity-check matrix significantly outperforms the other well-known existing methods, has low error-floor, and can reduce encoding complexity for medium to large block-length QC-LDPC codes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Gallager, R. G. (1962). Low-density parity-check codes. IRE Transactions on Information Theory, 8(1), 21–28.

    Article  MathSciNet  MATH  Google Scholar 

  2. Tanner, R. M. (1981). A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 27(5), 533–547.

    Article  MathSciNet  MATH  Google Scholar 

  3. MacKay, D. J. C., & Neal, R. M. (1997). Near Shannon limit performance of low density parity check codes. Electronics Letters, 33(6), 457–458.

    Article  Google Scholar 

  4. Davey, M. C., & MacKay, D. J. (1998). Low density parity check codes over GF (q). In Proceedings of IEEE information theory workshop. (pp. 70–71). USA, June 1998.

  5. MacKay, D. J. (1999). Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory, 45(2), 399–431.

    Article  MathSciNet  MATH  Google Scholar 

  6. Fossorier, M. P. (2004). Quasicyclic low-density parity-check codes from circulant permutation matrices. IEEE Transactions on Information Theory, 50(8), 1788–1793.

    Article  MathSciNet  MATH  Google Scholar 

  7. Li, Z., & Kumar, B. V. (2004). A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph. In Proceedings of 38th Asilomar Conference on Signals, Systems and Computers, (Vol. 2, pp. 1190–1994). Pacific Grove, CA, USA, November 2004.

  8. Vasic, B., Pedagani, K., & Ivkovic, M. (2004). High-rate girth-eight low-density parity-check codes on rectangular integer lattices. IEEE Transactions on Communications, 52(8), 1248–1252.

    Article  Google Scholar 

  9. Lin, S., & Costello, D. J. (2004). Error control coding: fundamentals and applications, chapter 17, vol. 114, Englewood Cliffs: Pearson Prentice Hall.

  10. Zhang, J., & Zhang, G. (2014). Deterministic girth-eight QC-LDPC codes with large column weight. IEEE Communications Letters, 18(4), 656–659.

    Article  Google Scholar 

  11. Fan, J. L. (2001). Array codes as LDPC codes. In Constrained Coding and Soft Iterative Decoding, (pp. 195–203). Springer USA.

  12. Milenkovic, O., Kashyap, N., & Leyba, D. (2006). Shortened array codes of large girth. IEEE Transactions on Information Theory, 52(8), 3707–3722.

    Article  MathSciNet  MATH  Google Scholar 

  13. Eleftheriou, E., & Olcer, S. (2002). Low-density parity-check codes for digital subscriber lines. In Proceedings of IEEE international conference on communications, (Vol. 3, pp. 1752–1757). New York, USA, 2002.

  14. Singhaudom, W., Noppankeepong, S., & Suphithi, P. (2007). May. Design of high-rate modified array codes for magnetic recording system. In Proceedings of 4th international conference on electrical engineering/electronics, computer, telecommunications and information technology, (pp. 553–556). ECTI, Chiangrai, Thailand, 2007.

  15. Saadi, M., Bajpai, A., Zhao, Y., Sangwongngam, P., & Wuttisittikulkij, L. (2014). Design and Implementation of Secure and Reliable communication using optical wireless communication. Frequenz, 68(11–12), 501–509.

    Google Scholar 

  16. Zhang, Y., & Da, X. (2015). Construction of girth-eight QC-LDPC codes from arithmetic progression sequence with large column weight. Electronics Letters, 51(16), 1257–1259.

    Article  Google Scholar 

  17. Ranganathan, S. V., Divsalar, D., & Wesel, R. D. (2015). On the Girth of (3, L) Quasi-cyclic LDPC codes based on complete protographs. doi: 10.1109/ISIT.2015.7282491.

  18. Myung, S., & Yang, K. (2005). A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem. IEEE Communications Letters, 9(9), 823–825.

    Article  Google Scholar 

  19. Jiang, X., & Lee, M. H. (2009). Large girth quasi-cyclic LDPC codes based on the Chinese remainder theorem. IEEE Communications Letters, 13(5), 342–344.

    Article  MathSciNet  Google Scholar 

  20. Karimi, M., & Banihashemi, A. H. (2013). On the girth of quasi-cyclic protograph LDPC codes. IEEE Transactions on Information Theory, 59(7), 4542–4552.

    Article  MathSciNet  Google Scholar 

  21. Kim, K. J., Chung, J. H., & Yang, K. (2013). Bounds on the size of parity-check matrices for quasi-cyclic low-density parity-check codes. IEEE Transactions on Information Theory, 59(11), 7288–7298.

    Article  MathSciNet  Google Scholar 

  22. Hu, X. Y., Eleftheriou, E., & Arnold, D. M. (2005). Regular and irregular progressive edge-growth tanner graphs. IEEE Transactions on Information Theory, 51(1), 386–398.

    Article  MathSciNet  MATH  Google Scholar 

  23. Mahdi, A., & Paliouras, V. (2015). On the encoding complexity of quasi-cyclic LDPC codes. IEEE Transactions on Signal Processing, 63(22), 6096–6108.

    Article  MathSciNet  Google Scholar 

  24. Liu, Y., Wang, X., Chen, R., & He, Y. (2008). Generalized combining method for design of quasi-cyclic LDPC codes. IEEE Communications Letters, 12(5), 392–394.

    Article  Google Scholar 

  25. Oh, D., & Parhi, K. K. (2010). Low-complexity switch network for reconfigurable LDPC decoders. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 18(1), 85–94.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work is part of research fund allocated to Ambar Bajpai implemented within the framework from 90th year Chulalongkorn University scholarship.

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand

    Ambar Bajpai, Gan Srirutchataboon & Lunchakorn Wuttisittikulkij

  2. Data Storage Technology Research Center, Nakhon Pathom Rajabhat University, Nakhon Pathom, Thailand

    Piya Kovintavewat

Authors
  1. Ambar Bajpai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gan Srirutchataboon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Piya Kovintavewat
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lunchakorn Wuttisittikulkij
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Ambar Bajpai or Lunchakorn Wuttisittikulkij.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bajpai, A., Srirutchataboon, G., Kovintavewat, P. et al. A New Construction Method for Large Girth Quasi-Cyclic LDPC Codes with Optimized Lower Bound using Chinese Remainder Theorem. Wireless Pers Commun 91, 369–381 (2016). https://doi.org/10.1007/s11277-016-3465-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3465-8

Keywords

Search

Navigation