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

IEICE Technical Report; IEICE Tech. Rep.

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

Yusuke Oki, Ryo Shibata, Gou Hosoya, Hiroyuki Yashima

Published May 16, 2019• 0 citations
OpenAlex

Related papers

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

Chen Ji, YouZhe Fan, ChenYang Xia +4 more

IEEE Conference Proceedings•Jan 1, 2016•0 citations

Fast successive-cancellation list decoding of parity-check polar codes with special nodes

Lijuan Xing, Zhuo Li

Physical Communication•Jul 1, 2026•0 citations

List-Pruning SCL Decoder for Polar Codes Using Parity-Check Bits

Yusuke Oki, Ryo Shibata, Hiroyuki Yashima

IEICE Technical Report; IEICE Tech. Rep.•Feb 25, 2021•0 citations

A Low Complexity Successive Cancellation List Decoding Algorithm of Polar Codes

Jiansong Miao, Weijie Li, Xuejia Hu +1 more

Polar codes are the first provably capacity-achieving novel channel codes. Successive cancellation list (SCL) decoding algorithm has a performance close to maximum-likelihood decoding when code length is finite, though the complexity is high. To reduce the complexity of SCL, a partial path expansion with segmented check and pruning SCL (PPE-SCP-SCL) algorithm is proposed in this paper. Based on the successive decoding structure, if the decoding result of a bit is judged to be reliable enough, then a hard decision is made directly and no path expansion is necessary. Moreover, several parity-check points are introduced to perform segmented parity-check during the decoding process, and if the check fails, the current path is directly abandoned. The rationality of the operations is theoretically verified, and numerical simulations also verify that the proposed algorithm can significantly reduce the complexity of decoding with trivial loss of error performance.

IEEE/CIC International Conference on Communications in China (ICCC)•Aug 9, 2020•0 citations

Parity-Check Aided Adaptive Successive Cancellation List Decoding for Polar Codes

Jie Zhang, Houdong Xu, Linhao Zhang +3 more

In this paper, the fundamental parity-check (PC) mechanism is incorporated into the adaptive successive cancellation list (ASCL) polar decoder and a joint detection is implemented. The generation and distribution methods of the PC bits are specifically designed according to a channel reliability conducted multi protection level principle. Benefiting from these specific designs, the PC aided ASCL decoder becomes an excellent candidate for the parity check concatenated (PCC) polar decoders. The simulation results demonstrate that the proposed decoder achieves the same error-performance as the cyclic redundant check (CRC) aided ASCL decoder but having significantly lower decoding complexity.

IEEE International Conference on Communication Technology (ICCT)•Oct 13, 2021•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
Polar codes are the first provably capacity-achieving novel channel codes. Successive cancellation list (SCL) decoding algorithm has a performance close to maximum-likelihood decoding when code length is finite, though the complexity is high. To reduce the complexity of SCL, a partial path expansion with segmented check and pruning SCL (PPE-SCP-SCL) algorithm is proposed in this paper. Based on the successive decoding structure, if the decoding result of a bit is judged to be reliable enough, then a hard decision is made directly and no path expansion is necessary. Moreover, several parity-check points are introduced to perform segmented parity-check during the decoding process, and if the check fails, the current path is directly abandoned. The rationality of the operations is theoretically verified, and numerical simulations also verify that the proposed algorithm can significantly reduce the complexity of decoding with trivial loss of error performance.
In this paper, the fundamental parity-check (PC) mechanism is incorporated into the adaptive successive cancellation list (ASCL) polar decoder and a joint detection is implemented. The generation and distribution methods of the PC bits are specifically designed according to a channel reliability conducted multi protection level principle. Benefiting from these specific designs, the PC aided ASCL decoder becomes an excellent candidate for the parity check concatenated (PCC) polar decoders. The simulation results demonstrate that the proposed decoder achieves the same error-performance as the cyclic redundant check (CRC) aided ASCL decoder but having significantly lower decoding complexity.