A Low Complexity Encoding Algorithm for Systematic Polar Codes

Arıkan has shown that systematic polar codes (SPC) outperform non-SPC (NSPC). However, the performance gain comes at the price of elevated encoding complexity, i.e., compared with NSPC, the available encoding methods for SPC require higher memory and computation. In this letter, we propose an effici...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 20; no. 7; pp. 1277 - 1280
Main Authors: Chen, Guo Tai, Zhang, Zhaoyang, Zhong, Caijun, Zhang, Liang
Format: Journal Article
Language:English
Published: New York IEEE 01.07.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Complexity
Complexity theory
Computation
Decoding
Electronic mail
Encoding
encoding algorithm
Gain
Indexes
Mathematical models
Memory management
parallel encoding
Polar codes
systematic polar codes
Systematics
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Arıkan has shown that systematic polar codes (SPC) outperform non-SPC (NSPC). However, the performance gain comes at the price of elevated encoding complexity, i.e., compared with NSPC, the available encoding methods for SPC require higher memory and computation. In this letter, we propose an efficient encoding algorithm requiring only N bits of memory and having (N/2)log 2 N XOR operations. Moreover, the auxiliary variables in the algorithm can share the memory to reduce extra memory requirement. Furthermore, a parallel 2-bit encoding algorithm is also presented to improve the encoding throughput. Remarkably, we show that parallel encoding can be implemented with the same number of XOR operations and memory bits. Finally, the proposed encoding algorithm can be directly used for NSPC with the same complexity.
AbstractList Arikan has shown that systematic polar codes (SPC) outperform non-SPC (NSPC). However, the performance gain comes at the price of elevated encoding complexity, i.e., compared with NSPC, the available encoding methods for SPC require higher memory and computation. In this letter, we propose an efficient encoding algorithm requiring only [Formula Omitted] bits of memory and having [Formula Omitted] XOR operations. Moreover, the auxiliary variables in the algorithm can share the memory to reduce extra memory requirement. Furthermore, a parallel 2-bit encoding algorithm is also presented to improve the encoding throughput. Remarkably, we show that parallel encoding can be implemented with the same number of XOR operations and memory bits. Finally, the proposed encoding algorithm can be directly used for NSPC with the same complexity.
Arıkan has shown that systematic polar codes (SPC) outperform non-SPC (NSPC). However, the performance gain comes at the price of elevated encoding complexity, i.e., compared with NSPC, the available encoding methods for SPC require higher memory and computation. In this letter, we propose an efficient encoding algorithm requiring only N bits of memory and having (N/2)log 2 N XOR operations. Moreover, the auxiliary variables in the algorithm can share the memory to reduce extra memory requirement. Furthermore, a parallel 2-bit encoding algorithm is also presented to improve the encoding throughput. Remarkably, we show that parallel encoding can be implemented with the same number of XOR operations and memory bits. Finally, the proposed encoding algorithm can be directly used for NSPC with the same complexity.
Arikan has shown that systematic polar codes (SPC) outperform non-SPC (NSPC). However, the performance gain comes at the price of elevated encoding complexity, i.e., compared with NSPC, the available encoding methods for SPC require higher memory and computation. In this letter, we propose an efficient encoding algorithm requiring only $N$ bits of memory and having $({N}/{2})\log _{2}N$ XOR operations. Moreover, the auxiliary variables in the algorithm can share the memory to reduce extra memory requirement. Furthermore, a parallel 2-bit encoding algorithm is also presented to improve the encoding throughput. Remarkably, we show that parallel encoding can be implemented with the same number of XOR operations and memory bits. Finally, the proposed encoding algorithm can be directly used for NSPC with the same complexity.
Author Caijun Zhong
Liang Zhang
Zhaoyang Zhang
Guo Tai Chen
Author_xml – sequence: 1
  givenname: Guo Tai
  surname: Chen
  fullname: Chen, Guo Tai
– sequence: 2
  givenname: Zhaoyang
  surname: Zhang
  fullname: Zhang, Zhaoyang
– sequence: 3
  givenname: Caijun
  surname: Zhong
  fullname: Zhong, Caijun
– sequence: 4
  givenname: Liang
  surname: Zhang
  fullname: Zhang, Liang
BookMark eNp9kD1PwzAQhi1UJErhD8ASiYUlxefEib0gVVX5kFIVie5WYjvFVRIXOxX03-PSiqEDy90Nz3O6ey_RoLOdRugG8BgA84diupjPxwRDNiY0C42foSFQymISyiDMmPE4zzm7QJferzHGjFAYosdJVNivaGrbTaO_Tb-LZp20ynSraNKsrDP9RxvV1kXvO9_rtuyNjN5sU7qgKO2v0HldNl5fH_sILZ9my-lLXCyeX6eTIpYJYX2sKqVxKQnIDDMWzkgYyRUwmnIOtKqU1FUGmhFc66QCVRPFKsxSIJxVqUpG6P6wduPs51b7XrTGS900Zaft1gsIz9CMMICA3p2ga7t1XTguUDjhaZrRNFDsQElnvXe6FtL04Tnb9a40jQAs9rmK31zFPldxzDWo5ETdONOWbve_dHuQjNb6T8jTjBCcJD9d_4Qq
CODEN ICLEF6
CitedBy_id crossref_primary_10_1109_ACCESS_2018_2871834
crossref_primary_10_1109_TCOMM_2016_2576448
crossref_primary_10_1109_LWC_2019_2898195
crossref_primary_10_1007_s11431_020_1630_2
crossref_primary_10_1109_COMST_2019_2937923
Cites_doi 10.1109/TIT.2015.2410251
10.1109/LCOMM.2011.061611.110862
10.1109/LCOMM.2015.2497220
10.1109/LCOMM.2012.090312.121501
10.1109/TIT.2009.2021379
10.1109/JSAC.2014.140514
10.1109/TIT.2013.2272694
10.1049/el.2015.2592
10.1109/TCOMM.2015.2502246
10.1109/26.539767
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
F28
FR3
DOI 10.1109/LCOMM.2016.2560169
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database

Engineering Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2558
EndPage 1280
ExternalDocumentID 4117546861
10_1109_LCOMM_2016_2560169
7462203
Genre orig-research
GrantInformation_xml – fundername: Zhejiang Provincial Natural Science Foundation of China
  grantid: LR15F010001
  funderid: 10.13039/501100004731
– fundername: National Natural Science Foundation of China
  grantid: 61371094; 61401099
  funderid: 10.13039/501100001809
– fundername: National Key Basic Research Program of China
  grantid: 2012CB316104
– fundername: Research Funds of the Education Department of Fujian Province
  grantid: JA12350; JA14339
  funderid: 10.13039/501100003410
– fundername: Huawei HIRP Flagship Projects
  grantid: YB2015040053; YB2013120029
– fundername: Fundamental Research Funds for the Central Universities
  grantid: 2016QNA5004
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
AZLTO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
TN5
VH1
AAYXX
CITATION
7SP
8FD
L7M
RIG
F28
FR3
ID FETCH-LOGICAL-c328t-dbde0ac21c60887793827d18549915bbdceb61e820fe3b1df2d8b0841298b4d3
IEDL.DBID RIE
ISICitedReferencesCount 9
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000384642500002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1089-7798
IngestDate Wed Oct 01 14:16:58 EDT 2025
Mon Jun 30 10:15:43 EDT 2025
Sat Nov 29 06:26:37 EST 2025
Tue Nov 18 21:55:52 EST 2025
Wed Aug 27 02:48:13 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 7
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c328t-dbde0ac21c60887793827d18549915bbdceb61e820fe3b1df2d8b0841298b4d3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
PQID 1803944654
PQPubID 85419
PageCount 4
ParticipantIDs ieee_primary_7462203
crossref_citationtrail_10_1109_LCOMM_2016_2560169
proquest_miscellaneous_1825562811
proquest_journals_1803944654
crossref_primary_10_1109_LCOMM_2016_2560169
PublicationCentury 2000
PublicationDate 2016-07-01
PublicationDateYYYYMMDD 2016-07-01
PublicationDate_xml – month: 07
  year: 2016
  text: 2016-07-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE communications letters
PublicationTitleAbbrev COML
PublicationYear 2016
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref10
ref2
ref1
li (ref6) 2015
ref8
ref7
sarkis (ref11) 2015
ref9
ref4
ref3
presman (ref12) 2012
ref5
References_xml – ident: ref2
  doi: 10.1109/TIT.2015.2410251
– ident: ref5
  doi: 10.1109/LCOMM.2011.061611.110862
– ident: ref9
  doi: 10.1109/LCOMM.2015.2497220
– year: 2012
  ident: ref12
  article-title: Recursive descriptions of polar codes
– year: 2015
  ident: ref11
  article-title: Flexible and low-complexity encoding and decoding of systematic polar codes
– ident: ref3
  doi: 10.1109/LCOMM.2012.090312.121501
– ident: ref1
  doi: 10.1109/TIT.2009.2021379
– ident: ref10
  doi: 10.1109/JSAC.2014.140514
– ident: ref13
  doi: 10.1109/TIT.2013.2272694
– year: 2015
  ident: ref6
  article-title: On the error performance of systematic polar codes
– ident: ref7
  doi: 10.1049/el.2015.2592
– ident: ref8
  doi: 10.1109/TCOMM.2015.2502246
– ident: ref4
  doi: 10.1109/26.539767
SSID ssj0008251
Score 2.267868
Snippet Arıkan has shown that systematic polar codes (SPC) outperform non-SPC (NSPC). However, the performance gain comes at the price of elevated encoding complexity,...
Arikan has shown that systematic polar codes (SPC) outperform non-SPC (NSPC). However, the performance gain comes at the price of elevated encoding complexity,...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1277
SubjectTerms Algorithms
Complexity
Complexity theory
Computation
Decoding
Electronic mail
Encoding
encoding algorithm
Gain
Indexes
Mathematical models
Memory management
parallel encoding
Polar codes
systematic polar codes
Systematics
Title A Low Complexity Encoding Algorithm for Systematic Polar Codes
URI https://ieeexplore.ieee.org/document/7462203
https://www.proquest.com/docview/1803944654
https://www.proquest.com/docview/1825562811
Volume 20
WOSCitedRecordID wos000384642500002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2558
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008251
  issn: 1089-7798
  databaseCode: RIE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5q8aAHX1WsVlnBm0azm3SzuQhFLB7aKuiht5B9RAs1kTZV_PfuJGkoKIK3QGaTMJN57c58A3DuUx0oLm1uEvrK8akKnNhNmJNgI6VSnsdLSQ-C0UiMx-FjAy7rXhhjTFF8Zq7wsjjL15la4FbZdeBzxhDacy0IeNmrVVtdbMEsi-lDGzGGYtkg44bXg9uH4RCruPhVkYBgcfOKEyqmqvwwxYV_6W__78t2YKuKI0mvFPwuNEy6B5sr6IItuOmRQfZJUOMR9TL_InepytBXkd70JZtN8tc3YmNW8lSjOZNHzHTtEm3m-_Dcv3u-vXeqcQmO8pjIHS21cWPFqOJoOqziCRZo649tUkO7UmplJKfGuvzEeJLqhGkhXeFbjy-kr70DaKZZag6BhNqjWjBlYiZ9G2LFuhvybpB4iXa1jlkb6JJ9kaqgxHGixTQqUgo3jAqWR8jyqGJ5Gy7qNe8lkMaf1C1kck1Z8bcNnaWUokrX5hEVLnb38q7fhrP6ttUSPPqIU5MtkAah1pig9Oj3Jx_DBr6_LMTtQDOfLcwJrKuPfDKfnRa_2jdvPc8Q
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB5EBfXgW1yfEbxptUnTNr0IiyiK3VVwD95K86gK2spuV_Hfm2m7RVAEb4VOSpjJvJqZbwAOOdWhCqTNTSKuHE5V6KRuxpwMGymV8ryglnQc9vvi4SG6m4LjthfGGFMVn5kTfKzu8nWhxvir7DTkAWMI7Tnjc87culurtbvYhFmX00c2ZozEpEXGjU7j89teD-u4gpMqBcHy5m9uqJqr8sMYVx7mcul_e1uGxSaSJN1a9CswZfJVWPiGL7gGZ10SFx8EdR5xL8tPcpGrAr0V6b48FsPn8umV2KiV3Ld4zuQOc127RJvROgwuLwbnV04zMMFRHhOlo6U2bqoYVQEaD6t6goXaemSb1lBfSq2MDKixTj8znqQ6Y1pIV3Dr84Xk2tuA6bzIzSaQSHtUC6ZMyiS3QVaq_Sjww8zLtKt1yjpAJ-xLVAMmjjMtXpIqqXCjpGJ5gixPGpZ34Khd81ZDafxJvYZMbikb_nZgZyKlpNG2UUKFi_29gc87cNC-tnqClx9pboox0iDYGhOUbv3-5X2Yuxr04iS-7t9swzzupS7L3YHpcjg2uzCr3svn0XCvOnZfXqfSVw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Low+Complexity+Encoding+Algorithm+for+Systematic+Polar+Codes&rft.jtitle=IEEE+communications+letters&rft.au=Chen%2C+Guo+Tai&rft.au=Zhang%2C+Zhaoyang&rft.au=Zhong%2C+Caijun&rft.au=Zhang%2C+Liang&rft.date=2016-07-01&rft.issn=1089-7798&rft.spage=1&rft.epage=1&rft_id=info:doi/10.1109%2FLCOMM.2016.2560169&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LCOMM_2016_2560169
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon