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

Lecture notes in electrical engineering

Research on Simplified Algorithms for LDPC Decoding in High Order Modulation

Li Hua Xu, Daoxing Guo, Chunqiang Shi

Published Dec 5, 2012• 0 citations
Publisher
DOI
10.1007/978-1-4471-4793-0_8

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

Forced-convergence decoding for LDPC-coded modulation

Liyun Dai, Hongwen Yang, Jianxiao Fan +1 more

Science China Information Sciences•Nov 8, 2012•12 citations

A Polygonal Line Min-Sum Decoding Scheme for Low Density Parity Check Codes

Yin Xu, Hao Ju, Dazhi He +4 more

Low-density parity-check (LDPC) codes are widely used as error correction codes in new generation digital TV standards, such as the second generation of terrestrial digital video broadcasting standard (DVB-T2), Advanced Television Systems Committee (ATSC) 3.0, etc. The nonlinear belief propagation (BP) algorithm has excellent decoding performance for LDPC codes, but is often simplified in hardware implementations by linear min-sum (MS) algorithm due to its high complexity. This simplification also leads to over-estimation problems, which can be corrected by adding factors in conventional algorithms (e.g., normalized min-sum (NMS), offset min-sum (OMS), and variable scaling normalized min-sum (VMS) algorithms). However, the correction factors of these modified MS algorithms cannot adapt to different channels and modulations, and the performance needs further improvement. In this paper, the concepts of over-estimation value (OEV) and over-estimation rate (OER) are introduced to describe the over-estimation problem of the MS algorithm. Then, under the guidance of OEV and OER, a polygonal line min-sum (PMS) algorithm with correction factors adapted to different channels and modulations is proposed according to LLR distribution. Following the properties of OEV and OER, PMS algorithm is further simplified into Simplified PMS (SPMS) algorithm. LDPC codes from ATSC 3.0 are adopted in this paper to evaluate SPMS algorithm in comparison with the conventional algorithms. Extensive simulation results show that the SPMS algorithm for ATSC 3.0 LDPC decoder has at most 1.61dB, 0.24dB and 0.36dB gain over NMS, OMS and VMS algorithms respectively when frame error rate (FER) is at 10−4level over additive white Gaussian noise (AWGN) channel with QPSK modulation. More importantly, the simulation results show that the SPMS algorithm can achieve much better performance than these modified MS algorithms over AWGN and Rayleigh channel with higher-order modulations or under limited maximum iteration number.

IEEE Transactions on Broadcasting•Aug 23, 2021•8 citations

Fast-convergence architectures and low-complexity algorithms for LDPC decoding

Massimo Rovini, Luca Fanucci, Francesco Rossi

•Jan 1, 2006•0 citations

Low-complexity LDPC decoding algorithms for ultra-high-order modulated signals

Hongjun Zhu, Meiyu Fu, Chen Hou +1 more

Low-complexity decoding algorithms and ultra-high-order modulation formats are necessary to meet data rate requirements in excess of 1 Tbps. The information bottleneck algorithm has been effectively applied to the LDPC decoding algorithm in recent years, and its performance is comparable to that of the double-precision information propagation technique. However, the application of information bottleneck decoding algorithms in ultra-high order modulation forms has received little attention. Furthermore, the number of table lookups required for a single decoding loop is square to the node degree, which is undesirable for optical communications. We present a low-complexity LDPC decoding technique for ultra-high-order modulated signals in this study. First, the algorithm employs multivariate covariates to build an information bottleneck framework, which introduces the processing required for applying the information bottleneck algorithm to 1024-QAM signals and the requirement of combining higher-order modulation formats with LDPC codes. The technique makes use of a bidirectional recursive network and the symmetry of quantized information to reuse the same set of tables, considerably reducing the number of table lookup operations required in the decoding process. Constructing a coherent optical communication system with 1024-QAM signals proves that the proposed algorithm can operate effectively. The performance sacrifice of 0.2 ∼ 0.3 dB reduces the number of table lookup operations required for decoding from square to linear magnitude, which greatly reduces the decoding time required in optical communication.

Optics Express•Nov 14, 2023•2 citations

Research on high performance LDPC decoder

Wen Ji, 32134

•Jan 1, 2011•1 citation
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.
Low-density parity-check (LDPC) codes are widely used as error correction codes in new generation digital TV standards, such as the second generation of terrestrial digital video broadcasting standard (DVB-T2), Advanced Television Systems Committee (ATSC) 3.0, etc. The nonlinear belief propagation (BP) algorithm has excellent decoding performance for LDPC codes, but is often simplified in hardware implementations by linear min-sum (MS) algorithm due to its high complexity. This simplification also leads to over-estimation problems, which can be corrected by adding factors in conventional algorithms (e.g., normalized min-sum (NMS), offset min-sum (OMS), and variable scaling normalized min-sum (VMS) algorithms). However, the correction factors of these modified MS algorithms cannot adapt to different channels and modulations, and the performance needs further improvement. In this paper, the concepts of over-estimation value (OEV) and over-estimation rate (OER) are introduced to describe the over-estimation problem of the MS algorithm. Then, under the guidance of OEV and OER, a polygonal line min-sum (PMS) algorithm with correction factors adapted to different channels and modulations is proposed according to LLR distribution. Following the properties of OEV and OER, PMS algorithm is further simplified into Simplified PMS (SPMS) algorithm. LDPC codes from ATSC 3.0 are adopted in this paper to evaluate SPMS algorithm in comparison with the conventional algorithms. Extensive simulation results show that the SPMS algorithm for ATSC 3.0 LDPC decoder has at most 1.61dB, 0.24dB and 0.36dB gain over NMS, OMS and VMS algorithms respectively when frame error rate (FER) is at 10−4level over additive white Gaussian noise (AWGN) channel with QPSK modulation. More importantly, the simulation results show that the SPMS algorithm can achieve much better performance than these modified MS algorithms over AWGN and Rayleigh channel with higher-order modulations or under limited maximum iteration number.
Low-complexity decoding algorithms and ultra-high-order modulation formats are necessary to meet data rate requirements in excess of 1 Tbps. The information bottleneck algorithm has been effectively applied to the LDPC decoding algorithm in recent years, and its performance is comparable to that of the double-precision information propagation technique. However, the application of information bottleneck decoding algorithms in ultra-high order modulation forms has received little attention. Furthermore, the number of table lookups required for a single decoding loop is square to the node degree, which is undesirable for optical communications. We present a low-complexity LDPC decoding technique for ultra-high-order modulated signals in this study. First, the algorithm employs multivariate covariates to build an information bottleneck framework, which introduces the processing required for applying the information bottleneck algorithm to 1024-QAM signals and the requirement of combining higher-order modulation formats with LDPC codes. The technique makes use of a bidirectional recursive network and the symmetry of quantized information to reuse the same set of tables, considerably reducing the number of table lookup operations required in the decoding process. Constructing a coherent optical communication system with 1024-QAM signals proves that the proposed algorithm can operate effectively. The performance sacrifice of 0.2 ∼ 0.3 dB reduces the number of table lookup operations required for decoding from square to linear magnitude, which greatly reduces the decoding time required in optical communication.