A Split-Reduced Successive Cancellation List Decoder for Polar Codes
Zhaoyang Zhang, Liang Zhang, Xianbin Wang, Caijun Zhong, and H., Vincent Poor

TL;DR
This paper introduces a low complexity SCL decoding method for polar codes that reduces splitting by using a reliability-based rule and counters, maintaining performance while lowering computational effort.
Contribution
A novel splitting rule and counter-based pruning method are proposed, significantly reducing decoding complexity without sacrificing error performance in polar codes.
Findings
Achieves similar error performance to conventional SCL decoding.
Reduces decoding complexity substantially.
Validates the approach through simulation results.
Abstract
This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes. In particular, using the fact that splitting may be unnecessary when the reliability of decoding the unfrozen bit is sufficiently high, a novel splitting rule is proposed. Based on this rule, it is conjectured that, if the correct path survives at some stage, it tends to survive till termination without splitting with high probability. On the other hand, the incorrect paths are more likely to split at the following stages. Motivated by these observations, a simple counter that counts the successive number of stages without splitting is introduced for each decoding path to facilitate the identification of correct and incorrect path. Specifically, any path with counter value larger than a predefined threshold \omega is deemed to be the correct path, which will survive at the decoding stage,…
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.
