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

arXiv:2307.08004

For One-Shot Decoding: Self-supervised Deep Learning-Based Polar Decoder

Huiying Song, Yihao Luo, Fukuzawa, Yuma

Published Jul 16, 2023• 0 citations
arXivHTMLPDF

Abstract

We propose a self-supervised deep learning-based decoding scheme that enables one-shot decoding of polar codes. In the proposed scheme, rather than using the information bit vectors as labels for training the neural network (NN) through supervised learning as the conventional scheme did, the NN is trained to function as a bounded distance decoder by leveraging the generator matrix of polar codes through self-supervised learning. This approach eliminates the reliance on predefined labels, empowering the potential to train directly on the actual data within communication systems and thereby enhancing the applicability. Furthermore, computer simulations demonstrate that (i) the bit error rate (BER) and block error rate (BLER) performances of the proposed scheme can approach those of the maximum a posteriori (MAP) decoder for very short packets and (ii) the proposed NN decoder (NND) exhibits much superior generalization ability compared to the conventional one.

DOI
10.48550/arxiv.2307.08004

Related papers

On deep learning-based channel decoding

Tobias Gruber, Sebastian Cammerer, Jakob Hoydis +1 more

We revisit the idea of using deep neural networks for one-shot decoding of random and structured codes, such as polar codes. Although it is possible to achieve maximum a posteriori (MAP) bit error rate (BER) performance for both code families and for short codeword lengths, we observe that (i) structured codes are easier to learn and (ii) the neural network is able to generalize to codewords that it has never seen during training for structured, but not for random codes. These results provide some evidence that neural networks can learn a form of decoding algorithm, rather than only a simple classifier. We introduce the metric normalized validation error (NVE) in order to further investigate the potential and limitations of deep learning-based decoding with respect to performance and complexity.

Conference on Information Sciences and Systems•Mar 1, 2017•574 citations

On Deep Learning-Based Channel Decoding

Tobias Gruber, Sebastian Cammerer, Jakob Hoydis +1 more

We revisit the idea of using deep neural networks for one-shot decoding of random and structured codes, such as polar codes. Although it is possible to achieve maximum a posteriori (MAP) bit error rate (BER) performance for both code families and for short codeword lengths, we observe that (i) structured codes are easier to learn and (ii) the neural network is able to generalize to codewords that it has never seen during training for structured, but not for random codes. These results provide some evidence that neural networks can learn a form of decoding algorithm, rather than only a simple classifier. We introduce the metric normalized validation error (NVE) in order to further investigate the potential and limitations of deep learning-based decoding with respect to performance and complexity.

arXiv:1701.07738•Jan 26, 2017•42 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

Improved polar decoder based on deep learning

Weihong Xu, Zhizhen Wu, Yeong-Luh Ueng +2 more

Deep learning recently shows strong competitiveness to improve polar code decoding. However, suffering from prohibitive training and computation complexity, the conventional deep neural network (DNN) is only possible for very short code length. In this paper, the main problems of deep learning in decoding are well solved. We first present the multiple scaled belief propagation (BP) algorithm, aiming at obtaining faster convergence and better performance. Based on this, deep neural network decoder (NND) with low complexity and latency, is proposed for any code length. The training only requires a small set of zero codewords. Besides, its computation complexity is close to the original BP. Experiment results show that the proposed (64,32) NND with 5 iterations achieves even lower bit error rate (BER) than the 30-iteration conventional BP and (512, 256) NND also outperforms conventional BP decoder with same iterations. The hardware architecture of basic computation block is given and folding technique is also considered, saving about 50% hardware cost.

SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems•Oct 1, 2017•157 citations

A Graph-Neural-Network Decoder with MLP-based Processing Cells for Polar Codes

Xuran Song, Zhaoyang Zhang, Jue Wang +1 more

Compared with traditional decoders, the Neural Network Decoder (NND)has the advantages of being low-latency, high-throughput and one-shot. However, the conventional deep neural network decoder (DNND)usually suffers the computational mismatch and the lack of generalization capability. In this paper, we propose a novel Graph-Neural-Network Decoder for the popular Polar Codes, which is directly constructed based on the regular decoding graph of Polar Codes and by replacing each of its basic 2-by-2 polarization elements with a simple Multi-Layer-Perceptron (MLP)based processing cell. The resultant decoder, namely PC-GNND, is thus endowed with the ability to infer over the skeleton of the decoding graph and has a greatly improved generalization capability. Simulation results show that, the proposed PC-GNND is capable of learning the exact code structure as well as the channel noise very efficiently with only a tiny fraction of the entire codebook and achieving better performance than that of conventional NNDs with far less parameters and training epochs. Moreover, the PC-GNND trained in a particular block length can be scaled to another one for different block lengths after fine tuning, which significantly reduces the computational cost of training.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2019•3 citations

ATRNN: Using Seq2Seq Approach for Decoding Polar Codes

Aniket Dhok, Swapnil Bhole

Polar codes have been chosen by 3GPP as the official error-correcting codes in the control plane of 5G NR enhanced Mobile Broadband (eMBB) due to their low complexity decoding and near-DMC capacity achievement. Recently, deep learning methods have produced promising results in many fields, including linear and polar code decoding. Using end-to-end DL approach provides flexibility, thus empowering us to integrate powerful DL algorithms into channel decoders. In this paper, we propose a novel one-shot decoding framework for polar codes using Attention-based Recurrent Neural Network (ATRNN). Furthermore, we evaluate the decoding performance of ATRNN using bit error rate (BER) and compare it with the state-of-the-art techniques such as successive cancellation (SC).

International Conference on Communication Systems & Networks (COMSNETS)•Jan 1, 2020•2 citations
We propose a self-supervised deep learning-based decoding scheme that enables one-shot decoding of polar codes. In the proposed scheme, rather than using the information bit vectors as labels for training the neural network (NN) through supervised learning as the conventional scheme did, the NN is trained to function as a bounded distance decoder by leveraging the generator matrix of polar codes through self-supervised learning. This approach eliminates the reliance on predefined labels, empowering the potential to train directly on the actual data within communication systems and thereby enhancing the applicability. Furthermore, computer simulations demonstrate that (i) the bit error rate (BER) and block error rate (BLER) performances of the proposed scheme can approach those of the maximum a posteriori (MAP) decoder for very short packets and (ii) the proposed NN decoder (NND) exhibits much superior generalization ability compared to the conventional one.
We revisit the idea of using deep neural networks for one-shot decoding of random and structured codes, such as polar codes. Although it is possible to achieve maximum a posteriori (MAP) bit error rate (BER) performance for both code families and for short codeword lengths, we observe that (i) structured codes are easier to learn and (ii) the neural network is able to generalize to codewords that it has never seen during training for structured, but not for random codes. These results provide some evidence that neural networks can learn a form of decoding algorithm, rather than only a simple classifier. We introduce the metric normalized validation error (NVE) in order to further investigate the potential and limitations of deep learning-based decoding with respect to performance and complexity.
We revisit the idea of using deep neural networks for one-shot decoding of random and structured codes, such as polar codes. Although it is possible to achieve maximum a posteriori (MAP) bit error rate (BER) performance for both code families and for short codeword lengths, we observe that (i) structured codes are easier to learn and (ii) the neural network is able to generalize to codewords that it has never seen during training for structured, but not for random codes. These results provide some evidence that neural networks can learn a form of decoding algorithm, rather than only a simple classifier. We introduce the metric normalized validation error (NVE) in order to further investigate the potential and limitations of deep learning-based decoding with respect to performance and complexity.
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.
Deep learning recently shows strong competitiveness to improve polar code decoding. However, suffering from prohibitive training and computation complexity, the conventional deep neural network (DNN) is only possible for very short code length. In this paper, the main problems of deep learning in decoding are well solved. We first present the multiple scaled belief propagation (BP) algorithm, aiming at obtaining faster convergence and better performance. Based on this, deep neural network decoder (NND) with low complexity and latency, is proposed for any code length. The training only requires a small set of zero codewords. Besides, its computation complexity is close to the original BP. Experiment results show that the proposed (64,32) NND with 5 iterations achieves even lower bit error rate (BER) than the 30-iteration conventional BP and (512, 256) NND also outperforms conventional BP decoder with same iterations. The hardware architecture of basic computation block is given and folding technique is also considered, saving about 50% hardware cost.
Compared with traditional decoders, the Neural Network Decoder (NND)has the advantages of being low-latency, high-throughput and one-shot. However, the conventional deep neural network decoder (DNND)usually suffers the computational mismatch and the lack of generalization capability. In this paper, we propose a novel Graph-Neural-Network Decoder for the popular Polar Codes, which is directly constructed based on the regular decoding graph of Polar Codes and by replacing each of its basic 2-by-2 polarization elements with a simple Multi-Layer-Perceptron (MLP)based processing cell. The resultant decoder, namely PC-GNND, is thus endowed with the ability to infer over the skeleton of the decoding graph and has a greatly improved generalization capability. Simulation results show that, the proposed PC-GNND is capable of learning the exact code structure as well as the channel noise very efficiently with only a tiny fraction of the entire codebook and achieving better performance than that of conventional NNDs with far less parameters and training epochs. Moreover, the PC-GNND trained in a particular block length can be scaled to another one for different block lengths after fine tuning, which significantly reduces the computational cost of training.
Polar codes have been chosen by 3GPP as the official error-correcting codes in the control plane of 5G NR enhanced Mobile Broadband (eMBB) due to their low complexity decoding and near-DMC capacity achievement. Recently, deep learning methods have produced promising results in many fields, including linear and polar code decoding. Using end-to-end DL approach provides flexibility, thus empowering us to integrate powerful DL algorithms into channel decoders. In this paper, we propose a novel one-shot decoding framework for polar codes using Attention-based Recurrent Neural Network (ATRNN). Furthermore, we evaluate the decoding performance of ATRNN using bit error rate (BER) and compare it with the state-of-the-art techniques such as successive cancellation (SC).