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

IEEE Communications Letters

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

Guanghua He, Gabi Sarkis, Saied Hemati, Warren J. Gross, Baoming Bai

Published Apr 27, 2012• 1 citation
Publisher

Abstract

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.

DOI
10.1109/lcomm.2012.042312.120382

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

Improved upper bounds on the ensemble performance of ML decoded low density parity check codes

Igal Sason, Shlomo Shitz Shamai

In this letter, we study improved upper bounds on the performance of low density parity check codes over binary-input additive white Gaussian noise channels, assuming that the codes are maximum-likelihood decoded. The results demonstrate the phenomenal performance of the low density parity check codes.

IEEE Communications Letters•Mar 1, 2000•30 citations

A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes

Chung-Li Wang, Xiaoheng Chen, Zongwang Li +1 more

Non-binary low-density parity-check codes are robust to various channel impairments. However, based on the existing decoding algorithms, the decoder implementations are expensive because of their excessive computational complexity and memory usage. Based on the combinatorial optimization, we present an approximation method for the check node processing. The simulation results demonstrate that our scheme has small performance loss over the additive white Gaussian noise channel and independent Rayleigh fading channel. Furthermore, the proposed reduced-complexity realization provides significant savings on hardware, so it yields a good performance-complexity tradeoff and can be efficiently implemented.

arXiv:1207.5555•IEEE Transactions on Communications•Oct 22, 2012•52 citations

Reduced complexity iterative decoding of low-density parity check codes based on belief propagation

M.P.C. Fossorier, Miodrag J. Mihaljević, Hirotaka Imai

Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two algorithms do not require any knowledge about the channel characteristics. Both algorithms yield a good performance-complexity trade-off and can be efficiently implemented in software as well as in hardware, with possibly quantized received values.

IEEE Transactions on Communications•May 1, 1999•1,065 citations

A Low-Complexity Noise-Aided Selective-Symbol Flip Decoder for Non-Binary LDPC Codes over QAM Channel

Zinnia Muntaha Mowri, Chris Winstead

Non-binary low-density parity-check (NB-LDPC) codes offer strong error-correction performance for short to moderate block lengths yet incur high decoding complexity. Symbol-flipping decoding (SFD) algorithms offer reduced implementation complexity compared to soft-decision decoding schemes, such as belief-propagation (BP) and extended min-sum (EMS). However, this reduction comes at the expense of degraded error-rate performance. Motivated by the success of low-complexity, noise-perturbed bit-flipping decoders in the binary domain, our work investigates whether similar benefits can be achieved for NB-LDPC codes operating over QAM channels. We propose a low-complexity noise-aided selective-symbol flipping decoder that incorporates controlled stochastic perturbations into a symbol-level reliability metric combining Euclidean-distance channel likelihood and non-binary syndrome reinforcement. The proposed method preserves the low computational complexity and implementation-friendly structure of conventional SFD algorithms, while relying solely on simple scalar metric computations and syndrome evaluation. Simulation results provide insight into the role and limitations of noise perturbation in non-binary symbol-flipping decoders and highlight a practical, low-complexity noise-aware decoding approach for higher-order modulated systems.

Intermountain Engineering, Technology and Computing (IETC)•May 8, 2026•0 citations

Decoding LDPC Codes With Locally Maximum-Likelihood Binary Messages

Chris Winstead, Emmanuel Boutillon

A new low-complexity message passing algorithm is described for decoding low-density parity-check (LDPC) codes by exchanging binary messages. The algorithm computes the local maximum-likelihood binary message (LMLBM) at each symbol node, given the combination of local channel information and partial syndrome components from adjacent parity check nodes. When channel information is quantized, the locally ML messages are pre-computed and stored in a dynamic global lookup table. The proposed algorithm uses memoryless extrinsic messages so that density evolution thresholds can be directly computed. Thresholds are obtained for regular ensembles, predicting good performance on quantized binary-input additive white Gaussian noise (biAWGN) channels.

IEEE Communications Letters•Oct 30, 2014•2 citations
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.
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.
Non-binary low-density parity-check codes are robust to various channel impairments. However, based on the existing decoding algorithms, the decoder implementations are expensive because of their excessive computational complexity and memory usage. Based on the combinatorial optimization, we present an approximation method for the check node processing. The simulation results demonstrate that our scheme has small performance loss over the additive white Gaussian noise channel and independent Rayleigh fading channel. Furthermore, the proposed reduced-complexity realization provides significant savings on hardware, so it yields a good performance-complexity tradeoff and can be efficiently implemented.
Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two algorithms do not require any knowledge about the channel characteristics. Both algorithms yield a good performance-complexity trade-off and can be efficiently implemented in software as well as in hardware, with possibly quantized received values.
Non-binary low-density parity-check (NB-LDPC) codes offer strong error-correction performance for short to moderate block lengths yet incur high decoding complexity. Symbol-flipping decoding (SFD) algorithms offer reduced implementation complexity compared to soft-decision decoding schemes, such as belief-propagation (BP) and extended min-sum (EMS). However, this reduction comes at the expense of degraded error-rate performance. Motivated by the success of low-complexity, noise-perturbed bit-flipping decoders in the binary domain, our work investigates whether similar benefits can be achieved for NB-LDPC codes operating over QAM channels. We propose a low-complexity noise-aided selective-symbol flipping decoder that incorporates controlled stochastic perturbations into a symbol-level reliability metric combining Euclidean-distance channel likelihood and non-binary syndrome reinforcement. The proposed method preserves the low computational complexity and implementation-friendly structure of conventional SFD algorithms, while relying solely on simple scalar metric computations and syndrome evaluation. Simulation results provide insight into the role and limitations of noise perturbation in non-binary symbol-flipping decoders and highlight a practical, low-complexity noise-aware decoding approach for higher-order modulated systems.
A new low-complexity message passing algorithm is described for decoding low-density parity-check (LDPC) codes by exchanging binary messages. The algorithm computes the local maximum-likelihood binary message (LMLBM) at each symbol node, given the combination of local channel information and partial syndrome components from adjacent parity check nodes. When channel information is quantized, the locally ML messages are pre-computed and stored in a dynamic global lookup table. The proposed algorithm uses memoryless extrinsic messages so that density evolution thresholds can be directly computed. Thresholds are obtained for regular ensembles, predicting good performance on quantized binary-input additive white Gaussian noise (biAWGN) channels.