Skip to main content
SpringerLink
Log in

Improved construction of LDPC convolutional codes with semi-random parity-check matrices

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

In this paper, we investigate the construction of time-varying convolutional low-density paritycheck (LDPC) codes derived from block LDPC codes based on improved progressive edge growth (PEG) method. Different from the conventional PEG algorithm, the parity-check matrix is initialized by inserting certain patterns. More specifically, the submatrices along the main diagonal are fixed to be the identity matrix that ensures the fast encoding feature of the LDPC convolutional codes. Second, we insert a nonzero pattern into the secondary diagonal submatrices that ensures the encoding memory length of the time-varying LDPC convolutional codes as large as possible. With this semi-random structure, we have analyzed the code performance by evaluating the number of short cycles as well as the the bound of free distance. Simulation results show that the constructed LDPC convolutional codes perform well over additive white Gaussian noise (AWGN) channels.

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

Similar content being viewed by others

References

  1. Gallager R G. Low-density parity-check codes. IRE Trans Inform Theory, 1962, IT-8: 21–28

    Article  MathSciNet  Google Scholar 

  2. Wiberg N. Codes and decoding on general graphs. Dissertation for the Doctoral Degree. Sweden: Linkoping University, 1996. 7–10

    Google Scholar 

  3. MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes. Electron Lett, 1996, 32: 1645–1646

    Article  Google Scholar 

  4. Tanner R M. Error-correcting codes system. US: Patent 4295218, 1981

    Google Scholar 

  5. Felström A J, Zigangirov K S. Time-varying periodic convolutional codes with low-density parity-check matrix. IEEE Trans Inform Theory, 1999, 45: 2181–2191

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen Z G, Bates S. Construction of low-density parity-check convolutional codes through progressive edge-growth. IEEE Commun Lett, 2005, 9: 1058–1060

    Article  Google Scholar 

  7. Pusane A E, Zigangirov K Sh, Costello D J, et al. Construction of irregular LDPC convolutional codes with fast encoding. In: Proceedings of IEEE International Conference on Communications, Istanbul, 2006. 1160–1165

  8. Pusane A E, Smarandache R, Vontobel P O, et al. Deriving good LDPC convolutional codes from LDPC block codes. IEEE Trans Inform Theory, 2011, 57: 835–857

    Article  MathSciNet  Google Scholar 

  9. Richardson T J, Shokrollahi M A, Urbanke R L. Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans Inform Theory, 2001, IT-47: 619–637

    Article  MathSciNet  Google Scholar 

  10. Halford T R, Chugg K M. An algorithm for counting short cycles in bipartite graphs. IEEE Trans Inform Theory, 2006, 52: 287–292

    Article  MathSciNet  Google Scholar 

  11. Hu X Y, Fossorier M P C, Eleftheriou E. On the computation of the minimum distance of low-density parity-check codes. In: Proceedings of IEEE International Conference on Communications, Paris, 2004. 767–771

    Google Scholar 

  12. Massey J L. Threshold Decoding. Cambridge: MIT Press, 1963. 15–22

    Google Scholar 

  13. Wozencraft J M, Reiffen B. Sequential Decoding. New York: Technology Press of Massachusetts Institute of Technology and John Wiley, 1961. 18–35

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Sun Yat-sen University, Guangzhou, 510006, China

    LiWei Mu, XingCheng Liu & ChuLong Liang

  2. School of Physics and Telecommunication Engineering, South China Normal University, Guangzhou, 510006, China

    LiWei Mu

  3. State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an, 710071, China

    LiWei Mu, XingCheng Liu & ChuLong Liang

  4. Laboratory of Quantum Engineering and Quantum Materials, School of Physics and Telecommunication Engineering, South China Normal University, Guangzhou, 510006, China

    LiWei Mu

Authors
  1. LiWei Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. XingCheng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. ChuLong Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to XingCheng Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mu, L., Liu, X. & Liang, C. Improved construction of LDPC convolutional codes with semi-random parity-check matrices. Sci. China Inf. Sci. 57, 1–10 (2014). https://doi.org/10.1007/s11432-013-5049-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-013-5049-5

Keywords

Search

Navigation