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 Information Science, Computer Technology and Transportation (ISCTT)

A new LDPC decoding scheme based on BP and Gated Neural Network

Yong Liu, Xiaolin Liu, Zhongyi Ding, Yue Hu, Ling Zhao

Published Nov 1, 2020• 5 citations
Publisher

Abstract

In long wave communication scenarios, channel interferences lead to noise correlation. Since traditional belief propagation (BP) decoding algorithm is designed based on additive white Gaussian noise (AWGN), a performance cost will appear when it comes to correlated noise. In this paper, a new LDPC decoding scheme that applies to correlated Gaussian noise is proposed. We design a BP-gated neural network-BP structure to carry on two rounds of BP decoding with the second round based on optimized noise. By adopting gated neurons in typical NN, CNN, training performance is improved. Simulation shows that compared with BP decoding algorithm, the new decoding scheme outperforms traditional method by 0.5~0.61 dB when bit error rate is 10-6. This decoding scheme also works on pectinate noise with performance gain of 1.5 dB.

DOI
10.1109/isctt51595.2020.00066

Related papers

Iterative Decoding Algorithms Powered by Deep Learning

Dimitrije Jovanović, Predrag Ivaniš

In this paper, we analyze the performance of neural belief propagation (BP) decoding on the additive white Gaussian noise (AWGN) channel, compared to the traditional BP algorithm. Previous investigations have shown that assigning pre-trained weights to BP messages can significantly improve the decoding performance in case of high-density parity-check (HDPC) codes, by reducing the negative impact of short cycles. These weights are trained by a neural network whose structure matches the trellis of the decoder. Specifically, we show that medium-density paritycheck (MDPC) codes decoded with neural BP algorithm can achieve lower bit error rate versus HDPC codes with the same codeword length and the same code rate.

International Conference on Electrical, Electronic and Computing Engineering (IcETRAN)•Jun 9, 2025•0 citations

An modified beyond belief propagation algorithm over AWGN channel

Yibo Lv, Lin Wang

Recently one decoding algorithm called as beyond belief propagation (BP) algorithm for LDPC Codes is derived using the knowledge of trapping set and different from standard BP algorithm, whose performance outperforms that of the latter over binary symmetric channel (BSC). However, the former is not suitable for additive white Gaussian noise (AWGN) channel. In this paper how to improve bit error rate (BER) performance of Beyond BP Algorithm is investigated over AWGN channel. It is found that this algorithm can be modified through setting appropriate penalty factor and obtains better performance than BP one over AWGN channel. The simulation results show dependently on choosing penalty factor modified Beyond BP Algorithm outperforms BP one over AWGN channel in high signal noise rate (SNR) region or almost whole SNR one and there are some differences for different code rates. Concretely, for medium or low code rate proposed algorithm can obtain more performance gain relative to high one when short frame is used.

International Symposium on Communications and Information Technologies•Sep 1, 2013•2 citations

Noise Adaptive LDPC Decoding Using Expectation Propagation

Shuang Wang, Lijuan Cui, Samuel S. M. Cheng

Belief propagation (BP) is a powerful algorithm to decode low- density parity check (LDPC) codes over additive white Gaussian noise (AWGN) channels. However, the traditional BP algorithm cannot adapt efficiently to the statistical change of SNR in an AWGN channel. This paper proposes an adaptive scheme that incorporates expectation propagation (EP) into the BP based LDPC decoding process. The proposed scheme is able to perform online estimation of both stationary and time-varying SNR at the bit-level, and enhance the BP decoding performance simultaneously. Moreover, the proposed EP estimator shows a very fast convergence speed, and the additional computational overhead of the proposed decoder is less than 10% of the standard BP decoder.

Globecom•Dec 1, 2011•3 citations

Noise Adaptive LDPC Decoding Using Particle Filtering

Shuang Wang, Lijuan Cui, Samuel S. M. Cheng +3 more

Belief propagation (BP) is a powerful algorithm to decode low-density parity check (LDPC) codes over additive white Gaussian noise (AWGN) channels. However, the traditional BP algorithm cannot adapt efficiently to the statistical change of SNR in an AWGN channel. This paper proposes an adaptive scheme that incorporates a particle filtering (PF) algorithm into the BP based LDPC decoding process. The proposed scheme is capable to perform online estimation of time-varying SNR at the bit-level and enhance the BP decoding performance simultaneously.

IEEE Transactions on Communications•Jan 21, 2011•11 citations

A Neural Network-Based Compressive LDPC Decoder Design Over Correlated Noise Channel

Ying Li, Baoye Zhang, Bin Tan +2 more

To combat the correlated noise and utilize the non-equiprobability of the source, we propose a novel Low-density parity-check (LDPC) decoder design based on a priori information and neural network, which includes two neural networks, namely Correlated-Denoising Convolutional Neural Network (Correlated-DnCNN) and Belief Propagation-Deep Neural Network (BP-DNN), respectively. Correlated-DnCNN is used to remove the correlation of channel noise and reduce the noise power. BP-DNN is used to eliminate the harmful effect of short cycles of the Tanner graph and explore the priori information of the source. With the priori information to assist in initializing the input nodes of the BP-DNN network, we introduce compression capability to the LDPC, thus the proposed scheme can improve efficiency significantly when there is a large amount of compressible data in the physical layer. To train the Correlated-DnCNN and BP-DNN jointly, we design a new three-objective joint denoising-decoding loss function, which can not only guarantee the decoding performance, but also constrain the noise to conform to the normal distribution as much as possible, and improve the network convergence performance. Experiments show that the proposed decoding framework can remove the noise correlation, reduce the noise power, and improve the decoding performance effectively.

IEEE Transactions on Cognitive Communications and Networking•Feb 9, 2024•1 citation

BP-Maxwell Decoding Algorithm for LDPC Codes over AWGN Channels

Yi Fang, Jianwen Zhang, Lin Wang +1 more

Designing realizable Maximum Likelihood (ML) decoders for low-density parity-check (LDPC) codes has always been a challenging problem. Maxwell decoder is a well-known ML decoder for LDPC codes over a binary erasure channel (BEC). Based on the concept used in the Maxwell decoder, it may be possible to design near-ML decoders for LDPC codes over an additive white Gaussian noise (AWGN) channel. In this paper, we introduce a novel idea called channel transformation, which will be used as a bridge linking a BEC channel and an AWGN channel. With the transformation, we further propose a near-ML decoder for LDPC codes sent over an AWGN channel. The proposed near-ML decoder, combining a Belief Propagation (BP) decoder and a Maxwell decoder, is called the BP-Maxwell (BM) decoder. Simulation results show that compared with a BP decoder, the BM decoding algorithm can accomplish better frame error rates (FERs) by eliminating many of the error frames with a smaller percentage of error bits. Thus, the BM decoder is a step closer to the ML decoder compared with the BP decoder.

International Conference on Computational Intelligence and Software Engineering (CiSE)•Sep 1, 2010•5 citations
In long wave communication scenarios, channel interferences lead to noise correlation. Since traditional belief propagation (BP) decoding algorithm is designed based on additive white Gaussian noise (AWGN), a performance cost will appear when it comes to correlated noise. In this paper, a new LDPC decoding scheme that applies to correlated Gaussian noise is proposed. We design a BP-gated neural network-BP structure to carry on two rounds of BP decoding with the second round based on optimized noise. By adopting gated neurons in typical NN, CNN, training performance is improved. Simulation shows that compared with BP decoding algorithm, the new decoding scheme outperforms traditional method by 0.5~0.61 dB when bit error rate is 10-6. This decoding scheme also works on pectinate noise with performance gain of 1.5 dB.
In this paper, we analyze the performance of neural belief propagation (BP) decoding on the additive white Gaussian noise (AWGN) channel, compared to the traditional BP algorithm. Previous investigations have shown that assigning pre-trained weights to BP messages can significantly improve the decoding performance in case of high-density parity-check (HDPC) codes, by reducing the negative impact of short cycles. These weights are trained by a neural network whose structure matches the trellis of the decoder. Specifically, we show that medium-density paritycheck (MDPC) codes decoded with neural BP algorithm can achieve lower bit error rate versus HDPC codes with the same codeword length and the same code rate.
Recently one decoding algorithm called as beyond belief propagation (BP) algorithm for LDPC Codes is derived using the knowledge of trapping set and different from standard BP algorithm, whose performance outperforms that of the latter over binary symmetric channel (BSC). However, the former is not suitable for additive white Gaussian noise (AWGN) channel. In this paper how to improve bit error rate (BER) performance of Beyond BP Algorithm is investigated over AWGN channel. It is found that this algorithm can be modified through setting appropriate penalty factor and obtains better performance than BP one over AWGN channel. The simulation results show dependently on choosing penalty factor modified Beyond BP Algorithm outperforms BP one over AWGN channel in high signal noise rate (SNR) region or almost whole SNR one and there are some differences for different code rates. Concretely, for medium or low code rate proposed algorithm can obtain more performance gain relative to high one when short frame is used.
Belief propagation (BP) is a powerful algorithm to decode low- density parity check (LDPC) codes over additive white Gaussian noise (AWGN) channels. However, the traditional BP algorithm cannot adapt efficiently to the statistical change of SNR in an AWGN channel. This paper proposes an adaptive scheme that incorporates expectation propagation (EP) into the BP based LDPC decoding process. The proposed scheme is able to perform online estimation of both stationary and time-varying SNR at the bit-level, and enhance the BP decoding performance simultaneously. Moreover, the proposed EP estimator shows a very fast convergence speed, and the additional computational overhead of the proposed decoder is less than 10% of the standard BP decoder.
Belief propagation (BP) is a powerful algorithm to decode low-density parity check (LDPC) codes over additive white Gaussian noise (AWGN) channels. However, the traditional BP algorithm cannot adapt efficiently to the statistical change of SNR in an AWGN channel. This paper proposes an adaptive scheme that incorporates a particle filtering (PF) algorithm into the BP based LDPC decoding process. The proposed scheme is capable to perform online estimation of time-varying SNR at the bit-level and enhance the BP decoding performance simultaneously.
To combat the correlated noise and utilize the non-equiprobability of the source, we propose a novel Low-density parity-check (LDPC) decoder design based on a priori information and neural network, which includes two neural networks, namely Correlated-Denoising Convolutional Neural Network (Correlated-DnCNN) and Belief Propagation-Deep Neural Network (BP-DNN), respectively. Correlated-DnCNN is used to remove the correlation of channel noise and reduce the noise power. BP-DNN is used to eliminate the harmful effect of short cycles of the Tanner graph and explore the priori information of the source. With the priori information to assist in initializing the input nodes of the BP-DNN network, we introduce compression capability to the LDPC, thus the proposed scheme can improve efficiency significantly when there is a large amount of compressible data in the physical layer. To train the Correlated-DnCNN and BP-DNN jointly, we design a new three-objective joint denoising-decoding loss function, which can not only guarantee the decoding performance, but also constrain the noise to conform to the normal distribution as much as possible, and improve the network convergence performance. Experiments show that the proposed decoding framework can remove the noise correlation, reduce the noise power, and improve the decoding performance effectively.
Designing realizable Maximum Likelihood (ML) decoders for low-density parity-check (LDPC) codes has always been a challenging problem. Maxwell decoder is a well-known ML decoder for LDPC codes over a binary erasure channel (BEC). Based on the concept used in the Maxwell decoder, it may be possible to design near-ML decoders for LDPC codes over an additive white Gaussian noise (AWGN) channel. In this paper, we introduce a novel idea called channel transformation, which will be used as a bridge linking a BEC channel and an AWGN channel. With the transformation, we further propose a near-ML decoder for LDPC codes sent over an AWGN channel. The proposed near-ML decoder, combining a Belief Propagation (BP) decoder and a Maxwell decoder, is called the BP-Maxwell (BM) decoder. Simulation results show that compared with a BP decoder, the BM decoding algorithm can accomplish better frame error rates (FERs) by eliminating many of the error frames with a smaller percentage of error bits. Thus, the BM decoder is a step closer to the ML decoder compared with the BP decoder.