IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v81y2022i1d10.1007_s11235-022-00926-x.html
   My bibliography  Save this article

Finite field construction for quasi-cyclic LDPC convolutional codes with cyclic 2-D MDS codes

Author

Listed:
  • Ming Zhao

    (China Electronic Technology Group Corporation (CETC))

  • Zhipeng Liu

    (China Electronic Technology Group Corporation (CETC))

  • Ling Zhao

    (Beihang University)

Abstract

The parity-check matrices for quasi-cyclic low-density parity-check convolutional (QC-LDPC-C) codes have different characteristics of time-varying periodicity and need to realize fast encoding. The finite field construction method for QC-LDPC-C codes with cyclic two-dimensional maximum distance separable (2-D MDS) codes is proposed using the base matrix framework and matrix unwrapping, thus the constructed parity-check matrices are free of length-4 cycles. The unwrapped matrices are constructed respectively based on different cyclic 2-D MDS codes for the case of matrix period less than or greater than constraint block length, and construction examples are given. LDPC-C codes with different periodicity characteristics are compared with QC-LDPC-C codes constructed with the proposed method. Experimental results show that QC-LDPC-C codes with the proposed method outperform the other codes and have lower encoding and decoding complexity.

Suggested Citation

  • Ming Zhao & Zhipeng Liu & Ling Zhao, 2022. "Finite field construction for quasi-cyclic LDPC convolutional codes with cyclic 2-D MDS codes," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 81(1), pages 115-123, September.
    • Handle: RePEc:spr:telsys:v:81:y:2022:i:1:d:10.1007_s11235-022-00926-x
    DOI: 10.1007/s11235-022-00926-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-022-00926-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-022-00926-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:81:y:2022:i:1:d:10.1007_s11235-022-00926-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.