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

International Conference on Communications and Networking in China (ChinaCom)

A simplified decoding algorithm for nonbinary LDPC codes

Ce-lun Liu, Jianping An, Xiangyuan Bu

Published Aug 1, 2009• 1 citation
Publisher

Abstract

A simplified decoding algorithm for low-density parity-check (LDPC) codes over high order Galois field is proposed to reduce the complexity of traditional sum-product algorithm (SPA). There are only addition operation and comparison operation in this algorithm, without complex multiplication operation. The computation complexity of proposed algorithm is much smaller than the SPA. The signal-to-noise power ratio (SNR) isn't needed in this algorithm, so the process of SNR estimation can also be removed. The simulation results show that the bit error rate (BER) performance of proposed algorithm degrades only about 0.5 dB than the SPA, so the proposed algorithm is an efficient simplified algorithm in engineering.

DOI
10.1109/chinacom.2009.5339910

Related papers

New simplified sum-product algorithm for low complexity LDPC decoding

Myung Hun Lee, Jae Hee Han, Myung Hoon Sunwoo

This paper proposes new simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes. The proposed SSP algorithm can replace multiplications and divisions with additions and subtractions without extra computations. In addition, the proposed SSP algorithm can simplify both the ln[tanh(x)] and exp[tanh-1(x)] by using two quantization tables which can reduce tremendous computational complexity. Moreover, the simulation results show that the proposed SSP algorithm can improve about 0.3~0.8 dB of BER performance compared with the existing modified sum-product algorithm.

SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems•Oct 1, 2008•10 citations

Simplified sum-product algorithm using piecewise linear function approximation for low complexity LDPC decoding

Jae Hee Han, Myung Hoon Sunwoo

This paper proposes the simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes (LDPC). The sum-product algorithm achieves the highest BER performance among the LDPC decoding algorithms. However, based on the hyperbolic tangent and inverse hyperbolic tangent functions for the check node updates, the sum-product (SP) algorithm requires high computational complexity. To reduce computational complexity, the proposed SSP algorithm adopts a piecewise linear approximation, the logarithmic and exponential functions, which can replace multiplications and divisions with additions and subtractions. In addition, the proposed SSP algorithm can simplify both the ln[tanh(x)] and tanh-1[exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Simulation results show that the proposed SSP algorithm can improve about 0.8 dB of bit error ratio (BER) performance compared with the modified sum-product algorithm.

International Conference on Ubiquitous Information Management and Communication (IMCOM)•Feb 15, 2009•7 citations

A Low-complexity Iterative Decoding Algorithm for LDPC Codes

Pan Yu

Among the decoding algorithms for low-density parity-check(LDPC) code,sum-product algorithm(SPA) has the optimal performance but high complexity,while min-sum algorithm has simple implementation complexity but worse performance.Considering this performance-complexity contradiction,some modified min-sum algorithms are proposed.In this paper,researches are done based on one of the modified min-sum algorithms that is close to SPA in performance but the way modifying fraction works is simplified.Simplified algorithm remains similar in performance to sum-product algorithm but has a remarkably reduced implementation complexity.

Telecommunication Engineering•Jan 1, 2006•1 citation

New Simplified Sum-Product Algorithm for Low Complexity LDPC Decoding

Jae-Hee Han, Myung-Hoon SunWoo

This paper proposes new simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes. The proposed SSP algorithm can replace multiplications and divisions with additions and subtractions without extra computations. In addition, the proposed SSP algorithm can simplify both the In[tanh(x)] and tanh-1 [exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Moreover, the simulation results show that the proposed SSP algorithm can improve about of BER performance compared with the existing modified sum-product algorithms.

한국통신학회논문지•Jan 1, 2009•1 citation

Simplified decoding algorithm for LDPC over GF(q)

Xinmei Wang

A simple,yet effective decoding algorithm for LDPC(low-density parity-check) codes over GF(q) is presented.By taking advantages of the first-term Taylor's series expansion to approximate the correction term of the Jacobian logarithm used in LLR-SPA(log-likelihood ratio sum-product algorithm),we propose an algorithm which significantly simplifies the check node update computation of the optimal LLR-SPA.Compared to the offset min-sum algorithm,the proposed algorithm achieves a gain of about 0.2dB at the BER of 10-4.Moreover,unlike the offset min-sum algorithm,parameters of this algorithm are independent of the order of the Galois Filed.

Journal of Xidian University•Jan 1, 2011•1 citation

Efficient Difference-based Decoding Implementations of LDPC Codes

Zhanji Wu, Peng Mugen, Wang Wenbo +1 more

Efficient implementations of the sum-product algorithm (SPA) for decoding low-density parity-check (LDPC) codes using difference-based messages between bit nodes and check nodes are presented. As for the updates of check nodes, reduced- complexity derivatives are also put forward. As compared with the traditional Log-Likelihood-Ratio(LLR)-based decoding implementations, the proposed method has much lower complexity and latency, while it has no obvious loss of the error performance.

IEEE Communications Letters•May 1, 2008•3 citations
A simplified decoding algorithm for low-density parity-check (LDPC) codes over high order Galois field is proposed to reduce the complexity of traditional sum-product algorithm (SPA). There are only addition operation and comparison operation in this algorithm, without complex multiplication operation. The computation complexity of proposed algorithm is much smaller than the SPA. The signal-to-noise power ratio (SNR) isn't needed in this algorithm, so the process of SNR estimation can also be removed. The simulation results show that the bit error rate (BER) performance of proposed algorithm degrades only about 0.5 dB than the SPA, so the proposed algorithm is an efficient simplified algorithm in engineering.
This paper proposes new simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes. The proposed SSP algorithm can replace multiplications and divisions with additions and subtractions without extra computations. In addition, the proposed SSP algorithm can simplify both the ln[tanh(x)] and exp[tanh-1(x)] by using two quantization tables which can reduce tremendous computational complexity. Moreover, the simulation results show that the proposed SSP algorithm can improve about 0.3~0.8 dB of BER performance compared with the existing modified sum-product algorithm.
This paper proposes the simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes (LDPC). The sum-product algorithm achieves the highest BER performance among the LDPC decoding algorithms. However, based on the hyperbolic tangent and inverse hyperbolic tangent functions for the check node updates, the sum-product (SP) algorithm requires high computational complexity. To reduce computational complexity, the proposed SSP algorithm adopts a piecewise linear approximation, the logarithmic and exponential functions, which can replace multiplications and divisions with additions and subtractions. In addition, the proposed SSP algorithm can simplify both the ln[tanh(x)] and tanh-1[exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Simulation results show that the proposed SSP algorithm can improve about 0.8 dB of bit error ratio (BER) performance compared with the modified sum-product algorithm.
Among the decoding algorithms for low-density parity-check(LDPC) code,sum-product algorithm(SPA) has the optimal performance but high complexity,while min-sum algorithm has simple implementation complexity but worse performance.Considering this performance-complexity contradiction,some modified min-sum algorithms are proposed.In this paper,researches are done based on one of the modified min-sum algorithms that is close to SPA in performance but the way modifying fraction works is simplified.Simplified algorithm remains similar in performance to sum-product algorithm but has a remarkably reduced implementation complexity.
This paper proposes new simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes. The proposed SSP algorithm can replace multiplications and divisions with additions and subtractions without extra computations. In addition, the proposed SSP algorithm can simplify both the In[tanh(x)] and tanh-1 [exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Moreover, the simulation results show that the proposed SSP algorithm can improve about of BER performance compared with the existing modified sum-product algorithms.
A simple,yet effective decoding algorithm for LDPC(low-density parity-check) codes over GF(q) is presented.By taking advantages of the first-term Taylor's series expansion to approximate the correction term of the Jacobian logarithm used in LLR-SPA(log-likelihood ratio sum-product algorithm),we propose an algorithm which significantly simplifies the check node update computation of the optimal LLR-SPA.Compared to the offset min-sum algorithm,the proposed algorithm achieves a gain of about 0.2dB at the BER of 10-4.Moreover,unlike the offset min-sum algorithm,parameters of this algorithm are independent of the order of the Galois Filed.