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

Systems engineering and electronics

Application of maximum average mutual information quantization in LDPC decoding under QPSK modulation

Jie Fan

Published Jan 1, 2012• 1 citation
OpenAlex

Abstract

The decoding algorithm of low-density parity-check(LDPC) codes in quaternary phase shift keying(QPSK) modulation is in-depth studied.The specific method of the maximum average mutual information quantization is analyzed and deduced.With this method to quantify the initial message,each iteration of the variable messages and check messages becomes integer,then the min-sum decoding algorithm based on integer arithmetic is implemented.Simulation results show that the performance of the min-sum decoding algorithm with maximum average mutual information quantization is about 0.39 dB worse than the performance of high-precision floating-point sum-product decoding algorithm.At the same time all the variables in the algorithm are fixed-length integers,so it is easy to implement in hardware.Although the decoding performance is slightly worse than sum-product decoding performance,the decoding time is greatly reduced.

Related papers

Maximum Average Mutual Information Quantisation of Low Density Parity Check Codes for Eight-Phase-Shift Keying Modulation

Z Chen, H Zhang, L Li +1 more

Low density parity check (LDPC) codes enjoy the good properties of approaching the Shannon limit, and its practical application is of great significance. In this paper, the decoding algorithm of LDPC codes for eight-phase-shift keying modulation is particularly studied, and the specific methods of the maximum average mutual information quantisation are analysed and deduced. With this method to quantify the initial message, the variable messages and check messages are converted into integers when each iteration has been finished, and then the min-sum decoding algorithm based on integer arithmetic is implemented. Simulation results demonstrate that the performance of the min-sum decoding algorithm with maximum average mutual information quantisation is close to that of the high-precision floating-point sum-product decoding algorithm. Meanwhile, It is convenient for hardware implementation since all the variables in the algorithm are fixed-length integers. Although the bit error rate is slightly worse than that of the sum-product decoding algorithm, the decoding time consumption is greatly reduced.

Australian Journal of Electrical & Electronics Engineering•Jan 1, 2015•0 citations

Uniform quantization of LDPC codes for 8PSK modulation

Zhengkang Chen, Zhang Huisheng, LI Li-xin +1 more

It's common to use high-precision floating-point operations on theoretical study of the Low Density Parity Check (LDPC) codes, but it is difficult to implement it in practical application. Therefore, there is a great need to design effective quantitative method which enables us to implement it in hardware easily. In this paper, the min-sum decoding algorithm of LDPC codes for 8PSK modulation is studied in detail, and the method of the uniform quantization is analyzed and deduced. With this method to quantify the initial message, the variable messages and check messages are converted into integers after each iteration. Then the min-sum decoding algorithm based on integer arithmetic for 8PSK modulation is implemented. Simulation results demonstrate that the performance of the min-sum decoding algorithm with the uniform quantization is close to that of the high-precision floating-point sum-product decoding algorithm. Meanwhile, all the variables in the algorithm are fixed-length integers, so it is convenient for hardware implementation.

IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)•Aug 1, 2013•0 citations

Min-sum Integer Decoding for LDPC in QPSK Modulation

Peng Xin

Low-Density Parity-Check(LDPC) codes are typical of preeminent performance approaching Shannon’s capacity limit.This paper studies the LDPC codes min-sum decoding algorithm,and a min-sum algorithm in QPSK modulation based on integer operation is proposed for decoding LDPC codes.All the variables are fixed length integers in this algorithm,so it is very convenient for hardware implementation.Simulation results show that its performance is close to that of sum-product algorithm whose variables are high precision floating point numbers.

•Jan 1, 2010•0 citations

Min-sum decoding algorithm for LDPC codes based on integer operation

Sen Li

The LDPC codes decoding algorithm over additive white gaussian noise(AWGN) channels was studied,and a min-sum algorithm based on integer operation was proposed for decoding LDPC codes.All the variables were fixed length integers in this algorithm,which was very convenient for hardware implementation.At the signal-to-noise ratios(SNR) above 3dB,its performance was equal to that of sum-product algorithm whose variables were high precision floating point numbers.Also,a coefficient was designed to modify the min-sum algorithm,whose decoding performance was improved greatly especially at low SNR.And another achievement had been found that this algorithm had a lower error floor at high SNR.

Journal of Communications•Jan 1, 2010•1 citation

Generalized Mutual Information-Maximizing Quantized Decoding of LDPC Codes.

Peng Kang, Kui Cai, Xuan He +1 more

In this paper, we propose a general framework of the mutual infomration-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes, which can outperform the state-of-the-art lookup table (LUT) decoder by using simple mappings and fixed-point additions for the node updates. Our decoding method is generic in the sense that it can be applied to LDPC codes with arbitrary degree distributions, and it can be implemented based on either the belief propagation (BP) algorithm or the min-sum (MS) algorithm, leading to the MIM quantized BP (MIM-QBP) decoder and the MIM quantized MS (MIM-QMS) decoder, respectively. In particular, we approximate the check node (CN) update of the MIM-QBP decoder by a max-product operation and obtain the MIM-QMS decoder, which simplifies the decoder design and requires less resource consumption. To avoid the precision degradation, we introduce a dynamic reconstruction method to optimize the variable node update for different iterations. Some practical aspects of the proposed decoders such as the design and decoding complexity are also discussed. Simulation results show that the MIM-QBP decoder outperforms the LUT decoders in the waterfall region with both 3-bit and 4-bit precision. Moreover, the 4-bit MIM-QMS decoder can even surpass the floating-point BP decoder in the error-floor region.

•Nov 26, 2020•1 citation

Performance Analysis of Normalized Min-Sum Decoder for LDPC using non-uniform Quantization

K Pargunarajan, R Gandhiraj, Madaswamy Jayakumar

Very high data rates and decoding computational complexity place strict constraints in 5G and 6G communications. In this paper, non-uniform Quantized Decoding algorithm is proposed for Low-density Parity Check codes (LDPC). In the proposed algorithm, the check node updating process is carried out using quantization, which reduces complexity. The Sum Product Algorithm (SPA) is iterative message passing decoding techniques offer the optimal performance for LDPC codes. Implementations use message-passing decoding with more precision, results extremely high complexity. In Iterative, message-passing (MP), trapping sets and absorbing sets causes low error floor. In this article non-uniform quantization proposed to overcome dynamic range of values over uniform quantization. Simulation results provide coding gain increases closer to of 0.5 dB in higher SNR and has good error floor at 10−5.

International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)•Mar 20, 2025•2 citations
The decoding algorithm of low-density parity-check(LDPC) codes in quaternary phase shift keying(QPSK) modulation is in-depth studied.The specific method of the maximum average mutual information quantization is analyzed and deduced.With this method to quantify the initial message,each iteration of the variable messages and check messages becomes integer,then the min-sum decoding algorithm based on integer arithmetic is implemented.Simulation results show that the performance of the min-sum decoding algorithm with maximum average mutual information quantization is about 0.39 dB worse than the performance of high-precision floating-point sum-product decoding algorithm.At the same time all the variables in the algorithm are fixed-length integers,so it is easy to implement in hardware.Although the decoding performance is slightly worse than sum-product decoding performance,the decoding time is greatly reduced.
Low density parity check (LDPC) codes enjoy the good properties of approaching the Shannon limit, and its practical application is of great significance. In this paper, the decoding algorithm of LDPC codes for eight-phase-shift keying modulation is particularly studied, and the specific methods of the maximum average mutual information quantisation are analysed and deduced. With this method to quantify the initial message, the variable messages and check messages are converted into integers when each iteration has been finished, and then the min-sum decoding algorithm based on integer arithmetic is implemented. Simulation results demonstrate that the performance of the min-sum decoding algorithm with maximum average mutual information quantisation is close to that of the high-precision floating-point sum-product decoding algorithm. Meanwhile, It is convenient for hardware implementation since all the variables in the algorithm are fixed-length integers. Although the bit error rate is slightly worse than that of the sum-product decoding algorithm, the decoding time consumption is greatly reduced.
It's common to use high-precision floating-point operations on theoretical study of the Low Density Parity Check (LDPC) codes, but it is difficult to implement it in practical application. Therefore, there is a great need to design effective quantitative method which enables us to implement it in hardware easily. In this paper, the min-sum decoding algorithm of LDPC codes for 8PSK modulation is studied in detail, and the method of the uniform quantization is analyzed and deduced. With this method to quantify the initial message, the variable messages and check messages are converted into integers after each iteration. Then the min-sum decoding algorithm based on integer arithmetic for 8PSK modulation is implemented. Simulation results demonstrate that the performance of the min-sum decoding algorithm with the uniform quantization is close to that of the high-precision floating-point sum-product decoding algorithm. Meanwhile, all the variables in the algorithm are fixed-length integers, so it is convenient for hardware implementation.
Low-Density Parity-Check(LDPC) codes are typical of preeminent performance approaching Shannon’s capacity limit.This paper studies the LDPC codes min-sum decoding algorithm,and a min-sum algorithm in QPSK modulation based on integer operation is proposed for decoding LDPC codes.All the variables are fixed length integers in this algorithm,so it is very convenient for hardware implementation.Simulation results show that its performance is close to that of sum-product algorithm whose variables are high precision floating point numbers.
The LDPC codes decoding algorithm over additive white gaussian noise(AWGN) channels was studied,and a min-sum algorithm based on integer operation was proposed for decoding LDPC codes.All the variables were fixed length integers in this algorithm,which was very convenient for hardware implementation.At the signal-to-noise ratios(SNR) above 3dB,its performance was equal to that of sum-product algorithm whose variables were high precision floating point numbers.Also,a coefficient was designed to modify the min-sum algorithm,whose decoding performance was improved greatly especially at low SNR.And another achievement had been found that this algorithm had a lower error floor at high SNR.
In this paper, we propose a general framework of the mutual infomration-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes, which can outperform the state-of-the-art lookup table (LUT) decoder by using simple mappings and fixed-point additions for the node updates. Our decoding method is generic in the sense that it can be applied to LDPC codes with arbitrary degree distributions, and it can be implemented based on either the belief propagation (BP) algorithm or the min-sum (MS) algorithm, leading to the MIM quantized BP (MIM-QBP) decoder and the MIM quantized MS (MIM-QMS) decoder, respectively. In particular, we approximate the check node (CN) update of the MIM-QBP decoder by a max-product operation and obtain the MIM-QMS decoder, which simplifies the decoder design and requires less resource consumption. To avoid the precision degradation, we introduce a dynamic reconstruction method to optimize the variable node update for different iterations. Some practical aspects of the proposed decoders such as the design and decoding complexity are also discussed. Simulation results show that the MIM-QBP decoder outperforms the LUT decoders in the waterfall region with both 3-bit and 4-bit precision. Moreover, the 4-bit MIM-QMS decoder can even surpass the floating-point BP decoder in the error-floor region.
Very high data rates and decoding computational complexity place strict constraints in 5G and 6G communications. In this paper, non-uniform Quantized Decoding algorithm is proposed for Low-density Parity Check codes (LDPC). In the proposed algorithm, the check node updating process is carried out using quantization, which reduces complexity. The Sum Product Algorithm (SPA) is iterative message passing decoding techniques offer the optimal performance for LDPC codes. Implementations use message-passing decoding with more precision, results extremely high complexity. In Iterative, message-passing (MP), trapping sets and absorbing sets causes low error floor. In this article non-uniform quantization proposed to overcome dynamic range of values over uniform quantization. Simulation results provide coding gain increases closer to of 0.5 dB in higher SNR and has good error floor at 10−5.