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 JOURNAL ON Advances in Information Sciences and Service Sciences

Improved Decoding Algorithms Based on Oscillation Log-likelihood Ratio for Low-density Parity Check Codes

DONG Zijian -, BI Xuyin -

Published Sep 30, 2011• 1 citation
Publisher

Abstract

Several decoding algorithms based on oscillation Log-likelihood ratio (LLR) for Lowdensity parity-check (LDPC) codes are investigated in this paper, based on which, an improved decoding algorithm which uses the accumulated LLR as the final bit decision merit is proposed. This approach improves the decoding performance with only a very small increase in storage and computation. Combined with normalized belief-propagation (BP), two algorithms are given, which are named as accumulate normalized BP (ACC-Nor-BP) and compare-add normalized BP (CA-Nor-BP). The storage requirements and computational complexity of ACC-Nor-BP is lower than that of CA-Nor-BP and CA-BP, but performance is close to the CA-Nor-BP and better than CA-BP; therefore ACC-Nor-BP algorithm is an effectively improved BP algorithm which has a good balance between performance and complexity.

DOI
10.4156/aiss.vol3.issue8.12

Related papers

Modified Belief Propagation Decoding Algorithm for Low-Density Parity Check Code Based on Oscillation

Satoshi Gounai, Tomoaki Otsuki Ohtsuki, T. Kaneko

A low-density parity check (LDPC) code with the belief propagation (BP) or the log-likelihood ratio belief propagation (LLR-BP) can achieve good bit error rate (BER) performance approaching the Shannon limit. When a parity check matrix of the LDPC code has the cycle, the BP and LLR-BP decoding algorithms achieve approximate maximum a posterior probability (MAP) decoding. Although the decoding algorithms are approximate MAP decoding, LDPC codes can achieve very good BER. For the short and middle length LDPC codes, BER and block error rate (BLER) performances are affected by cycle largely. In each iteration, the magnitudes of a posterior LLRs of some bits oscillate owing to cycles. The oscillation is the dominant error factor in the high Eb/Noregion for short and middle length LDPC codes. In this paper, we extend the definition of oscillation to extrinsic LLR (ex-LLR) derived in the bit node process and propose the modified LLR-BP and the modified UMP-BP decoding algorithms. To reduce effects of oscillating ex-LLRs on decoding, for oscillating ex-LLRs, we add the previous ex-LLR to the current ex-LLR. From the computer simulation, we show that for short and middle length LDPC codes, with a simple modification, our proposed decoding algorithms can improve the conventional LLR-BP and UMP-BP decoding algorithms. In particular, we show that the modified UMP-BP decoding algorithm with low complexity can achieve better BER and BLER than the conventional LLR-BP decoding algorithm

IEEE Vehicular Technology Conference•Sep 8, 2006•16 citations

A Decoding Algorithm Based on ex-LLR Oscillation for Low-Density Parity Check Codes

Yongqiang Gao

A great deal of experiment indicate that, during the decoding course of message passing for LDPC codes, a phenomenon of oscillating always exists in some variable messages named extrinsic log-likelihood rate (ex-LLR). It could arose bit error. This paper tells of why the magnitudes of a posterior LLRs and ex-LLRs of some bits would oscillated, and thus two improved algorithms are proposed, which could improve the decoding performance being deteriorated by ex-LLR oscillation. The computer simulation shows that, for short and middle length LDPC codes, the proposed algorithms could lower the error floor without increasing the complexity, so these two algorithms could achieve better BER and BLER than the conventional LLR-BP decoding algorithm.

Communications technology•Jan 1, 2009•0 citations

Reduced-Complexity Decoding of LDPC Codes

Reduced-Complexity Decoding of LDPC Codes Various log-likelihood-ratio-based belief-propagation (LLR- BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representation of the decoding computations are shown to achieve a reduction in complexity, by simplifying the check-node update or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from a performance, latency, computational complexity, and memory-requirement perspective.

IEEE Transactions on Communications•Jul 1, 2005•32 citations

Reduced-Complexity Decoding of LDPC Codes

J. Chen, Ajay Dholakia, Evangelos S. Eleftheriou +2 more

Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representations of the decoding computations are shown to achieve a reduction in complexity by simplifying the check-node update, or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from performance, latency, computational-complexity, and memory-requirement perspectives.

IEEE Transactions on Communications•Aug 1, 2005•964 citations

LLR Distribution Characteristics Based Hybrid Decoding Algorithm for LDPC Codes

Renzhi Wang, Kegang Pan, Xinting Wang

To improve the decoding speed and reduce the complexity of low-density parity-check (LDPC) codes, this paper proposes a hybrid LDPC decoding algorithm that combined with the distribution characteristics of log-likelihood ratio (LLR) of all variable node information before each iteration. During the process of decoding, there is a judgment based on an interval value and a threshold value to select the Belief Propagation (BP) algorithm or the Minimal Sum (MS) algorithm to decode, so the proposed hybrid algorithm effectively combines the excellent performance of BP algorithm and the simple operation of MS algorithm. The simulation results show that the algorithm can greatly reduce the computational complexity and achieve similar decoding performance compared with the BP algorithm.

IEEE International Conference on Communication Technology (ICCT)•Oct 28, 2020•1 citation

Improved LDPC decoding algorithms based on min-sum algorithm

Y.V. A. C. Kumara, Chandika Bandara Wavegedara

Low-Density Parity check (LDPC) codes offer high-performance error correction near the Shannon limit which employs large code lengths and some iterations in the decoding process. The conventional decoding algorithm of LDPC is the Log Likelihood Ratio based Belief Propagation (LLR BP) which is also known as the `Sum-Product algorithm' which gives the best decoding performance and requires the most computational complexity and implementations with increased hardware complexity. Another simpler variant of this algorithm is used which is known as `min-sum algorithm' which reduces computational complexity as well as hardware complexity but with reduced accuracy. This paper analyzes the reason min-sum algorithm is more prone to errors when compared to the sum-product algorithm, and puts forward two improved algorithms which improve the performance of the min-sum algorithm with comparable algorithmic complexity.

Moratuwa Engineering Research Conference (MERCon)•Apr 1, 2016•8 citations
Several decoding algorithms based on oscillation Log-likelihood ratio (LLR) for Lowdensity parity-check (LDPC) codes are investigated in this paper, based on which, an improved decoding algorithm which uses the accumulated LLR as the final bit decision merit is proposed. This approach improves the decoding performance with only a very small increase in storage and computation. Combined with normalized belief-propagation (BP), two algorithms are given, which are named as accumulate normalized BP (ACC-Nor-BP) and compare-add normalized BP (CA-Nor-BP). The storage requirements and computational complexity of ACC-Nor-BP is lower than that of CA-Nor-BP and CA-BP, but performance is close to the CA-Nor-BP and better than CA-BP; therefore ACC-Nor-BP algorithm is an effectively improved BP algorithm which has a good balance between performance and complexity.
A low-density parity check (LDPC) code with the belief propagation (BP) or the log-likelihood ratio belief propagation (LLR-BP) can achieve good bit error rate (BER) performance approaching the Shannon limit. When a parity check matrix of the LDPC code has the cycle, the BP and LLR-BP decoding algorithms achieve approximate maximum a posterior probability (MAP) decoding. Although the decoding algorithms are approximate MAP decoding, LDPC codes can achieve very good BER. For the short and middle length LDPC codes, BER and block error rate (BLER) performances are affected by cycle largely. In each iteration, the magnitudes of a posterior LLRs of some bits oscillate owing to cycles. The oscillation is the dominant error factor in the high Eb/Noregion for short and middle length LDPC codes. In this paper, we extend the definition of oscillation to extrinsic LLR (ex-LLR) derived in the bit node process and propose the modified LLR-BP and the modified UMP-BP decoding algorithms. To reduce effects of oscillating ex-LLRs on decoding, for oscillating ex-LLRs, we add the previous ex-LLR to the current ex-LLR. From the computer simulation, we show that for short and middle length LDPC codes, with a simple modification, our proposed decoding algorithms can improve the conventional LLR-BP and UMP-BP decoding algorithms. In particular, we show that the modified UMP-BP decoding algorithm with low complexity can achieve better BER and BLER than the conventional LLR-BP decoding algorithm
A great deal of experiment indicate that, during the decoding course of message passing for LDPC codes, a phenomenon of oscillating always exists in some variable messages named extrinsic log-likelihood rate (ex-LLR). It could arose bit error. This paper tells of why the magnitudes of a posterior LLRs and ex-LLRs of some bits would oscillated, and thus two improved algorithms are proposed, which could improve the decoding performance being deteriorated by ex-LLR oscillation. The computer simulation shows that, for short and middle length LDPC codes, the proposed algorithms could lower the error floor without increasing the complexity, so these two algorithms could achieve better BER and BLER than the conventional LLR-BP decoding algorithm.
Reduced-Complexity Decoding of LDPC Codes Various log-likelihood-ratio-based belief-propagation (LLR- BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representation of the decoding computations are shown to achieve a reduction in complexity, by simplifying the check-node update or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from a performance, latency, computational complexity, and memory-requirement perspective.
Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representations of the decoding computations are shown to achieve a reduction in complexity by simplifying the check-node update, or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from performance, latency, computational-complexity, and memory-requirement perspectives.
To improve the decoding speed and reduce the complexity of low-density parity-check (LDPC) codes, this paper proposes a hybrid LDPC decoding algorithm that combined with the distribution characteristics of log-likelihood ratio (LLR) of all variable node information before each iteration. During the process of decoding, there is a judgment based on an interval value and a threshold value to select the Belief Propagation (BP) algorithm or the Minimal Sum (MS) algorithm to decode, so the proposed hybrid algorithm effectively combines the excellent performance of BP algorithm and the simple operation of MS algorithm. The simulation results show that the algorithm can greatly reduce the computational complexity and achieve similar decoding performance compared with the BP algorithm.
Low-Density Parity check (LDPC) codes offer high-performance error correction near the Shannon limit which employs large code lengths and some iterations in the decoding process. The conventional decoding algorithm of LDPC is the Log Likelihood Ratio based Belief Propagation (LLR BP) which is also known as the `Sum-Product algorithm' which gives the best decoding performance and requires the most computational complexity and implementations with increased hardware complexity. Another simpler variant of this algorithm is used which is known as `min-sum algorithm' which reduces computational complexity as well as hardware complexity but with reduced accuracy. This paper analyzes the reason min-sum algorithm is more prone to errors when compared to the sum-product algorithm, and puts forward two improved algorithms which improve the performance of the min-sum algorithm with comparable algorithmic complexity.