How to modify polar codes for list decoding

Mohammad Rowshan, Emanuele Viterbo

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

13 Citations (Scopus)

Abstract

Polar codes are constructed based on the reliability of bit-channels. This construction suits the successive cancellation (SC) decoding, where one error in the successive estimation of the bits fails the decoding. However, in SC list (SCL) decoding, the correct path may remain in the list by tolerating multiple penalties. This characteristic of list decoding demands a different approach in code construction.In this work, we modify the conventional construction by a greedy search algorithm in which a bit-swapping approach is employed to re-distribute the low-reliability bits in the subblocks aiming for a reduction in the probability of correct path elimination. The numerical results for polar codes of length 1 kb under CRC-aided SCL decoding show improvements of about 0.4 dB for R=0.8 and over 0.2 dB for R=0.5 at L=32.

Original languageEnglish
Title of host publication2019 IEEE International Symposium on Information Theory
Subtitle of host publicationProceedings
EditorsGiuseppe Caire, Venugopal V. Veeravalli, Aaron B. Wagner, Gilles Zemor
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages1772-1776
Number of pages5
ISBN (Electronic)9781538692912, 9781538692905
ISBN (Print)9781538692929
DOIs
Publication statusPublished - 2019
EventIEEE International Symposium on Information Theory 2019 - Paris, France
Duration: 7 Jul 201912 Jul 2019
https://2019.ieee-isit.org/
https://ieeexplore.ieee.org/xpl/conhome/8827389/proceeding (Proceedings)

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE, Institute of Electrical and Electronics Engineers
ISSN (Print)2157-8095
ISSN (Electronic)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory 2019
Abbreviated titleISIT 2019
Country/TerritoryFrance
CityParis
Period7/07/1912/07/19
Internet address

Keywords

  • bit-swapping
  • code construction
  • list decoding
  • Polar codes
  • successive cancellation

Cite this