Fast List Decoders for Polar Codes

Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE journal on selected areas in communications Ročník 34; číslo 2; s. 318 - 328
Hlavní autoři: Sarkis, Gabi, Giard, Pascal, Vardy, Alexander, Thibeault, Claude, Gross, Warren J.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.02.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Complexity theory
Computer programs
Decoders
Decoding
Error correcting codes
Error correction
Hardware
list decoding
Lists
Parity check codes
polar codes
Reliability
Software
Software algorithms
software decoders
LDPC
software-defined radio
polar codes
software decoders
list decoding
ISSN:0733-8716, 1558-0008
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many methods to improve the error-correction performance of polar codes, list decoding yields the best results, especially when the polar code is concatenated with a cyclic redundancy check (CRC). List decoding involves exploring several decoding paths with SC decoding, and therefore tends to be slower than SC decoding itself, by an order of magnitude in practical implementations. In this paper, we present a new algorithm based on unrolling the decoding tree of the code that improves the speed of list decoding by an order of magnitude when implemented in software. Furthermore, we show that for software-defined radio applications, our proposed algorithm is faster than the fastest software implementations of LDPC decoders in the literature while offering comparable error-correction performance at similar or shorter code lengths.
AbstractList Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many methods to improve the error-correction performance of polar codes, list decoding yields the best results, especially when the polar code is concatenated with a cyclic redundancy check (CRC). List decoding involves exploring several decoding paths with SC decoding, and therefore tends to be slower than SC decoding itself, by an order of magnitude in practical implementations. In this paper, we present a new algorithm based on unrolling the decoding tree of the code that improves the speed of list decoding by an order of magnitude when implemented in software. Furthermore, we show that for software-defined radio applications, our proposed algorithm is faster than the fastest software implementations of LDPC decoders in the literature while offering comparable error-correction performance at similar or shorter code lengths.
Author Vardy, Alexander
Sarkis, Gabi
Giard, Pascal
Gross, Warren J.
Thibeault, Claude
Author_xml – sequence: 1
  givenname: Gabi
  surname: Sarkis
  fullname: Sarkis, Gabi
  email: gabi.sarkis@mail.mcgill.ca
  organization: Dept. of Electr. & Comput. Eng., McGill Univ., Montréal, QC, Canada
– sequence: 2
  givenname: Pascal
  surname: Giard
  fullname: Giard, Pascal
  email: pascal.giard@mail.mcgill.ca
  organization: Dept. of Electr. & Comput. Eng., McGill Univ., Montréal, QC, Canada
– sequence: 3
  givenname: Alexander
  surname: Vardy
  fullname: Vardy, Alexander
  email: avardy@ucsd.edu
  organization: Dept. of Electr. Eng., Univ. of California, San Diego, La Jolla, CA, USA
– sequence: 4
  givenname: Claude
  surname: Thibeault
  fullname: Thibeault, Claude
  email: claude.thibeault@etsmtl.ca
  organization: Dept. of Electr. Eng., Ecole de Technol. Super., Montréal, QC, Canada
– sequence: 5
  givenname: Warren J.
  surname: Gross
  fullname: Gross, Warren J.
  email: warren.gross@mcgill.ca
  organization: Dept. of Electr. & Comput. Eng., McGill Univ., Montréal, QC, Canada
BookMark eNp9kE1LAzEQhoMo2FZ_gHhZ9OJl60yy-TqW1fpBQcHel2yahS3bTU22B_-9KS0eevDyDgzPOwzPmJz3vneE3CBMEUE_vn_NyikF5FPKoaBan5ERcq5yAFDnZASSsVxJFJdkHOMaAItC0RG5m5s4ZIs2xZOzfuVCzBofsk_fmZCVaRGvyEVjuuiuj3NClvPnZfmaLz5e3srZIreMiiGvkQOtUVNuGsllIVZCNUKhEBwQXGGxdqzWhvJaFdoyBc5IsbLQMCupYxPycDi7Df575-JQbdpoXdeZ3vldrFBqRpmUKSbk_gRd-13o03OJ4lJqwTQmSh4oG3yMwTWVbQcztL4fgmm7CqHaq6v26qq9uuqoLjXxpLkN7caEn387t4dO65z745N1LSSyX9eMd9I
CODEN ISACEM
CitedBy_id crossref_primary_10_1007_s11432_017_9312_9
crossref_primary_10_1109_COMST_2023_3259224
crossref_primary_10_1109_LCOMM_2021_3083370
crossref_primary_10_1002_cpe_7820
crossref_primary_10_1109_LES_2024_3417413
crossref_primary_10_1109_TIT_2020_2977917
crossref_primary_10_1109_TCOMM_2020_3017656
crossref_primary_10_1109_ACCESS_2018_2875756
crossref_primary_10_1109_TSP_2022_3147307
crossref_primary_10_1109_JSAC_2024_3431579
crossref_primary_10_1109_TCOMM_2021_3098798
crossref_primary_10_1109_LWC_2021_3129470
crossref_primary_10_1109_LCOMM_2024_3354490
crossref_primary_10_1109_TVT_2023_3246986
crossref_primary_10_3390_e27080808
crossref_primary_10_1155_2018_7286909
crossref_primary_10_1186_s13638_018_1040_6
crossref_primary_10_1109_JETCAS_2017_2743107
crossref_primary_10_1109_LCOMM_2019_2963645
crossref_primary_10_1109_TCOMM_2024_3432688
crossref_primary_10_1109_TSP_2022_3216921
crossref_primary_10_1109_TBC_2020_2977561
crossref_primary_10_1002_dac_5343
crossref_primary_10_1007_s12243_018_0634_7
crossref_primary_10_1109_ACCESS_2019_2901596
crossref_primary_10_1109_LCOMM_2023_3307236
crossref_primary_10_3390_e21090899
crossref_primary_10_1109_TCOMM_2021_3070610
crossref_primary_10_1109_TSP_2018_2838554
crossref_primary_10_1109_TSP_2020_3029389
crossref_primary_10_1109_TCOMM_2019_2908870
crossref_primary_10_1109_ACCESS_2020_3041290
crossref_primary_10_1016_j_jiixd_2022_10_002
crossref_primary_10_1109_ACCESS_2023_3238802
crossref_primary_10_5194_ars_16_43_2018
crossref_primary_10_3390_e23070841
crossref_primary_10_1016_j_prime_2024_100838
crossref_primary_10_1109_TCSI_2016_2619324
crossref_primary_10_1007_s12243_019_00727_5
crossref_primary_10_1109_ACCESS_2018_2886464
crossref_primary_10_1109_JPROC_2024_3416050
crossref_primary_10_1109_TSP_2022_3150962
crossref_primary_10_1007_s11432_017_9128_x
crossref_primary_10_3390_math11214462
crossref_primary_10_1109_TCOMM_2021_3064964
crossref_primary_10_1109_TCSI_2024_3443598
crossref_primary_10_1049_iet_com_2018_5643
crossref_primary_10_1109_TCOMM_2024_3427348
crossref_primary_10_3390_electronics11040560
crossref_primary_10_1109_JETCAS_2017_2745704
crossref_primary_10_1109_TIT_2024_3509673
crossref_primary_10_1109_LCOMM_2024_3521080
crossref_primary_10_1109_JETCAS_2017_2764421
crossref_primary_10_1016_j_comnet_2020_107284
crossref_primary_10_1109_COMST_2019_2937923
crossref_primary_10_1109_TR_2022_3179114
crossref_primary_10_1007_s11265_018_1430_3
crossref_primary_10_1109_TGCN_2023_3324205
crossref_primary_10_1109_TVT_2020_3026915
crossref_primary_10_1109_TSP_2018_2864580
crossref_primary_10_1109_TSP_2018_2839586
crossref_primary_10_1109_TVT_2020_3006369
crossref_primary_10_1109_TCOMM_2019_2906232
crossref_primary_10_1186_s13638_021_02042_x
crossref_primary_10_1109_TIT_2020_3047624
crossref_primary_10_1109_TSP_2017_2740204
crossref_primary_10_1109_TVT_2020_2973552
crossref_primary_10_1109_ACCESS_2020_2985909
crossref_primary_10_1007_s11801_024_3214_2
crossref_primary_10_1109_JETCAS_2025_3561330
crossref_primary_10_1049_iet_com_2018_5794
crossref_primary_10_1109_TVT_2020_3021258
crossref_primary_10_1007_s11277_022_09688_w
crossref_primary_10_1049_ote2_12058
crossref_primary_10_1109_TSP_2022_3203251
Cites_doi 10.1109/LCOMM.2011.101811.111480
10.1109/TIT.2015.2410251
10.1109/GlobalSIP.2014.7032067
10.1109/TIT.2005.864425
10.1109/TIT.1972.1054746
10.1109/JSAC.2014.140514
10.1109/TSP.2014.2371781
10.1109/ICASSP.2015.7178128
10.1109/TIT.2009.2021379
10.1109/LCOMM.2012.111612.121898
10.1109/TSP.2015.2439211
10.1145/2742060.2742108
10.1109/TVLSI.2014.2378992
10.1109/TIT.2005.864443
10.1109/SiPS.2014.6986089
10.1007/s11265-014-0959-z
10.1109/TCSII.2014.2369131
10.1109/LCOMM.2013.021213.121633
10.1109/TVLSI.2014.2359793
10.1109/TCSII.2014.2327336
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/JSAC.2015.2504299
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
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 Engineering Research Database

Technology 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-0008
EndPage 328
ExternalDocumentID 3924550281
10_1109_JSAC_2015_2504299
7339671
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
41~
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
ADRHT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IBMZZ
ICLAB
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-c326t-b1502b1925af75746d68f681665010e4c1be3b9a25b849c380ea76dc0f3c72e3
IEDL.DBID RIE
ISICitedReferencesCount 132
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000368395000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0733-8716
IngestDate Thu Oct 02 06:09:43 EDT 2025
Mon Jun 30 10:07:09 EDT 2025
Sat Nov 29 03:22:56 EST 2025
Tue Nov 18 22:26:21 EST 2025
Wed Aug 27 02:47:41 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords LDPC
software-defined radio
polar codes
software decoders
list decoding
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c326t-b1502b1925af75746d68f681665010e4c1be3b9a25b849c380ea76dc0f3c72e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
PQID 1757796391
PQPubID 85481
PageCount 11
ParticipantIDs proquest_journals_1757796391
ieee_primary_7339671
crossref_citationtrail_10_1109_JSAC_2015_2504299
crossref_primary_10_1109_JSAC_2015_2504299
proquest_miscellaneous_1793237732
PublicationCentury 2000
PublicationDate 2016-02-01
PublicationDateYYYYMMDD 2016-02-01
PublicationDate_xml – month: 02
  year: 2016
  text: 2016-02-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE journal on selected areas in communications
PublicationTitleAbbrev J-SAC
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
ref31
(ref25) 2006
ref10
jouguet (ref14) 2014; 14
ref2
ref1
xiong (ref20) 2015
ref19
ref18
furtak (ref30) 0
(ref26) 2012
park (ref4) 0
han (ref32) 0
(ref16) 2015
ref24
ref23
sarkis (ref12) 0
(ref15) 2015
ref22
ref21
ref28
ref27
ref29
ref8
ref7
(ref17) 2015
ref9
ref3
ref6
ref5
giard (ref11) 2015
References_xml – year: 0
  ident: ref12
  article-title: Flexible and low-complexity encoding and decoding of systematic polar codes
– ident: ref8
  doi: 10.1109/LCOMM.2011.101811.111480
– ident: ref2
  doi: 10.1109/TIT.2015.2410251
– ident: ref19
  doi: 10.1109/GlobalSIP.2014.7032067
– ident: ref23
  doi: 10.1109/TIT.2005.864425
– ident: ref29
  doi: 10.1109/TIT.1972.1054746
– ident: ref3
  doi: 10.1109/JSAC.2014.140514
– ident: ref10
  doi: 10.1109/TSP.2014.2371781
– year: 2015
  ident: ref20
  article-title: Symbol-decision successive cancellation list decoder for polar codes
– ident: ref7
  doi: 10.1109/ICASSP.2015.7178128
– ident: ref1
  doi: 10.1109/TIT.2009.2021379
– year: 2015
  ident: ref15
  publication-title: Nutaq PicoSDR
– start-page: 1
  year: 0
  ident: ref4
  article-title: A 4.68Gb/s belief propagation polar decoder with bit-splitting register file
  publication-title: Proc Symp VLSI Circuits Dig Tech Papers
– year: 2015
  ident: ref11
  article-title: Low-latency software polar decoders
  publication-title: CoRR
– start-page: 218
  year: 0
  ident: ref32
  article-title: Implementation of IEEE 802.11n LDPC codes based on general purpose processors
  publication-title: Proc IEEE Int Conf Commun Technol (ICCT)
– start-page: 348
  year: 0
  ident: ref30
  article-title: Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms
  publication-title: Proc ACM Symp Parallel Algorithms Archit
– ident: ref27
  doi: 10.1109/LCOMM.2012.111612.121898
– ident: ref6
  doi: 10.1109/TSP.2015.2439211
– ident: ref22
  doi: 10.1145/2742060.2742108
– ident: ref5
  doi: 10.1109/TVLSI.2014.2378992
– year: 2015
  ident: ref16
  publication-title: Usrp Networked Series
– year: 2015
  ident: ref17
  publication-title: USRP Bus Series
– ident: ref24
  doi: 10.1109/TIT.2005.864443
– start-page: 1
  year: 2012
  ident: ref26
– volume: 14
  start-page: 329
  year: 2014
  ident: ref14
  article-title: High performance error correction for quantum key distribution using polar codes
  publication-title: Quantum Inf Comput
– ident: ref18
  doi: 10.1109/SiPS.2014.6986089
– ident: ref31
  doi: 10.1007/s11265-014-0959-z
– ident: ref13
  doi: 10.1109/TCSII.2014.2369131
– ident: ref9
  doi: 10.1109/LCOMM.2013.021213.121633
– ident: ref21
  doi: 10.1109/TVLSI.2014.2359793
– ident: ref28
  doi: 10.1109/TCSII.2014.2327336
– start-page: 1
  year: 2006
  ident: ref25
SSID ssj0014482
Score 2.5583775
Snippet Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC)...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 318
SubjectTerms Algorithms
Complexity theory
Computer programs
Decoders
Decoding
Error correcting codes
Error correction
Hardware
list decoding
Lists
Parity check codes
polar codes
Reliability
Software
Software algorithms
software decoders
Title Fast List Decoders for Polar Codes
URI https://ieeexplore.ieee.org/document/7339671
https://www.proquest.com/docview/1757796391
https://www.proquest.com/docview/1793237732
Volume 34
WOSCitedRecordID wos000368395000010&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-0008
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014482
  issn: 0733-8716
  databaseCode: RIE
  dateStart: 19830101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9z-KAPfk1xOqWKT2K3rkmT5XFMh4iMgXvYW0muKQjSydr593vJsioogm-luX5wl-R-l_si5EbiPMgjocM402igZFyFEkCGNNcZU1IAz5hrNiEmk8F8LqcNclfnwhhjXPCZ6dpL58vPFrCyR2U9QankNmF8Swi-ztWqPQZoZjiPAdKE1gjwHsx-JHtPL8ORDeJKurZeV-zKvH7pINdU5cdO7NTLeP9_P3ZA9jyMDIZruR-ShimOyO634oItcj1WZRU8oxiDe2Mz15dlgAg1mFpjNhjhjfKYzMYPs9Fj6DsihIAwqwo1wrdYIyhLVC4SwXjGBzm3rr8E7SrDoK8N1VLFiR4wCXQQGSV4BlFOQcSGnpBmsSjMKQk008qgakcdSZlSIIEZEAq04pmmoNsk2rAoBV8t3DateEud1RDJ1HI1tVxNPVfb5LZ-5H1dKuMv4pZlY03oOdgmnY0cUr-YyhQRjhC4UUgcvqqHcRlY34YqzGJlaRCIUiFofPb7m8_JDn7fB1x3SLNarswF2YaP6rVcXrq59AmfYMTx
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED-GCuqDX1OcTq3ik9ita9KmeRzTMXWOgXvYW0nSFATpZO38-71kXRUUwbfSXEu4S3K_y30BXHNcB6nHpOsnEg2UJBQuV4q7JJUJFZypMKG22QQbjaLplI9rcFvlwmitbfCZbplH68tPZmphrsrajBAemoTx9YBS31tma1U-AzQ0rM8AqVxjBpQ-zI7H248v3Z4J4wpapmKXbwu9fmkh21blx1lsFUx_939T24OdEkg63aXk96GmswPY_lZesA5XfZEXzhAF6dxpk7s-zx3EqM7YmLNOD1_khzDp3096A7fsieAqBFqFKxHA-RJhWSBSFjAaJmGUhsb5F6BlpanqSE0kF34gI8oViTwtWJgoLyWK-ZocwVo2y_QxOJJKoVG5o5YkVAjFFdWKCSVFmEiiZAO8FYtiVdYLN20r3mJrN3g8NlyNDVfjkqsNuKk-eV8Wy_iLuG7YWBGWHGxAcyWHuNxOeYwYhzE8KjgOX1bDuBGMd0NkerYwNAhFCWPEP_n9zxewOZg8D-Phw-jpFLZwLmX4dRPWivlCn8GG-ihe8_m5XVefDA_IOA
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=Fast+List+Decoders+for+Polar+Codes&rft.jtitle=IEEE+journal+on+selected+areas+in+communications&rft.au=Sarkis%2C+Gabi&rft.au=Giard%2C+Pascal&rft.au=Vardy%2C+Alexander&rft.au=Thibeault%2C+Claude&rft.date=2016-02-01&rft.issn=0733-8716&rft.volume=34&rft.issue=2&rft.spage=318&rft.epage=328&rft_id=info:doi/10.1109%2FJSAC.2015.2504299&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_JSAC_2015_2504299
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0733-8716&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0733-8716&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0733-8716&client=summon