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

International Symposium on Turbo Codes and Iterative Information Processing

Block successive cancellation decoding of polarization-based codes

Dina Goldin, David Burshtein

Published Sep 1, 2016• 1 citation
Publisher

Abstract

Linear codes constructed using a polarization transformation followed by short blocklength sub-codes are proposed. Decoding is realized by the successive cancellation algorithm combined with standard optimal or non-optimal decoding of the sub-codes. List successive cancellation decoding can also be used. We demonstrate gains compared to standard successive cancellation of polar codes for short blocklength codes.

DOI
10.1109/istc.2016.7593116

Related papers

SIMPLIFIED SUCCESSIVE-CANCELLATION LIST POLAR DECODING FOR BINARY LINEAR BLOCK CODES

Driss Khebbou, Reda Benkhouya, Idriss Chana +1 more

This paper aims to take advantage of the performances of polar decoding techniques for the benefit of binary linear block codes (BLBCs) with the main objective is to study the performances of the SSCL decoding for short-length BLBCs. Polar codes are one of the most recent error-correcting codes to be invented, and they have been mathematically demonstrated to be able to correct all errors under a specific situation, using the successive-cancellation decoder. However, their performances for real-time wireless communications at short block lengths remain less attractive. To take advantage of the performance of these codes in favor of error correction codes of short block length, an adaptation of the simplified successive-cancellation list as a decoder for polar codes for the benefit of short block length binary linear block codes is presented in this paper. This adaptation makes it possible to take advantage of the performances of less complex decoding methods for polar codes for BLBCs with latency and complexity optimization of the standard successive-cancellation list decoder. The experiment shows that the method can achieve the performances of the most famous order statistic decoder for binary linear block codes, which can achieve the performances of maximum-likelihood decoding with computational complexity and memory constraints.

Journal of Southwest Jiaotong University•Dec 24, 2021•3 citations

Deep-Polar Codes: An Efficient Error Correction Code for Short Blocklength Transmission

Geon Choi, Namyoon Lee

In this paper, we put forth a novel class of pre-transformed polar codes, called as “deep-polar codes.” Encoding of deep-polar codes involves a series of multi-layered polar transformations. By applying these successive polar-based pre-transformations, deep-polar codes with an improved weight distribution are constructed with low encoding complexity. We also propose a low-complexity successive cancellation list decoding algorithm to effectively decode the deep-polar codes. This decoding algorithm harnesses the reverse process of the multi-layered pre-transformed encoding, referred to as “back propagation parity checks.” From simulations, we demonstrate that deep-polar codes outperform existing pre-transformed polar codes in terms of block error rates across various code rates and short blocklengths, while maintaining low-complexity encoding and decoding. Our findings highlight the effectiveness and practicality of deep-polar codes for short blocklength transmission scenarios in 6G.

IEEE Globecom Workshops (GC Wkshps)•Dec 4, 2023•5 citations

Mutual-Information-Based Successive Cancellation List Decoding of Polar Codes

Shubham K. Jha, Kuntal Deka, Shilpa Rao

We present a novel successive cancellation list (SCL) decoding method for the polar codes based on the mutual-information values of the bit-channels. At short-to-medium blocklengths, only a certain fraction of the bit-channels get polarized. Usually the mutual-information values for the bit- channels are computed for the construction of the code. Using these available mutual-information values, we identify the information bits exhibiting full polarization and having high channel reliability. In the proposed mutual- information-based SCL (MI-SCL) decoder, only one emanating path is considered for such bits. This results in the reduction of the width of the decoding tree. Simulation results confirm the impressive performance of the MI-SCL decoder specially with concatenated cyclic redundancy check codes.

IEEE Vehicular Technology Conference•Apr 1, 2019•0 citations

Symbol-based successive cancellation list decoder for polar codes

Chenrong Xiong, Jun Lin, Zhiyuan Yan

Polar codes is promising because they can provably achieve the channel capacity while having an explicit construction method. Lots of work have been done for the bit-based decoding algorithm for polar codes. In this paper, generalized symbol-based successive cancellation (SC) and SC list decoding algorithms are discussed. A symbol-based recursive channel combination relationship is proposed to calculate the symbol-based channel transition probability. This proposed method needs less additions than the maximum-likelihood decoder used by the existing symbol-based polar decoding algorithm. In addition, a two-stage list pruning network is proposed to simplify the list pruning network for the symbol-based SC list decoding algorithm.

arXiv:1405.4957•SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems•Oct 1, 2014•19 citations

Permutation Decoding of Polar Codes

Mikhail Kamenev, Yulia Kameneva, Oleg Kurmaev +1 more

A new permutation decoding approach for polar codes is presented. The proposed decoder can be used to achieve the error correction performance of a successive cancellation list (SCL) decoder, while it can either improve latency of the SCL decoder or decrease its hardware complexity. As opposed to the SCL algorithm, the proposed permutation algorithm can be implemented without sorting operation. It is shown that the error correction performance of the algorithm is similar to that of the SCL decoder for polar codes. Moreover, a new construction aiming to improve the error correction performance of polar codes under the proposed algorithm is presented.

arXiv:1901.05459•International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY)•Oct 1, 2019•32 citations

Symbol-Based Successive Cancellation List Decoder for Polar Codes

Chenrong Xiong, Jun Ting Lin, Zhiyuan Yan

Abstract—Polar codes is promising because they can provably achieve the channel capacity while having an explicit construc-tion method. Lots of work have been done for the bit-based decoding algorithm for polar codes. In this paper, generalized symbol-based successive cancellation (SC) and SC list decoding algorithms are discussed. A symbol-based recursive channel combination relationship is proposed to calculate the symbol-based channel transition probability. This proposed method needs less additions than the maximum-likelihood decoder used by the existing symbol-based polar decoding algorithm. In addition, a two-stage list pruning network is proposed to simplify the list pruning network for the symbol-based SC list decoding algorithm. Index Terms—Error control codes, polar codes, successive cancellation decoding, list decoding I.

•Aug 16, 2016•18 citations
Linear codes constructed using a polarization transformation followed by short blocklength sub-codes are proposed. Decoding is realized by the successive cancellation algorithm combined with standard optimal or non-optimal decoding of the sub-codes. List successive cancellation decoding can also be used. We demonstrate gains compared to standard successive cancellation of polar codes for short blocklength codes.
This paper aims to take advantage of the performances of polar decoding techniques for the benefit of binary linear block codes (BLBCs) with the main objective is to study the performances of the SSCL decoding for short-length BLBCs. Polar codes are one of the most recent error-correcting codes to be invented, and they have been mathematically demonstrated to be able to correct all errors under a specific situation, using the successive-cancellation decoder. However, their performances for real-time wireless communications at short block lengths remain less attractive. To take advantage of the performance of these codes in favor of error correction codes of short block length, an adaptation of the simplified successive-cancellation list as a decoder for polar codes for the benefit of short block length binary linear block codes is presented in this paper. This adaptation makes it possible to take advantage of the performances of less complex decoding methods for polar codes for BLBCs with latency and complexity optimization of the standard successive-cancellation list decoder. The experiment shows that the method can achieve the performances of the most famous order statistic decoder for binary linear block codes, which can achieve the performances of maximum-likelihood decoding with computational complexity and memory constraints.
In this paper, we put forth a novel class of pre-transformed polar codes, called as “deep-polar codes.” Encoding of deep-polar codes involves a series of multi-layered polar transformations. By applying these successive polar-based pre-transformations, deep-polar codes with an improved weight distribution are constructed with low encoding complexity. We also propose a low-complexity successive cancellation list decoding algorithm to effectively decode the deep-polar codes. This decoding algorithm harnesses the reverse process of the multi-layered pre-transformed encoding, referred to as “back propagation parity checks.” From simulations, we demonstrate that deep-polar codes outperform existing pre-transformed polar codes in terms of block error rates across various code rates and short blocklengths, while maintaining low-complexity encoding and decoding. Our findings highlight the effectiveness and practicality of deep-polar codes for short blocklength transmission scenarios in 6G.
We present a novel successive cancellation list (SCL) decoding method for the polar codes based on the mutual-information values of the bit-channels. At short-to-medium blocklengths, only a certain fraction of the bit-channels get polarized. Usually the mutual-information values for the bit- channels are computed for the construction of the code. Using these available mutual-information values, we identify the information bits exhibiting full polarization and having high channel reliability. In the proposed mutual- information-based SCL (MI-SCL) decoder, only one emanating path is considered for such bits. This results in the reduction of the width of the decoding tree. Simulation results confirm the impressive performance of the MI-SCL decoder specially with concatenated cyclic redundancy check codes.
Polar codes is promising because they can provably achieve the channel capacity while having an explicit construction method. Lots of work have been done for the bit-based decoding algorithm for polar codes. In this paper, generalized symbol-based successive cancellation (SC) and SC list decoding algorithms are discussed. A symbol-based recursive channel combination relationship is proposed to calculate the symbol-based channel transition probability. This proposed method needs less additions than the maximum-likelihood decoder used by the existing symbol-based polar decoding algorithm. In addition, a two-stage list pruning network is proposed to simplify the list pruning network for the symbol-based SC list decoding algorithm.
A new permutation decoding approach for polar codes is presented. The proposed decoder can be used to achieve the error correction performance of a successive cancellation list (SCL) decoder, while it can either improve latency of the SCL decoder or decrease its hardware complexity. As opposed to the SCL algorithm, the proposed permutation algorithm can be implemented without sorting operation. It is shown that the error correction performance of the algorithm is similar to that of the SCL decoder for polar codes. Moreover, a new construction aiming to improve the error correction performance of polar codes under the proposed algorithm is presented.
Abstract—Polar codes is promising because they can provably achieve the channel capacity while having an explicit construc-tion method. Lots of work have been done for the bit-based decoding algorithm for polar codes. In this paper, generalized symbol-based successive cancellation (SC) and SC list decoding algorithms are discussed. A symbol-based recursive channel combination relationship is proposed to calculate the symbol-based channel transition probability. This proposed method needs less additions than the maximum-likelihood decoder used by the existing symbol-based polar decoding algorithm. In addition, a two-stage list pruning network is proposed to simplify the list pruning network for the symbol-based SC list decoding algorithm. Index Terms—Error control codes, polar codes, successive cancellation decoding, list decoding I.