Shifted pruning for path recovery in list decoding of polar codes

Mohammad Rowshan, Emanuele Viterbo

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


In successive cancellation list (SCL) decoding, the tree pruning operation retains the L best paths with respect to a metric at every decoding step. However, the correct path might be among the L worst paths due to imposed penalties. In this case, the correct path is pruned and the decoding process fails. Shifted-pruning (SP) scheme can recover the correct path by additional decoding attempts when decoding fails, in which the pruning window is shifted by L over the bits with high likelihood of the elimination of the correct path, one at a time. In this work, we generalize the scheme by more freedom in shifting the pruning window, aiming to improve the error correction performance in the constrained number of decoding attempts. We also propose a metric for prioritizing the shifting positions.

Original languageEnglish
Title of host publication2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC)
EditorsRajashree Paul
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Number of pages6
ISBN (Electronic)9780738143941, 9781665414906
ISBN (Print)9781665430586
Publication statusPublished - 2021
EventIEEE Annual Computing and Communication Workshop and Conference 2021 - Online, Las Vegas, United States of America
Duration: 27 Jan 202130 Jan 2021
Conference number: 11th (Proceedings) (Website)


ConferenceIEEE Annual Computing and Communication Workshop and Conference 2021
Abbreviated titleCCWC 2021
CountryUnited States of America
CityLas Vegas
Internet address


  • list decoding
  • Polar codes
  • successive cancellation
  • tree pruning

Cite this