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

Simplified a Posteriori Probability Calculation for Binary LDPC Codes

Latifa Mostari, Abdelmalik Taleb Ahmed

Published Oct 24, 2018• 1 citation
OpenAlex

Abstract

The LDPC (Low-Density Parity-Check) decoder must operate soft decisions calculated using: LLR (Log-Likelihood Ratio) or APP (A Posteriori Probability) according to the decoding algorithm used. The exact calculation of these decisions for high order constellations involves complicated operations. In this work, a method to simplify the APP calculation is introduced. It is programmed to adapt as perfectly as possible the transmission system to the channel type in question. This method leads to simplify the implementation of the transmission system. Simulation results show that, under the Gaussian channel, the simplified APP algorithm for 16-QAM achieves the same performance that obtained with the exact APP, while for 64-QAM we have a small performance degradation. The same simplified APP algorithm that used for the Gaussian channel can be applied, with minor operations added, for Rayleigh channel, and it shows a small performance loss with respect to the exact APP.

Related papers

Simplified APP Computation of High Order Constellations Combined with Non-Binary LDPC Decoders

Latifa Mostari, Abdennacer Bounoua, Abdelmalik Taleb Ahmed

Combining non-binary LDPC (Low-Density Parity-Check) codes and high order constellations, such as Quadrature Amplitude Modulations (QAM), is an effective way to improve the bandwidth efficiency. Since, the message exchanged in the LDPC decoder can be measured by the APP (A Priori Probability) or the LLR (Log-Likelihood Ratio), depending on the decoding algorithm type, the message at the decoder input that computed by the QAM must be using the same calculation. However, the number of operations performed by the QAM increases with the constellation order, and the calculation changes with the channel type. In this paper, we use simplified LLR computations, introduced for binary codes, to simplify the APP calculation of square-QAM-Gray demapping for APP-based non-binary LDPC decoders. Under Gaussian channel, the simplified APP calculation achieves the same performance that obtained with the exact APP computation. The same simplified APP calculation used for a Gaussian channel can be applied, with minor operations added, for Rayleigh channel, and it shows a small performance loss with respect to the exact APP computation. These simplifications simplify the combination of non-binary LDPC codes with QAM. With this method, it is easy to change a decoding algorithm based on the APP to an algorithm based on the LLR.

•Apr 25, 2019•1 citation

Decoding low-density parity check codes with normalized APP-based algorithm

Jinghu Chen, M.P.C. Fossorier

We propose a normalized a posteriori probability (APP) based algorithm for the decoding of low-density parity check (LDPC) codes. The normalized APP-based algorithm utilizes normalization to improve the accuracy of the soft values delivered by the simplified APP-based algorithm from one iteration to another during the iterative decoding, and can achieve very good tradeoff between decoding complexity and performance.

Globecom•Nov 13, 2002•55 citations

A low-complexity LDPC belief propagation decoding in high order M-QAM modulation

Feng Hu, Siqi Liu, Libiao Jin +1 more

Belief propagation (BP) algorithm is commonly used in soft decoding of Low Density Parity Check Code (LDPC). However, a significant disadvantage of this method is that the computational complexity is high in high order M-QAM modulation. This paper proposes an optimized algorithm to reduce the posterior probability calculation in soft decoding, which estimates an approximate decision point in the constellation map via channel equalization. Then a contractible constellation decision space is delimited by the approximate decision point and its surrounding points with the minimum European distance. Compared with the conventional soft decoding, simulation results show that the proposed algorithm can effectively reduce the computational complexity of BP decoding with tiny loss of the decoding accuracy. The proposed algorithm reduces nearly 96 percent of the computational complexity of posterior probability in the case of 256QAM modulation.

IEEE International Conference on Software Engineering and Service Science (ICSESS)•Nov 1, 2017•1 citation

Modified APP-Based Decoding Algorithm for Low-Density Parity Check Codes

Xinran Wang, Yan Zhang, Jinlei Chen

In this paper, a modified a posteriori probability (APP) based algorithm for the decoding of low- density parity-check (LDPC) codes is proposed. The modified APP-based algorithm utilizes an additional processing in the bit nodes to improve the accuracy instead of the check nodes normalization performed in normalized APP-based algorithm. The modified APP- based algorithm yields desirable trade-off between performance and decoding complexity.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2011•3 citations

Performance Comparison and Analysis of Two Decoding Algorithms for LDPC Codes

Ping Zhang

The performance of iterative decoding algorithm and iterative receiving algorithm for low-density parity-check (LDPC) code is studied, simplified formulas of computing pseudo log-likelihood-ratio for 64-QAM presented, performance difference of two decoding algorithms using density evolution technique with Gaussian approximation analyzed.

Beijing Youdian Xueyuan xuebao•Jan 1, 2004•0 citations

Density Evolution Analysis of Generalized Low-density Parity-check Codes under a Posteriori Probability Decoder

Chang, Dongxu, Qingqing Peng, Ma, Zhiming +2 more

In this study, the performance of generalized low-density parity-check (GLDPC) codes under the a posteriori probability (APP) decoder is analyzed. We explore the concentration, symmetry, and monotonicity properties of GLDPC codes under the APP decoder, extending the applicability of density evolution to GLDPC codes. On the binary memoryless symmetric channels, using the BEC and BI-AWGN channels as two examples, we demonstrate that with an appropriate proportion of generalized constraint (GC) nodes, GLDPC codes can reduce the original gap to capacity compared to their original LDPC counterparts. Additionally, on the BI-AWGN channel, we apply and improve the Gaussian approximation algorithm in the density evolution of GLDPC codes. By adopting Gaussian mixture distributions to approximate the message distributions from variable nodes and Gaussian distributions for those from constraint nodes, the precision of the channel parameter threshold can be significantly enhanced while maintaining a low computational complexity similar to that of Gaussian approximations. Furthermore, we identify a class of subcodes that can greatly simplify the performance analysis and practical decoding of GLDPC codes, which we refer to as message-invariant subcodes. Using the aforementioned techniques, our simulation experiments provide empirical evidence that GLDPC codes, when decoded with the APP decoder and equipped with the right fraction of GC nodes, can achieve substantial performance improvements compared to low-density parity-check (LDPC) codes.

arXiv:2404.01136•Apr 1, 2024•0 citations
The LDPC (Low-Density Parity-Check) decoder must operate soft decisions calculated using: LLR (Log-Likelihood Ratio) or APP (A Posteriori Probability) according to the decoding algorithm used. The exact calculation of these decisions for high order constellations involves complicated operations. In this work, a method to simplify the APP calculation is introduced. It is programmed to adapt as perfectly as possible the transmission system to the channel type in question. This method leads to simplify the implementation of the transmission system. Simulation results show that, under the Gaussian channel, the simplified APP algorithm for 16-QAM achieves the same performance that obtained with the exact APP, while for 64-QAM we have a small performance degradation. The same simplified APP algorithm that used for the Gaussian channel can be applied, with minor operations added, for Rayleigh channel, and it shows a small performance loss with respect to the exact APP.
Combining non-binary LDPC (Low-Density Parity-Check) codes and high order constellations, such as Quadrature Amplitude Modulations (QAM), is an effective way to improve the bandwidth efficiency. Since, the message exchanged in the LDPC decoder can be measured by the APP (A Priori Probability) or the LLR (Log-Likelihood Ratio), depending on the decoding algorithm type, the message at the decoder input that computed by the QAM must be using the same calculation. However, the number of operations performed by the QAM increases with the constellation order, and the calculation changes with the channel type. In this paper, we use simplified LLR computations, introduced for binary codes, to simplify the APP calculation of square-QAM-Gray demapping for APP-based non-binary LDPC decoders. Under Gaussian channel, the simplified APP calculation achieves the same performance that obtained with the exact APP computation. The same simplified APP calculation used for a Gaussian channel can be applied, with minor operations added, for Rayleigh channel, and it shows a small performance loss with respect to the exact APP computation. These simplifications simplify the combination of non-binary LDPC codes with QAM. With this method, it is easy to change a decoding algorithm based on the APP to an algorithm based on the LLR.
Belief propagation (BP) algorithm is commonly used in soft decoding of Low Density Parity Check Code (LDPC). However, a significant disadvantage of this method is that the computational complexity is high in high order M-QAM modulation. This paper proposes an optimized algorithm to reduce the posterior probability calculation in soft decoding, which estimates an approximate decision point in the constellation map via channel equalization. Then a contractible constellation decision space is delimited by the approximate decision point and its surrounding points with the minimum European distance. Compared with the conventional soft decoding, simulation results show that the proposed algorithm can effectively reduce the computational complexity of BP decoding with tiny loss of the decoding accuracy. The proposed algorithm reduces nearly 96 percent of the computational complexity of posterior probability in the case of 256QAM modulation.
In this study, the performance of generalized low-density parity-check (GLDPC) codes under the a posteriori probability (APP) decoder is analyzed. We explore the concentration, symmetry, and monotonicity properties of GLDPC codes under the APP decoder, extending the applicability of density evolution to GLDPC codes. On the binary memoryless symmetric channels, using the BEC and BI-AWGN channels as two examples, we demonstrate that with an appropriate proportion of generalized constraint (GC) nodes, GLDPC codes can reduce the original gap to capacity compared to their original LDPC counterparts. Additionally, on the BI-AWGN channel, we apply and improve the Gaussian approximation algorithm in the density evolution of GLDPC codes. By adopting Gaussian mixture distributions to approximate the message distributions from variable nodes and Gaussian distributions for those from constraint nodes, the precision of the channel parameter threshold can be significantly enhanced while maintaining a low computational complexity similar to that of Gaussian approximations. Furthermore, we identify a class of subcodes that can greatly simplify the performance analysis and practical decoding of GLDPC codes, which we refer to as message-invariant subcodes. Using the aforementioned techniques, our simulation experiments provide empirical evidence that GLDPC codes, when decoded with the APP decoder and equipped with the right fraction of GC nodes, can achieve substantial performance improvements compared to low-density parity-check (LDPC) codes.