IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v82y2023i4d10.1007_s11235-023-00996-5.html
   My bibliography  Save this article

Puncturing scheme for polar codes based on channel reliability estimation

Author

Listed:
  • Tianwei Han

    (Jilin University)

  • Meiyu Fu

    (Jilin University)

  • Meiling Zhang

    (Jilin University)

  • Guijun Hu

    (Jilin University)

Abstract

The compiled code algorithms for polar codes, which were proposed by Arikan, are of low complexity, with excellent performance for a given code length when using optimized decoding algorithms. They have attracted widespread attention and gained popularity since its inception. The construction of punctured polar codes allows for more flexibility in coding, making them suitable for a greater variety of scenarios. This paper proposes an improved puncturing scheme for polar codes. With the constraints imposed by conventional punctured polar codes, the error probability of each polarized sub-channel is then calculated on the basis of the channel reliability estimation methodology, so as to puncture the less reliable polarized sub-channels. Furthermore, to achieve better decoding performance, this scheme sets the initial log-likelihood rate (LLR) of the punctured bits to infinity (or negative infinity). The simulation outcomes indicate that the improved punctured polar codes as proposed in this paper perform better than the conventional punctured polar codes.

Suggested Citation

  • Tianwei Han & Meiyu Fu & Meiling Zhang & Guijun Hu, 2023. "Puncturing scheme for polar codes based on channel reliability estimation," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 82(4), pages 499-508, April.
    • Handle: RePEc:spr:telsys:v:82:y:2023:i:4:d:10.1007_s11235-023-00996-5
    DOI: 10.1007/s11235-023-00996-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-023-00996-5
    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-023-00996-5?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:82:y:2023:i:4:d:10.1007_s11235-023-00996-5. 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.