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 International Conference on Computer and Communications (ICCC)

Neural Network Aided SC Decoder for Polar Codes

Jie Gao, Rongke Liu

Published Dec 1, 2018• 6 citations
Publisher

Abstract

Theoretically, conventional decoders for polar codes can be entirely replaced by neural network (NN) with enough size and enough training, which called NN decoder. But the exponentially increasing training complexity becomes unacceptable when information length increases, which means only decoders for short codes can be trained practically. However, a successive cancellation (SC) decoder for long polar codes can be divided into several SC decoders for short codes, which can be replaced by several short codes NN decoders, then the whole decoder becomes our NN aided SC (NNSC) decoder. Besides, we defined Universal Set of NN, which can be combined into NNSC decoders for any long polar codes. In this paper, the main purpose of constructing NNSC decoder is increasing decoding efficiency of polar codes by taking advantage of NN, and in the meantime ensuring an acceptable performance compared to conventional decoding algorithms.

DOI
10.1109/compcomm.2018.8780605

Related papers

Improved Polar Decoder Utilizing Neural Network in Fast Simplified Successive-Cancellation Decoding

Jiaxin Fang, Chunwu Liu

Polar codes using successive-cancellation decoding always suffer from high latency for its serial nature. Fast simplified successive-cancellation decoding algorithm improves the situation in theoretically but not performs well as expected in practical for the workload of nodes identification and the existence of many short blocks. Meanwhile, Neural network (NN) based decoders have appeared as potential candidates to replace conventional decoders for polar codes. But the exponentially increasing training complexity with information bits is unacceptable which means it is only suitable for short codes. In this paper, we present an improvement that increases decoding efficiency without degrading the error-correction performance. The long polar codes are divided into several sub-blocks, some of which can be decoded adopting fast maximum likelihood decoding method and the remained parts are replaced by several short codes NN decoders. The result shows that time steps the proposed algorithm need only equal to 79.8% of fast simplified successive-cancellation decoders require. Moreover, it has up to 21.2 times faster than successive-cancellation decoding algorithm. More importantly, the proposed algorithm decreases the hardness when applying in some degree.

Journal of Computer and Communications•Jan 1, 2020•2 citations

Neural Network Based Successive Cancellation Decoding Algorithm for Polar Codes in URLLC

Ruiyi Zhang, Fangfang Liu, Zhimin Zeng +2 more

Polar codes are considered as a competitive candidate for 5G ultra-reliable and low-latency communication (URLLC) channel codes, but its strict latency and reliability requirements pose signicant challenges to the existing decoding schemes, especially in terms of decoding latency. In this paper, we propose a neural network based successive cancellation (NN-SC) decoding algorithm. In the proposed algorithm, neural networks are used to replace the local decoders for rate-R constituent codes because of their one-shot decoding capacity, which greatly reduce the decoding latency and algorithmic complexity. The simulation results indicate that the NN-SC decoding algorithm can achieve comparable reliability performance against the successive cancellation (SC) decoding for a polar code of length 128 and rate 1/6, while reducing the decoding latency by 65.2% when compared with the simplified SC decoding. In addition, for two conventional decoding algorithms: SC and belief propagation (BP) decoding, the proposed algorithm can further reduce the decoding latency by 22.8% and 13.8%, respectively.

International Symposium on Wireless Communication Systems•Aug 1, 2019•4 citations

Neural Successive Cancellation List Decoding of Polar Codes

Stefano Negrini, Velio Tralli

Neural Network Decoders (NNDs) have been recently considered and investigated as an alternative to the classical algorithms for decoding Polar Codes. In particular, a class of partitioned decoders has been proposed where modified Successive Cancellation (SC) or Belief Propagation (BP) algorithms exploit the neural network decoding of short sublocks. Although NNDs work as one-shot decoders with small decoding latency, the performance of these decoders, in comparison with classic approaches, still suffers from some losses; this fact limits their application to codes with short/medium length. In this article we introduce the novel Neural Successive Cancellation List (NSCL) decoder, as a partitioned version of the SC decoder operating on a list of L multiple decoding candidates that are built with the decoded sub-blocks obtained from a set of NNDs working in parallel at each partition. This decoder significantly improves the BER performance of the non-list version under the same code length. Hence, it reduces the intrinsic loss of performance given by the use of NNDs and allows the application of NN-based decoding to longer codewords.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Aug 1, 2020•0 citations

Neural-Network-Assisted Polar Code Decoding Schemes

Hengyan Liu, Limin Zhang, Wenjun Yan +1 more

The traditional fast successive-cancellation (SC) decoding algorithm can effectively reduce the decoding steps, but the decoding adopts a sub-optimal algorithm, so it cannot improve the bit error performance. In order to improve the bit error performance while maintaining low decoding steps, we introduce a neural network subcode that can achieve optimal decoding performance and combine it with the traditional fast SC decoding algorithm. While exploring how to combine neural network node (NNN) with R1, R0, single-parity checks (SPC), and Rep, we find that the decoding failed sometimes when the NNN was not the last subcode. To solve the problem, we propose two neural network-assisted decoding schemes: a key-bit-based subcode NN-assisted decoding (KSNNAD) scheme and a last subcode NN-assisted decoding (LSNNAD) scheme. The LSNNAD scheme recognizes the last subcode as an NNN, and the NNN with nearly optimal decoding performance gives rise to some performance improvements. To further improve performance, the KSNNAD scheme recognizes the subcode with a key bit as an NNN and changes the training data and label accordingly. Computer simulation results confirm that the two schemes can effectively reduce the decoding steps, and their bit error rates (BERs) are lower than those of the successive-cancellation decoder (SCD).

Applied Sciences•Dec 11, 2022•7 citations

Scaling Deep Learning-Based Decoding of Polar Codes via Partitioning

Sebastian Cammerer, Tobias Gruber, Jakob Hoydis +1 more

The training complexity of deep learning-based channel decoders scales exponentially with the codebook size and therefore with the number of information bits. Thus, neural network decoding (NND) is currently only feasible for very short block lengths. In this work, we show that the conventional iterative decoding algorithm for polar codes can be enhanced when sub-blocks of the decoder are replaced by neural network (NN) based components. Thus, we partition the encoding graph into smaller sub-blocks and train them individually, closely approaching maximum a posteriori (MAP) performance per sub-block. These blocks are then connected via the remaining conventional belief propagation decoding stage(s). The resulting decoding algorithm is non-iterative and inherently enables a highlevel of parallelization, while showing a competitive bit error rate (BER) performance. We examine the degradation through partitioning and compare the resulting decoder to state-of-the art polar decoders such as successive cancellation list and belief propagation decoding.

Globecom•Dec 1, 2017•203 citations

ANN Based Adaptive Successive Cancellation List Decoder for Polar Codes

Wenqing Song, Yuxiang Fu, Qinyu Chen +2 more

Combined with cyclic redundancy check (CRC), SC list (SCL) decoder can achieve outstanding error correction performance, which is more obvious with increasing list size. However, the corresponding decoding complexity and latency increase with the list size. To this end, the selection of list size becomes essential for practical applications. A new artificial neural network (ANN) based framework is proposed in this paper to design a hardware-friendly adaptive SCL (DL-ASCL) decoder. First, the list size at each stage is predicted by an ANN predictor. The performance achieved based on the proposed DL-ASCL algorithm is close to the optimal SCL decoder with the same list size, especially in the high signal-to-noise ratio (SNR) region. Meanwhile, the computational complexity is significantly reduced compared with the conventional ones. Numerical results have demonstrated that the proposed deep learning based adaptive SCL decoder can achieve 56% computational complexity reduction compared with the conventional SCL decoder for the polar code with length 128 and rate 1/2. The hardware architecture of the adaptive SCL decoder based on the predicted list size is proposed and the folding technique is also adopted, which helps reduce the hardware cost by about 25%.

IEEE International Conference on ASIC (ASICON)•Oct 1, 2019•9 citations
Theoretically, conventional decoders for polar codes can be entirely replaced by neural network (NN) with enough size and enough training, which called NN decoder. But the exponentially increasing training complexity becomes unacceptable when information length increases, which means only decoders for short codes can be trained practically. However, a successive cancellation (SC) decoder for long polar codes can be divided into several SC decoders for short codes, which can be replaced by several short codes NN decoders, then the whole decoder becomes our NN aided SC (NNSC) decoder. Besides, we defined Universal Set of NN, which can be combined into NNSC decoders for any long polar codes. In this paper, the main purpose of constructing NNSC decoder is increasing decoding efficiency of polar codes by taking advantage of NN, and in the meantime ensuring an acceptable performance compared to conventional decoding algorithms.
Polar codes using successive-cancellation decoding always suffer from high latency for its serial nature. Fast simplified successive-cancellation decoding algorithm improves the situation in theoretically but not performs well as expected in practical for the workload of nodes identification and the existence of many short blocks. Meanwhile, Neural network (NN) based decoders have appeared as potential candidates to replace conventional decoders for polar codes. But the exponentially increasing training complexity with information bits is unacceptable which means it is only suitable for short codes. In this paper, we present an improvement that increases decoding efficiency without degrading the error-correction performance. The long polar codes are divided into several sub-blocks, some of which can be decoded adopting fast maximum likelihood decoding method and the remained parts are replaced by several short codes NN decoders. The result shows that time steps the proposed algorithm need only equal to 79.8% of fast simplified successive-cancellation decoders require. Moreover, it has up to 21.2 times faster than successive-cancellation decoding algorithm. More importantly, the proposed algorithm decreases the hardness when applying in some degree.
Polar codes are considered as a competitive candidate for 5G ultra-reliable and low-latency communication (URLLC) channel codes, but its strict latency and reliability requirements pose signicant challenges to the existing decoding schemes, especially in terms of decoding latency. In this paper, we propose a neural network based successive cancellation (NN-SC) decoding algorithm. In the proposed algorithm, neural networks are used to replace the local decoders for rate-R constituent codes because of their one-shot decoding capacity, which greatly reduce the decoding latency and algorithmic complexity. The simulation results indicate that the NN-SC decoding algorithm can achieve comparable reliability performance against the successive cancellation (SC) decoding for a polar code of length 128 and rate 1/6, while reducing the decoding latency by 65.2% when compared with the simplified SC decoding. In addition, for two conventional decoding algorithms: SC and belief propagation (BP) decoding, the proposed algorithm can further reduce the decoding latency by 22.8% and 13.8%, respectively.
Neural Network Decoders (NNDs) have been recently considered and investigated as an alternative to the classical algorithms for decoding Polar Codes. In particular, a class of partitioned decoders has been proposed where modified Successive Cancellation (SC) or Belief Propagation (BP) algorithms exploit the neural network decoding of short sublocks. Although NNDs work as one-shot decoders with small decoding latency, the performance of these decoders, in comparison with classic approaches, still suffers from some losses; this fact limits their application to codes with short/medium length. In this article we introduce the novel Neural Successive Cancellation List (NSCL) decoder, as a partitioned version of the SC decoder operating on a list of L multiple decoding candidates that are built with the decoded sub-blocks obtained from a set of NNDs working in parallel at each partition. This decoder significantly improves the BER performance of the non-list version under the same code length. Hence, it reduces the intrinsic loss of performance given by the use of NNDs and allows the application of NN-based decoding to longer codewords.
The traditional fast successive-cancellation (SC) decoding algorithm can effectively reduce the decoding steps, but the decoding adopts a sub-optimal algorithm, so it cannot improve the bit error performance. In order to improve the bit error performance while maintaining low decoding steps, we introduce a neural network subcode that can achieve optimal decoding performance and combine it with the traditional fast SC decoding algorithm. While exploring how to combine neural network node (NNN) with R1, R0, single-parity checks (SPC), and Rep, we find that the decoding failed sometimes when the NNN was not the last subcode. To solve the problem, we propose two neural network-assisted decoding schemes: a key-bit-based subcode NN-assisted decoding (KSNNAD) scheme and a last subcode NN-assisted decoding (LSNNAD) scheme. The LSNNAD scheme recognizes the last subcode as an NNN, and the NNN with nearly optimal decoding performance gives rise to some performance improvements. To further improve performance, the KSNNAD scheme recognizes the subcode with a key bit as an NNN and changes the training data and label accordingly. Computer simulation results confirm that the two schemes can effectively reduce the decoding steps, and their bit error rates (BERs) are lower than those of the successive-cancellation decoder (SCD).
The training complexity of deep learning-based channel decoders scales exponentially with the codebook size and therefore with the number of information bits. Thus, neural network decoding (NND) is currently only feasible for very short block lengths. In this work, we show that the conventional iterative decoding algorithm for polar codes can be enhanced when sub-blocks of the decoder are replaced by neural network (NN) based components. Thus, we partition the encoding graph into smaller sub-blocks and train them individually, closely approaching maximum a posteriori (MAP) performance per sub-block. These blocks are then connected via the remaining conventional belief propagation decoding stage(s). The resulting decoding algorithm is non-iterative and inherently enables a highlevel of parallelization, while showing a competitive bit error rate (BER) performance. We examine the degradation through partitioning and compare the resulting decoder to state-of-the art polar decoders such as successive cancellation list and belief propagation decoding.
Combined with cyclic redundancy check (CRC), SC list (SCL) decoder can achieve outstanding error correction performance, which is more obvious with increasing list size. However, the corresponding decoding complexity and latency increase with the list size. To this end, the selection of list size becomes essential for practical applications. A new artificial neural network (ANN) based framework is proposed in this paper to design a hardware-friendly adaptive SCL (DL-ASCL) decoder. First, the list size at each stage is predicted by an ANN predictor. The performance achieved based on the proposed DL-ASCL algorithm is close to the optimal SCL decoder with the same list size, especially in the high signal-to-noise ratio (SNR) region. Meanwhile, the computational complexity is significantly reduced compared with the conventional ones. Numerical results have demonstrated that the proposed deep learning based adaptive SCL decoder can achieve 56% computational complexity reduction compared with the conventional SCL decoder for the polar code with length 128 and rate 1/2. The hardware architecture of the adaptive SCL decoder based on the predicted list size is proposed and the folding technique is also adopted, which helps reduce the hardware cost by about 25%.