International Conference on Wireless Communications and Signal Processing (WCSP)

A BP-NN Decoding Algorithm for Polar Codes

Chen Wen, Jian Xiong, Lin Gui, Ling Zhang

Published Oct 1, 2019• 4 citations

Abstract

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.

DOI: 10.1109/wcsp.2019.8927910

Related papers

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.

GlobecomDec 1, 2017203 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 SystemsOct 1, 2017157 citations

Optimization and Improvement of BP Decoding Algorithm for Polar Codes Based on Deep Learning

Ge Li, Guiping Li

Abstract In order to solve the high latency problem of polar codes belief propagation decoding algorithm in the 5G and the dimension limitation problem of belief propagation decoding algorithm under deep learning, a multilayer perceptron belief propagation decoding (MLP-BP) algorithm based on partitioning idea is proposed. In this work, polar codes is decoded using neural networks in partitioning, and the right transfer message value of BP decoding algorithm is also set to complete the propagation process. Simulation results show that, compared with BP decoding algorithm, the proposed algorithm has better decoding performance, reducing the decoding latency, and it is also applicable to long polar codes.

International Journal of Advanced Network Monitoring and ControlsJun 1, 20230 citations

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

Yu‐Ting Huang, Meixiang Zhang, Yin Dou

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.

International Conference on Wireless Communications and Signal Processing (WCSP)Oct 21, 20206 citations

A Novel Decoding Scheme for Polar Code Using Convolutional Neural Network

Chen Wen, Jian Xiong, Lin Gui +2 more

Polar code is the first capacity-achieving channel coding scheme which has been selected for the next generation of wireless communication standard(5G). However, the traditional decoding schemes such as CA-SCL and BP algorithms cannot take into account both BER and latency performance. Inspired by the deep learning technology, we propose a scheme that combine convolutional neural network (CNN) with traditional Belief Propagation (BP) decoding. By exploiting noise correlation for channel decoding under colored noise environment, the proposed scheme can obtain a more accurate estimation of channel noise. We simulate the performance of the proposed scheme under BPSK and 4QAM modulation. For QAM modulation, a scheme that extend the conventional real-valued CNN technique to the complex-valued one is given. The results demonstrate that bit error rates (BER) performance can be improved after removing the estimated noise. Compare to the traditional Polar decoding schemes, the proposed scheme has better trade-off between BER and latency performance under colored noise environment.

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)Jun 1, 20197 citations

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, 20220 citations