View in EDS

Rate‐compatible systematic polar codes.

Saved in:
Bibliographic Details
Title: Rate‐compatible systematic polar codes.
Authors: Zhu, Hongfei1 zhuhongfei@pku.edu.cn, Guan, Pengxin1, Cao, Zhiwei1, Zhao, Yuping1
Source: IET Communications (Wiley-Blackwell). Sep2021, Vol. 15 Issue 15, p1930-1940. 11p.
Subjects: Maximum likelihood decoding, Maximum likelihood statistics, Bit error rate, Data transmission systems, Algorithms
Abstract: Puncturing and shortening are two common ways to achieve rate‐compatible non‐systematic polar codes (NSPCs). Systematic polar codes (SPCs) have been shown to outperform NSPCs with the same encoding and decoding complexity. However, rate‐compatible SPCs have never been comprehensively studied in previous work. In this paper, two rate‐compatible algorithms for SPCs are first proposed: uniform puncturing (UP) algorithm and uniform shortening (US) algorithm, which are referred to as SPC‐UP and SPC‐US, respectively. In order to effectively estimate the maximum likelihood decoding performance of punctured and shortened polar codes, subsequently, a distance spectrum calculation algorithm based on successive cancellation list (SCL) decoder for rate‐compatible polar codes is proposed. Simulation results show that rate‐compatible SPCs yield better bit error rate performance than rate‐compatible NSPCs while they have the same frame error rate performance under different code rates and decoding algorithms. Eventually, union bounds that are obtained by the distance spectrum to provide the theoretical explanation for the superiority of rate‐compatible SPCs are utilised. [ABSTRACT FROM AUTHOR]
Copyright of IET Communications (Wiley-Blackwell) is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 152211026
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Rate‐compatible systematic polar codes.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zhu%2C+Hongfei%22">Zhu, Hongfei</searchLink><relatesTo>1</relatesTo><i> zhuhongfei@pku.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Guan%2C+Pengxin%22">Guan, Pengxin</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Cao%2C+Zhiwei%22">Cao, Zhiwei</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Zhao%2C+Yuping%22">Zhao, Yuping</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IET+Communications+%28Wiley-Blackwell%29%22">IET Communications (Wiley-Blackwell)</searchLink>. Sep2021, Vol. 15 Issue 15, p1930-1940. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Maximum+likelihood+decoding%22">Maximum likelihood decoding</searchLink><br /><searchLink fieldCode="DE" term="%22Maximum+likelihood+statistics%22">Maximum likelihood statistics</searchLink><br /><searchLink fieldCode="DE" term="%22Bit+error+rate%22">Bit error rate</searchLink><br /><searchLink fieldCode="DE" term="%22Data+transmission+systems%22">Data transmission systems</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Puncturing and shortening are two common ways to achieve rate‐compatible non‐systematic polar codes (NSPCs). Systematic polar codes (SPCs) have been shown to outperform NSPCs with the same encoding and decoding complexity. However, rate‐compatible SPCs have never been comprehensively studied in previous work. In this paper, two rate‐compatible algorithms for SPCs are first proposed: uniform puncturing (UP) algorithm and uniform shortening (US) algorithm, which are referred to as SPC‐UP and SPC‐US, respectively. In order to effectively estimate the maximum likelihood decoding performance of punctured and shortened polar codes, subsequently, a distance spectrum calculation algorithm based on successive cancellation list (SCL) decoder for rate‐compatible polar codes is proposed. Simulation results show that rate‐compatible SPCs yield better bit error rate performance than rate‐compatible NSPCs while they have the same frame error rate performance under different code rates and decoding algorithms. Eventually, union bounds that are obtained by the distance spectrum to provide the theoretical explanation for the superiority of rate‐compatible SPCs are utilised. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IET Communications (Wiley-Blackwell) is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=152211026
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1049/cmu2.12204
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 1930
    Subjects:
      – SubjectFull: Maximum likelihood decoding
        Type: general
      – SubjectFull: Maximum likelihood statistics
        Type: general
      – SubjectFull: Bit error rate
        Type: general
      – SubjectFull: Data transmission systems
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Rate‐compatible systematic polar codes.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zhu, Hongfei
      – PersonEntity:
          Name:
            NameFull: Guan, Pengxin
      – PersonEntity:
          Name:
            NameFull: Cao, Zhiwei
      – PersonEntity:
          Name:
            NameFull: Zhao, Yuping
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2021
              Type: published
              Y: 2021
          Identifiers:
            – Type: issn-print
              Value: 17518628
          Numbering:
            – Type: volume
              Value: 15
            – Type: issue
              Value: 15
          Titles:
            – TitleFull: IET Communications (Wiley-Blackwell)
              Type: main
ResultId 1