Generalized Fast Decoding of Polar Codes
Carlo Condo, Valerio Bioglio, Ingmar Land

TL;DR
This paper introduces a generalized fast decoding approach for polar codes, significantly reducing decoding latency without performance loss, applicable to both SC and SCL decoding methods.
Contribution
The work extends existing fast decoding techniques by proposing three multi-node polar code subcodes, enabling larger subsets of bits to be decoded efficiently in SCL decoding.
Findings
Up to 23.6% latency reduction with no performance loss.
Up to 29.2% latency reduction with no performance loss.
Additional latency gains when allowing some performance degradation.
Abstract
Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have been selected as one of the coding schemes in the generation wireless standard (5G). Over the years various polar code decoding algorithms, like SC-list (SCL), have been proposed to improve the mediocre performance of the successive cancellation (SC) decoding algorithm for finite code lengths; however, like SC, they suffer from long decoding latency. Fast decoding of polar codes tries to overcome this problem by identifying particular subcodes in the polar code and decoding them with efficient decoders. In this work, we introduce a generalized approach to fast decoding of polar codes to further reduce SC-based decoding latency. We propose…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
