Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Conference Proceedings

Low-Complexity List Successive-Cancellation Decoding of Polar Codes Using List Pruning

Chen Ji, YouZhe Fan, ChenYang Xia, Chi-Ying Tsui, Jie Jin, Kai Chen, Bin Li

Published Jan 1, 2016• 0 citations
OpenAlex

Related papers

Reduced-Complexity Successive Cancellation List Decoding of Polar Codes Using Parity Check and List-Pruning

Yusuke Oki, Ryo Shibata, Gou Hosoya +1 more

IEICE Technical Report; IEICE Tech. Rep.•May 16, 2019•0 citations

A low-complexity successive cancellation list decoding for polar codes with variable thresholds

Liping Du, Ping An, Xiaoyun Hou +1 more

Annals of Telecommunications•Jul 29, 2025•0 citations

On Reducing Decoding Complexity of Successive-Cancellation List Flip Decoding of Polar Codes

Charles Pillet, Ilshat Sagitov, Pascal Giard

arXiv:2605.08492•Journal of Signal Processing Systems•Oct 20, 2025•0 citations

Simplified multi-bit SC list decoding for polar codes

Jiangxue Han, Rongke Liu, Runxin Wang

In this paper, we propose a simplified multi-bit successive cancellation list (SMSCL) decoding method for polar codes. In the proposed SMSCL decoding, frozen bits are ignored, and multiple information bits are intermediately decoded at each decision step. In addition, a modified two-stage pruning network is proposed to reduce the complexity of path pruning in SMSCL decoding. Compared to the existing multi-bit SCL decoders, the SMSCL decoder can achieve significant latency and complexity reduction over a wide range of code rates.

IEEE International Conference on Acoustics Speech and Signal Processing•Mar 1, 2016•5 citations

Polar Decoding Tree Pruning Based on Soft-Output Extraction

Li Shen, Yongpeng Wu, Wenjun Zhang

Although the successive cancellation list (SCL) decoding of polar codes exhibits excellent performance, it retains many decoding paths in the list with negligible contribution to the final output, resulting in high sorting and computational complexity. In this letter, we propose a novel pruning strategy to mitigate the decoding complexity. By leveraging the blockwise soft output extraction process of soft-output SCL and soft-output fast SCL decoding, we provide an accurate approximation of the probability that a decoding path is correct, and thus accordingly prune the paths failing to meet a pre-defined reliability threshold. The complexity reduction achieved by the proposed soft-output-based pruned SCL (SOP-SCL) decoder and its fast version, SOP-FSCL decoder, is significant, without any compromise in error-correction performance. Meanwhile, they also prove to be more efficient than state-of-the-art pruned polar decoders.

IEEE Communications Letters•Jan 1, 2026•0 citations

A complexity-reduced fast successive cancellation list decoder for polar codes

Qingyun Xu, Zhiwen Pan, Nan Liu +1 more

Science China Information Sciences•Nov 20, 2017•10 citations
In this paper, we propose a simplified multi-bit successive cancellation list (SMSCL) decoding method for polar codes. In the proposed SMSCL decoding, frozen bits are ignored, and multiple information bits are intermediately decoded at each decision step. In addition, a modified two-stage pruning network is proposed to reduce the complexity of path pruning in SMSCL decoding. Compared to the existing multi-bit SCL decoders, the SMSCL decoder can achieve significant latency and complexity reduction over a wide range of code rates.
Although the successive cancellation list (SCL) decoding of polar codes exhibits excellent performance, it retains many decoding paths in the list with negligible contribution to the final output, resulting in high sorting and computational complexity. In this letter, we propose a novel pruning strategy to mitigate the decoding complexity. By leveraging the blockwise soft output extraction process of soft-output SCL and soft-output fast SCL decoding, we provide an accurate approximation of the probability that a decoding path is correct, and thus accordingly prune the paths failing to meet a pre-defined reliability threshold. The complexity reduction achieved by the proposed soft-output-based pruned SCL (SOP-SCL) decoder and its fast version, SOP-FSCL decoder, is significant, without any compromise in error-correction performance. Meanwhile, they also prove to be more efficient than state-of-the-art pruned polar decoders.