Abstract In this letter, a modified message passing algorithm to prevent short cycles in the factor graph is proposed and combined with a relaxation technique to improve the performance of cyclic redundancy check aided belief propagation decoding for polar codes. Numerical results show that the proposed scheme can achieve a 0.7 dB coding gain, for the code rate of 0.5 at the block error rate of 10 −5 with a comparable average number of iterations over the pure belief propagation decoding scheme when the code block length is 1024.Abstract In this letter, a modified message passing algorithm to prevent short cycles in the factor graph is proposed and combined with a relaxation technique to improve the performance of cyclic redundancy check aided belief propagation decoding for polar codes. Numerical results show that the proposed scheme can achieve a 0.7 dB coding gain, for the code rate of 0.5 at the block error rate of 10 −5 with a comparable average number of iterations over the pure belief propagation decoding scheme when the code block length is 1024.

Electronics LettersApr 22, 20213 citations

Adaptive Belief Propagation Decoding of CRC Concatenated NR LDPC and Polar Codes

Mingyang Zhu, Ming Jiang, Chunming Zhao

In this paper, we propose a modified adaptive belief propagation (ABP) algorithm, which is referred to as the random ABP (R-ABP) algorithm, for decoding short channel codes adopted in the fifth generation (5G) New Radio (NR) wireless systems. Based on the cyclic redundancy check (CRC) concatenation structure of 5G channel codes, we can take partial or even all CRC bits into iterative R-ABP decoding to improve the error correction performance, while the error detection capability can still be guaranteed by the remaining CRC bits and a proposed threshold-based acceptance criterion. We call this improved R-ABP decoding the threshold-and-CRC-aided R-ABP (TCA-R-ABP) decoding. The simulation results show that our proposed TCA-R-ABP algorithm outperforms the state-of-the-art decoding algorithms for many 5G low-density parity-check (LDPC) and polar codes. Moreover, the proposed TCA-R-ABP algorithm leads to a unified decoder for LDPC and polar codes, which has the potential to be a lower-complexity decoder over the combination of the belief propagation (BP) and CRC-aided successive cancellation list (CA-SCL) decoders.In this paper, we propose a modified adaptive belief propagation (ABP) algorithm, which is referred to as the random ABP (R-ABP) algorithm, for decoding short channel codes adopted in the fifth generation (5G) New Radio (NR) wireless systems. Based on the cyclic redundancy check (CRC) concatenation structure of 5G channel codes, we can take partial or even all CRC bits into iterative R-ABP decoding to improve the error correction performance, while the error detection capability can still be guaranteed by the remaining CRC bits and a proposed threshold-based acceptance criterion. We call this improved R-ABP decoding the threshold-and-CRC-aided R-ABP (TCA-R-ABP) decoding. The simulation results show that our proposed TCA-R-ABP algorithm outperforms the state-of-the-art decoding algorithms for many 5G low-density parity-check (LDPC) and polar codes. Moreover, the proposed TCA-R-ABP algorithm leads to a unified decoder for LDPC and polar codes, which has the potential to be a lower-complexity decoder over the combination of the belief propagation (BP) and CRC-aided successive cancellation list (CA-SCL) decoders.

IEEE Transactions on CommunicationsJun 20, 202213 citations

A Stage-Combined Belief Propagation Decoder for Polar Codes

Jin Sha, Jingbo Liu, Jun Ting Lin +1 more

Journal of Signal Processing SystemsOct 7, 20168 citations

Enhanced Belief Propagation Polar Decoder for Finite Lengths

Shajeel Iqbal, GoangSeog Choi

In this paper, we discuss the belief propagation decoding algorithm for polar codes. The performance of Polar codes for shorter lengths is not satisfactory. Motivated by this, we propose a novel technique to improve its performance at short lengths. We showed that the probability of messages passed along the factor graph of polar codes, can be increased by multiplying the current message of nodes with their previous message. This is like a feedback path in which the present signal is updated by multiplying with its previous signal. Thus the experimental results show that performance of belief propagation polar decoder can be improved using this proposed technique. Simulation results in binary-input additive white Gaussian noise channel (BI-AWGNC) show that the proposed belief propagation polar decoder can provide significant gain of 2 dB over the original belief propagation polar decoder with code rate 0.5 and code length 128 at the bit error rate (BER) of $10^{-4}$ .In this paper, we discuss the belief propagation decoding algorithm for polar codes. The performance of Polar codes for shorter lengths is not satisfactory. Motivated by this, we propose a novel technique to improve its performance at short lengths. We showed that the probability of messages passed along the factor graph of polar codes, can be increased by multiplying the current message of nodes with their previous message. This is like a feedback path in which the present signal is updated by multiplying with its previous signal. Thus the experimental results show that performance of belief propagation polar decoder can be improved using this proposed technique. Simulation results in binary-input additive white Gaussian noise channel (BI-AWGNC) show that the proposed belief propagation polar decoder can provide significant gain of 2 dB over the original belief propagation polar decoder with code rate 0.5 and code length 128 at the bit error rate (BER) of $10^{-4}$ .

Journal of the Korea Society of Digital Industry and Information ManagementSep 30, 20150 citations

Belief Propagation Decoding for Polar Codes Over Insertion-Deletion-Substitution Channels

Zhiyue Ji, Gaoxian Liu, Yuan Liu

IEEE Communications LettersJan 1, 20260 citations

10^{-4}