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

Video Engineering

Improved LDPC Algorithm Based on 16QAM Modulation System

Sun Shaoshuai

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

In this paper,QAM Modulation system is analyzed and a reduced state Soft Input Soft Output(SISO) posteriori probability algorithm is proposed.Based on the sum-product algorithm,it has the more general form compared with other reduced state SISO algorithms.The proposed algorithm use the Euclidean distance between points to calculate bit likelihood values in the demodulator.Then the likelihood value will be entered into the soft-input decoder,thus leads to the computation complexity reduction.Analysis and simulation result show that the proposed scheme can effectively use the soft-output of QAM demodulation,and can get 0.25 dB gain in Gaussian channel compare to the original scheme.

Related papers

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

A Soft-Input Soft-Output Decoding Algorithm for LDPC Codes

Lixin Wang

A new soft-input,soft-output algorithm for decoding LDPC codes is described in this paper.Using soft squared Euclidean distance as the metric,the algorithm realizes decoding by iterating the antilog-sum of the Euclidean distance.A simplified algorithm is also put forward to reduce computational complexity.The proposed algorithm does not require knowledge of the signal-to-noise ratio of the received signal and is less complex to implement than other soft decision algorithms.The results of simulation show that the performance is very close to that of sum-product algorithm while the computational complexity is sharply reduced.

Journal of Spacecraft TT&C Technology•Jan 1, 2011•0 citations

Study on blind decoding algorithm for LDPC codes based on Soft-Input Soft-Output

Wang Li-xin

To deal with the complexity of traditional BP decoding algorithm,a kind of blind decoding algorithm for LDPC codes based on soft-input,soft-output is put forward in this paper.The algorithm uses soft squared Euclidean distance as the metric,realizes decoding by iterating the antilog-sum of the Euclidean distance as the process taken in BP algorithm.The proposed algorithm does not require knowledge of the signal-to-noise ratio of the received signal,and is less complex to implement than other soft decision algorithms.At the same time,a simplified algorithm is also put forward to reduce the computational complexity.What's more,the proposed SBSD decoding algorithm can not only decode Binary LDPC codes,but also can be used for Qary-LDPC codes.Simulations results show that the proposed algorithm can achieve good performance not only on the AWGN channels but also on Rayleigh channel,and the performance is very close to that of the sum-product algorithm,but the computational complexity is reduced sharply.

Journal of Circuits and Systems•Jan 1, 2012•0 citations

Euclidean distance soft-input soft-output decoding algorithm for low-density parity-check codes

Patrick Guy Farrell, Leonardo J. Arnone, Jorge Castiñeira Moreira

A new antilog–sum algorithm for decoding error-correcting codes is described. The soft-input, soft-output (SISO) algorithm uses squared Euclidean distance as the metric, does not require knowledge of the signal-to-noise ratio of the received signal and is less complex to implement than other SISO algorithms. The results of simulations show that the performance is very close to that of the log–sum–product algorithm.

IET Communications•Nov 4, 2011•13 citations

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

Joint Demodulation and EMS Decoding Algorithm for Q-ary LDPC Codes

Wei Lin -, Baoming Bai, Sheng Tong

To reduce the high decoding complexity of q-ary LDPC codes, a joint-demodulation and extended min-sum (JD-EMS) decoding algorithm is presented in this paper. By utilizing the squares of the distances between signal and constellation points over constellation graph as the decoder input soft messages, the proposed algorithm not only facilitates the computations of the decoder initial messages, but also avoids the performance loss due to conversions between probabilities and log-likelihoodratios. The elementary check node (ECN) processing is also improved in JD-EMS algorithm, thus the number of real additions can be reduced. Moreover, we also give an upper bound of the number of comparison candidates in the sorter at each ECN step. Simulation results indicate that, while significantly reducing the number of real additions at check nodes, JD-EMS algorithm performs as well as EMS algorithm on both AWGN and Rayleigh fading channels.

Journal of Convergence Information Technology•Jun 30, 2011•3 citations
In this paper,QAM Modulation system is analyzed and a reduced state Soft Input Soft Output(SISO) posteriori probability algorithm is proposed.Based on the sum-product algorithm,it has the more general form compared with other reduced state SISO algorithms.The proposed algorithm use the Euclidean distance between points to calculate bit likelihood values in the demodulator.Then the likelihood value will be entered into the soft-input decoder,thus leads to the computation complexity reduction.Analysis and simulation result show that the proposed scheme can effectively use the soft-output of QAM demodulation,and can get 0.25 dB gain in Gaussian channel compare to the original scheme.
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.
A new soft-input,soft-output algorithm for decoding LDPC codes is described in this paper.Using soft squared Euclidean distance as the metric,the algorithm realizes decoding by iterating the antilog-sum of the Euclidean distance.A simplified algorithm is also put forward to reduce computational complexity.The proposed algorithm does not require knowledge of the signal-to-noise ratio of the received signal and is less complex to implement than other soft decision algorithms.The results of simulation show that the performance is very close to that of sum-product algorithm while the computational complexity is sharply reduced.
To deal with the complexity of traditional BP decoding algorithm,a kind of blind decoding algorithm for LDPC codes based on soft-input,soft-output is put forward in this paper.The algorithm uses soft squared Euclidean distance as the metric,realizes decoding by iterating the antilog-sum of the Euclidean distance as the process taken in BP algorithm.The proposed algorithm does not require knowledge of the signal-to-noise ratio of the received signal,and is less complex to implement than other soft decision algorithms.At the same time,a simplified algorithm is also put forward to reduce the computational complexity.What's more,the proposed SBSD decoding algorithm can not only decode Binary LDPC codes,but also can be used for Qary-LDPC codes.Simulations results show that the proposed algorithm can achieve good performance not only on the AWGN channels but also on Rayleigh channel,and the performance is very close to that of the sum-product algorithm,but the computational complexity is reduced sharply.
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.
To reduce the high decoding complexity of q-ary LDPC codes, a joint-demodulation and extended min-sum (JD-EMS) decoding algorithm is presented in this paper. By utilizing the squares of the distances between signal and constellation points over constellation graph as the decoder input soft messages, the proposed algorithm not only facilitates the computations of the decoder initial messages, but also avoids the performance loss due to conversions between probabilities and log-likelihoodratios. The elementary check node (ECN) processing is also improved in JD-EMS algorithm, thus the number of real additions can be reduced. Moreover, we also give an upper bound of the number of comparison candidates in the sorter at each ECN step. Simulation results indicate that, while significantly reducing the number of real additions at check nodes, JD-EMS algorithm performs as well as EMS algorithm on both AWGN and Rayleigh fading channels.