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 Conference on Wireless Communications and Signal Processing (WCSP)

A Low-Complexity Residual Neural Network based BP Decoder for Polar Codes

Yu‐Ting Huang, Meixiang Zhang, Yin Dou

Published Oct 21, 2020• 6 citations
Publisher

Abstract

With the development of communication technology, it is urgent to design channel decoding algorithms to maximize the high throughput and minimize the latency. As the capacity achieving polar codes are adopted by 5-th generation wireless system (5G), it is required to design efficient the decoding algorithms for polar codes with high performance and low complexity. Deep neural network (DNN)-based algorithms which have shown superiority in other fields, can obtain better performance using multi-scale belief propagation (BP) algorithm, whereas the decoding complexity needs to be decreased. We propose a residual neural network based belief propagation (ResNet- BP) algorithm to solve the inherent drawbacks in the existing methods, by reducing the number of variables in the network and reducing the complexity in terms of multiplication. Simulation results demonstrate that the proposed method can achieve the approximating performance of recurrent neural network-based belief propagation (RNN-BP) with a lower number of iterations.

DOI
10.1109/wcsp49889.2020.9299762

Related papers

Improved Recurrent Neural Network based BP Decoding Algorithm for Polar Codes

Xue-lu DENG, Da-qin PENG

In recent years, the emerging Deep Learning (DL) technology has made progress in the field of decoding. Current polar code neural network decoder has faster convergence speed and better Bit Error Rate (BER) performance than Belief Propagation (BP) decoding. However, it still has the problem of high computational complexity. Therefore, in order to improve this problem, this paper adopts the idea of improving information update in the iterative process, and proposes a Recurrent Neural Network (RNN) Offset Min-Sum (OMS) BP decoding algorithm that improves Left information update (RNN-OMSBP-L) . The simulation results show that, compared with the Deep Neural Network (DNN) BP(DNN-BP) decoding algorithm, this algorithm replaces all multiplications with a cost of 6.25% addition. Compared with the current optimized RNN OMS and approximate BP(RNN-OMS-BP) decoding algorithm, the decoding algorithm in this paper uses improved information to reduce 25% of the addition operations with almost no loss in BER performance, while saving part of the storage space overhead. Under the same BER performance, it reduces the number of iterations by 37.5%.

•Aug 1, 2022•0 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

Enhanced Learning For Recurrent Neural Network-Based Polar Decoder

Ziad Ibrahim, Yasmine A. H. Fahmy

Several researchers are interested in polar codes for the sake of their capacity which nearly catches memoryless channels capacity. They have been used as part of the 5G technology. Polar decoders like belief propagation decoders showed unfavorable performance during limited iterations. Nowadays, Machine-learning (ML) techniques are used to enhance the efficiency of polar codes decoders. Recurrent neural network belief propagation (RNN-BP) decoders proved better efficiency in a lower number of cycles. In this paper, a performance scheduling learning technique is proposed. This technique achieves a coding gain of 0.2 dB for the RNN-BP decoder at BER of 2*10−4. A new approach is also introduced in the quantization step. In this approach, the quantization is done after the learning process is finished instead of after each iteration. This approach fixes the issue of model convergence. These combined approaches show up to 0.45 dB improvement at BER of 2*10−4.

•Mar 29, 2022•10 citations

A BP-NN Decoding Algorithm for Polar Codes

Chen Wen, Jian Xiong, Lin Gui +1 more

Polar code is selected for the 5-th generation of wireless communication standard. Meanwhile, with the demand of low latency in 5G and great success in deep learning area, neural network decoder (NND) becomes a promising candidate for future decoder. However, NND is currently only feasible for very short code lengths. In this paper, we proposed a belief propagation-neural network (BP-NN) algorithm for polar codes based on partitioning. The core of our algorithm is replacing subblock of belief propagation (BP) decoder with NNDs, and using BP decoding framework to connect them. In addition, we also introduce a weight function to complete the message propagation process. Simulation results show the proposed algorithm reduces the decoding delay compared to the traditional BP algorithm and have a well bit error rate (BER) performance. At the same time, it also suitable for long polar codes.

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

FPGA Implementation of Recurrent Neural Network-Based Polar Decoder

Ziad Ibrahim, Yasmine A. H. Fahmy

Polar codes are part of the 5G technology enablers as they nearly achieve memoryless channels capacity. Recently, many researchers explored Machine-learning (ML) techniques to increase the effectiveness of polar codes decoders. Recurrent Neural Network Belief Propagation decoders (RNN-BP) demonstrated superior efficiency in fewer cycles than standard Polar decoders, as traditional Belief propagation decoders performed poorly throughout a limited number of iterations. In this paper, we present the first implementation of the RNN-BP on Field Programmable Gate Arrays (FPGA). Two implementations are presented in this paper. The first one uses a single processing unit, and the second one is enhanced by multiple processing units with a pipeline register. The multiple processing units’ design of RNN-BP shows much higher throughput which is 17x of belief propagation decoder implementation and 3x of the Soft-output CANcellation (SCAN) decoder implementation. We also achieved better BER than the two mentioned implementations 7. 08x than the original BP and 4. 5x better than the SCAN implementation. The combined memory and registers resource consumption in our design is less than the compared two implementations while consuming a larger number of look-up tables (LUTs).

International Japan-Africa Conference on Electronics, Communications, and Computations (JAC-ECC)•Dec 19, 2022•0 citations

Research on BP Decoding of Polar Codes Aided by Deep Learning

Chang Yun, Guiping Li

In recent years, polar codes under deep learning have become a research hotspot because of their outstanding decoding performance. The neural network-based polar codes confidence propagation decoding algorithm can improve the decoding performance significantly, but the computational complexity and delay of the neural network-based polar codes confidence propagation decoding algorithm still need to be improved. In this paper, the theory of polar codes coding and the traditional polar codes confidence propagation decoding algorithm are introduced. The polar codes confidence propagation decoding algorithm based on deep neural network and recurrent neural network and the advantages and disadvantages of different decoding algorithms are mainly discussed, and the computational complexity of these algorithms is analyzed. According to the offset minimum sum approximation and scaling offset minimum sum approximation, the polar codes confidence propagation decoding algorithm based on recurrent neural network is optimized. Simulation results show that, compared with the traditional polar codes confidence propagation decoding algorithm, the decoding algorithm improves the decoding performance, reduces the computational complexity and reduces the iteration times of the algorithm. Compared with the polar codes confidence propagation decoding algorithm based on deep neural network and recurrent neural network, the multiplication and memory overhead of the algorithm are greatly reduced while the decoding performance of the algorithm is guaranteed.

International Conference on Computer Network, Electronic and Automation (ICCNEA)•Sep 1, 2021•2 citations
With the development of communication technology, it is urgent to design channel decoding algorithms to maximize the high throughput and minimize the latency. As the capacity achieving polar codes are adopted by 5-th generation wireless system (5G), it is required to design efficient the decoding algorithms for polar codes with high performance and low complexity. Deep neural network (DNN)-based algorithms which have shown superiority in other fields, can obtain better performance using multi-scale belief propagation (BP) algorithm, whereas the decoding complexity needs to be decreased. We propose a residual neural network based belief propagation (ResNet- BP) algorithm to solve the inherent drawbacks in the existing methods, by reducing the number of variables in the network and reducing the complexity in terms of multiplication. Simulation results demonstrate that the proposed method can achieve the approximating performance of recurrent neural network-based belief propagation (RNN-BP) with a lower number of iterations.
In recent years, the emerging Deep Learning (DL) technology has made progress in the field of decoding. Current polar code neural network decoder has faster convergence speed and better Bit Error Rate (BER) performance than Belief Propagation (BP) decoding. However, it still has the problem of high computational complexity. Therefore, in order to improve this problem, this paper adopts the idea of improving information update in the iterative process, and proposes a Recurrent Neural Network (RNN) Offset Min-Sum (OMS) BP decoding algorithm that improves Left information update (RNN-OMSBP-L) . The simulation results show that, compared with the Deep Neural Network (DNN) BP(DNN-BP) decoding algorithm, this algorithm replaces all multiplications with a cost of 6.25% addition. Compared with the current optimized RNN OMS and approximate BP(RNN-OMS-BP) decoding algorithm, the decoding algorithm in this paper uses improved information to reduce 25% of the addition operations with almost no loss in BER performance, while saving part of the storage space overhead. Under the same BER performance, it reduces the number of iterations by 37.5%.
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.
Several researchers are interested in polar codes for the sake of their capacity which nearly catches memoryless channels capacity. They have been used as part of the 5G technology. Polar decoders like belief propagation decoders showed unfavorable performance during limited iterations. Nowadays, Machine-learning (ML) techniques are used to enhance the efficiency of polar codes decoders. Recurrent neural network belief propagation (RNN-BP) decoders proved better efficiency in a lower number of cycles. In this paper, a performance scheduling learning technique is proposed. This technique achieves a coding gain of 0.2 dB for the RNN-BP decoder at BER of 2*10−4. A new approach is also introduced in the quantization step. In this approach, the quantization is done after the learning process is finished instead of after each iteration. This approach fixes the issue of model convergence. These combined approaches show up to 0.45 dB improvement at BER of 2*10−4.
Polar code is selected for the 5-th generation of wireless communication standard. Meanwhile, with the demand of low latency in 5G and great success in deep learning area, neural network decoder (NND) becomes a promising candidate for future decoder. However, NND is currently only feasible for very short code lengths. In this paper, we proposed a belief propagation-neural network (BP-NN) algorithm for polar codes based on partitioning. The core of our algorithm is replacing subblock of belief propagation (BP) decoder with NNDs, and using BP decoding framework to connect them. In addition, we also introduce a weight function to complete the message propagation process. Simulation results show the proposed algorithm reduces the decoding delay compared to the traditional BP algorithm and have a well bit error rate (BER) performance. At the same time, it also suitable for long polar codes.
Polar codes are part of the 5G technology enablers as they nearly achieve memoryless channels capacity. Recently, many researchers explored Machine-learning (ML) techniques to increase the effectiveness of polar codes decoders. Recurrent Neural Network Belief Propagation decoders (RNN-BP) demonstrated superior efficiency in fewer cycles than standard Polar decoders, as traditional Belief propagation decoders performed poorly throughout a limited number of iterations. In this paper, we present the first implementation of the RNN-BP on Field Programmable Gate Arrays (FPGA). Two implementations are presented in this paper. The first one uses a single processing unit, and the second one is enhanced by multiple processing units with a pipeline register. The multiple processing units’ design of RNN-BP shows much higher throughput which is 17x of belief propagation decoder implementation and 3x of the Soft-output CANcellation (SCAN) decoder implementation. We also achieved better BER than the two mentioned implementations 7. 08x than the original BP and 4. 5x better than the SCAN implementation. The combined memory and registers resource consumption in our design is less than the compared two implementations while consuming a larger number of look-up tables (LUTs).
In recent years, polar codes under deep learning have become a research hotspot because of their outstanding decoding performance. The neural network-based polar codes confidence propagation decoding algorithm can improve the decoding performance significantly, but the computational complexity and delay of the neural network-based polar codes confidence propagation decoding algorithm still need to be improved. In this paper, the theory of polar codes coding and the traditional polar codes confidence propagation decoding algorithm are introduced. The polar codes confidence propagation decoding algorithm based on deep neural network and recurrent neural network and the advantages and disadvantages of different decoding algorithms are mainly discussed, and the computational complexity of these algorithms is analyzed. According to the offset minimum sum approximation and scaling offset minimum sum approximation, the polar codes confidence propagation decoding algorithm based on recurrent neural network is optimized. Simulation results show that, compared with the traditional polar codes confidence propagation decoding algorithm, the decoding algorithm improves the decoding performance, reduces the computational complexity and reduces the iteration times of the algorithm. Compared with the polar codes confidence propagation decoding algorithm based on deep neural network and recurrent neural network, the multiplication and memory overhead of the algorithm are greatly reduced while the decoding performance of the algorithm is guaranteed.