Stepped list decoding for polar codes

Mohammad Rowshan, Emanuele Viterbo

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

1 Citation (Scopus)

Abstract

In the successive cancellation list (SCL) decoding of polar codes, as the list size increases, the error correction performance improves. However, a large list size results in high computational complexity and large memory requirement.In this paper, we investigate the list decoding process by introducing a new parameter named path metric range (PMR) to elucidate the properties of the evolution of the path metrics (PMs) within the list throughout the decoding process. Then, we advocate that the list size can change stepwise depending on PMR. As a result, we propose a stepped list decoding scheme in which the error correction performance of the conventional list decoding is preserved while the path memory may reduce by 75%, the size of the internal LLR memory and partial sums memory can drop by 50%, and the computational complexity may halve. The reduction in complexity is SNR-independent and achieved without introducing any computational overhead.

Original languageEnglish
Title of host publicationProceedings of 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing
EditorsCatherine Douillard, Werner Henkel
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Number of pages5
ISBN (Electronic)9781538670484, 9781538670477
ISBN (Print)9781538670491
DOIs
Publication statusPublished - 2018
EventIEEE International Symposium on Turbo Codes and Iterative Information Processing 2018 - Hong Kong, China
Duration: 3 Dec 20187 Dec 2018
Conference number: 10th
http://www.istc2018.org/

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing
PublisherIEEE, Institute of Electrical and Electronics Engineers
ISSN (Print)2165-4700
ISSN (Electronic)2165-4719

Conference

ConferenceIEEE International Symposium on Turbo Codes and Iterative Information Processing 2018
Abbreviated titleISTC 2018
CountryChina
CityHong Kong
Period3/12/187/12/18
Internet address

Keywords

  • computational complexity
  • memory requirement
  • Polar codes
  • successive cancellation list decoding

Cite this