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 APP Computation of High Order Constellations Combined with Non-Binary LDPC Decoders

Latifa Mostari, Abdennacer Bounoua, Abdelmalik Taleb Ahmed

Published Apr 25, 2019• 1 citation
OpenAlex

Abstract

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.

Related papers

Simplified a Posteriori Probability Calculation for Binary LDPC Codes

Latifa Mostari, Abdelmalik Taleb Ahmed

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.

•Oct 24, 2018•1 citation

NB-LDPC Codes with High Rates Achieving Low BER over the AWGN Channel with QAM Signaling

Gada Rezgui, Asma Maaloui, Iryna Andriyanova +2 more

The paper investigates high-rate Low-Density-Parity-Check (LDPC) codes, able to achieve a low bit error rate (BER). Such an operational regime of LDPC codes finds its application in optical transmissions. For this reason the considered transmission model is the one close to optical communications: it is a M-ary Quadrature-Amplitude Modulation (QAM) signaling over the M-ary input additive Gaussian channel.We study three main points: a) which LDPC codes of fixed codelength can achieve low BER for a code rate R ≥ 0.8; b) whether non-binary LDPC (NB-LDPC) codes, defined over GF(Q), are efficient in this setting; c) how to keep a reasonable decoding complexity for a given modulation order. Our performance analysis is complete and it is based on the calculation of the average bit error rate of a given ensemble, by using both asymptotic and finite-length tools of sparse-graph codes.Our results show that NB-LDPC codes with moderate values of Q, together with a Symbol Interleaved Coded Modulation (SICM) approach, offer the best performance at low BER.

•Oct 24, 2020•2 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

Low-Complexity Channel-Likelihood Estimation for Non-Binary Codes and QAM

Guanghua He, Gabi Sarkis, Saied Hemati +2 more

An approximate channel-likelihood estimation algorithm is introduced for non-binary coded, square quadrature-amplitude-modulated systems. It is shown that the proposed approximation greatly simplifies the calculation of channel-likelihoods and yet provides results close to those based on exact calculations for non-binary low-density parity-check codes over the additive white Gaussian noise channel.

IEEE Communications Letters•Apr 27, 2012•1 citation

Symbol-Based Algorithms for Decoding Binary LDPC Codes with Higher-Order Modulations

Jingbo Liu, Jingyang Yuan, Jin Sha

Low-density parity-check (LDPC) codes are widely used in communication systems. When user messages are encoded by binary LDPC codes and transmitted with higher-order modulations, bits composing the same modulated symbol are generally correlated. Traditional soft-decision decoding algorithms for binary LDPC codes like sum-product algorithm (SPA) and min-sum algorithm (MSA) update messages only based on log-likelihood ratio (LLR) of bits, and correlations introduced by modulation are not utilized. In this paper, symbol-based SPA and MSA (S-SPA and S-MSA) which incorporate symbol-level information in the decoding procedures are proposed to provide an alternative low-cost way to better utilize available information. By narrowing the search space of symbols based on bit-level information, the complexities of the proposed algorithms are independent of modulation order. S-SPA and S-MSA achieve better error-correction performances than SPA and MSA with little additional complexities and S-MSA is friendly to hardware design of LDPC decoder.

IEEE International Symposium on Circuits and Systems proceedings•May 1, 2019•1 citation

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
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.
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.
The paper investigates high-rate Low-Density-Parity-Check (LDPC) codes, able to achieve a low bit error rate (BER). Such an operational regime of LDPC codes finds its application in optical transmissions. For this reason the considered transmission model is the one close to optical communications: it is a M-ary Quadrature-Amplitude Modulation (QAM) signaling over the M-ary input additive Gaussian channel.We study three main points: a) which LDPC codes of fixed codelength can achieve low BER for a code rate R ≥ 0.8; b) whether non-binary LDPC (NB-LDPC) codes, defined over GF(Q), are efficient in this setting; c) how to keep a reasonable decoding complexity for a given modulation order. Our performance analysis is complete and it is based on the calculation of the average bit error rate of a given ensemble, by using both asymptotic and finite-length tools of sparse-graph codes.Our results show that NB-LDPC codes with moderate values of Q, together with a Symbol Interleaved Coded Modulation (SICM) approach, offer the best performance at low BER.
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.
Low-density parity-check (LDPC) codes are widely used in communication systems. When user messages are encoded by binary LDPC codes and transmitted with higher-order modulations, bits composing the same modulated symbol are generally correlated. Traditional soft-decision decoding algorithms for binary LDPC codes like sum-product algorithm (SPA) and min-sum algorithm (MSA) update messages only based on log-likelihood ratio (LLR) of bits, and correlations introduced by modulation are not utilized. In this paper, symbol-based SPA and MSA (S-SPA and S-MSA) which incorporate symbol-level information in the decoding procedures are proposed to provide an alternative low-cost way to better utilize available information. By narrowing the search space of symbols based on bit-level information, the complexities of the proposed algorithms are independent of modulation order. S-SPA and S-MSA achieve better error-correction performances than SPA and MSA with little additional complexities and S-MSA is friendly to hardware design of LDPC decoder.
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.