© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

IET Communications

Different perspective and approach to implement adaptive normalised belief propagation-based decoding for low-density parity check codes

Panupat Poocharoen, Mario Edgardo Magana

Published Oct 16, 2012• 5 citations

Abstract

In this study, the authors propose an improved version of the min-sum algorithm for low-density parity check code decoding, which the authors call ‘adaptive normalised BP-based’ algorithm. Their decoder provides a compromise solution between belief propagation and the min-sum algorithms by adding an exponent offset to each variable node's intrinsic information in the check node update equation. The extrinsic information from the min-sum decoder is then adjusted by applying a negative power of the two scale factor, which can be easily implemented by right shifting the min-sum extrinsic information. The difference between their approach and other adaptive normalised min-sum decoders is that the authors select the normalisation scale factor using a clear analytical approach based on the underlying principles. The simulation results show that the proposed decoder outperforms the min-sum decoder and performs very close to the BP decoder with lower complexity.

DOI: 10.1049/iet-com.2011.0792

Related papers

A modified Min-Sum algorithm for low-density parity-check codes

Wei Han, Jianguo Huang, WU Fang-fei

A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.

Wireless Communications, Networking and Information Security•Jun 1, 2010•9 citations

Modified min-sum decoding algorithm for LDPC codes based on classified correction

Zhong Zhou, Yunzhou Li, Xiang Chen +2 more

In this paper, a modified min-sum decoding algorithm based on classified correction is proposed for low density parity check (LDPC) codes. Different from the single correction in the normalized belief propagation (BP)-based and offset BP-based algorithms [4], the proposed algorithm utilizes two corrections for both minimum and sub-minimum magnitudes of input messages in check nodes. These two correction factors can be obtained by analyzing the offset of updated messages in check nodes between the BP and the min-sum algorithms associated with check node degree. Simulation results show that the proposed algorithm can achieve performance very close to that of the BP algorithm. Furthermore, the FPGA implementation of this algorithm can reach a throughput of 200 Mbps at BER=10-6with lower complexity and fewer resources than the BP algorithm.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2008•9 citations

Reduced-complexity belief propagation decoding for low-density parity-check codes

Junli Li, X.D. Zhang

A novel dual-min-sum decoding algorithm for low-density parity-check codes is proposed. The proposed algorithm simplifies the check-node updates and thus reduces the computational complexity of the belief propagation (BP) algorithm significantly. Simulation results show that the proposed algorithm can achieve an error performance very close to that of the BP algorithm.

Electronics Letters•Jan 30, 2008•12 citations

New Min-sum LDPC Decoding Algorithm Using SNR-Considered Adaptive Scaling Factors

Yongmin Jung, Yunho Jung, Seongjoo Lee +1 more

This paper proposes a new min-sum algorithm for low-density parity-check decoding. In this paper, we first define the negative and positive effects of the received signal-to-noise ratio (SNR) in the min-sum decoding algorithm. To improve the performance of error correction by considering the negative and positive effects of the received SNR, the proposed algorithm applies adaptive scaling factors not only to extrinsic information but also to a received log-likelihood ratio. We also propose a combined variable and check node architecture to realize the proposed algorithm with low complexity. The simulation results show that the proposed algorithm achieves up to 0.4 dB coding gain with low complexity compared to existing min-sum-based algorithms.

ETRI Journal•Mar 19, 2014•7 citations

A modified Offset Min-Sum decoding algorithm for LDPC codes

Meng Xu, Jianhui Wu, Meng Zhang

In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is presented. In this modified algorithm, the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized Min-Sum algorithm. As a result, the offset factor in our modified algorithm can be calculated adaptively and more efficiently according to the previous decoding procedure, which can minimize the decoding degradation compared with the Belief Propagation decoding algorithm. The simulation results show that, compared with the original Offset Min-Sum decoding algorithm, our modified algorithm can achieve noticeable performance improvement with minor extra hardware complexity. For example, when BER is 10−5, our algorithm can achieve 0.1dB and 0.2dB decoding gain over Offset Min-Sum algorithm for regular and irregular LDPC codes respectively.

•Jul 1, 2010•29 citations

Efficient LDPC Decoding Algorithm Based on Min-sum

Jingao Liu

To improve the decoding performance of Low Density Parity Check(LDPC) code,an efficient decoding algorithm based on min-sum algorithm is proposed. The proposed algorithm analyzes the check node update equation and at the view of probability to form an approximation min-sum equation. It adopts a dynamic normalization factor to improve the decoding performance. Detailed simulation results and comparisons with Belief Propagation(BP) algorithm show that,with little decoding performance loss,the proposed algorithm not only decreases computational load,but also improves decoding efficiency.

Jisuanji gongcheng•Jan 1, 2009•0 citations

In this study, the authors propose an improved version of the min-sum algorithm for low-density parity check code decoding, which the authors call ‘adaptive normalised BP-based’ algorithm. Their decoder provides a compromise solution between belief propagation and the min-sum algorithms by adding an exponent offset to each variable node's intrinsic information in the check node update equation. The extrinsic information from the min-sum decoder is then adjusted by applying a negative power of the two scale factor, which can be easily implemented by right shifting the min-sum extrinsic information. The difference between their approach and other adaptive normalised min-sum decoders is that the authors select the normalisation scale factor using a clear analytical approach based on the underlying principles. The simulation results show that the proposed decoder outperforms the min-sum decoder and performs very close to the BP decoder with lower complexity.

A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.

In this paper, a modified min-sum decoding algorithm based on classified correction is proposed for low density parity check (LDPC) codes. Different from the single correction in the normalized belief propagation (BP)-based and offset BP-based algorithms [4], the proposed algorithm utilizes two corrections for both minimum and sub-minimum magnitudes of input messages in check nodes. These two correction factors can be obtained by analyzing the offset of updated messages in check nodes between the BP and the min-sum algorithms associated with check node degree. Simulation results show that the proposed algorithm can achieve performance very close to that of the BP algorithm. Furthermore, the FPGA implementation of this algorithm can reach a throughput of 200 Mbps at BER=10-6with lower complexity and fewer resources than the BP algorithm.

This paper proposes a new min-sum algorithm for low-density parity-check decoding. In this paper, we first define the negative and positive effects of the received signal-to-noise ratio (SNR) in the min-sum decoding algorithm. To improve the performance of error correction by considering the negative and positive effects of the received SNR, the proposed algorithm applies adaptive scaling factors not only to extrinsic information but also to a received log-likelihood ratio. We also propose a combined variable and check node architecture to realize the proposed algorithm with low complexity. The simulation results show that the proposed algorithm achieves up to 0.4 dB coding gain with low complexity compared to existing min-sum-based algorithms.

In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is presented. In this modified algorithm, the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized Min-Sum algorithm. As a result, the offset factor in our modified algorithm can be calculated adaptively and more efficiently according to the previous decoding procedure, which can minimize the decoding degradation compared with the Belief Propagation decoding algorithm. The simulation results show that, compared with the original Offset Min-Sum decoding algorithm, our modified algorithm can achieve noticeable performance improvement with minor extra hardware complexity. For example, when BER is 10−5, our algorithm can achieve 0.1dB and 0.2dB decoding gain over Offset Min-Sum algorithm for regular and irregular LDPC codes respectively.

To improve the decoding performance of Low Density Parity Check(LDPC) code,an efficient decoding algorithm based on min-sum algorithm is proposed. The proposed algorithm analyzes the check node update equation and at the view of probability to form an approximation min-sum equation. It adopts a dynamic normalization factor to improve the decoding performance. Detailed simulation results and comparisons with Belief Propagation(BP) algorithm show that,with little decoding performance loss,the proposed algorithm not only decreases computational load,but also improves decoding efficiency.