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

Electronic Science and Technology

Research into Non-binary LDPC Decoding Performance Factors

Ming Diao

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

The non-binary LDPC is the promotion to the finite GF(q) of binary LDPC codes.The parity check matrix elements is no longer 0 and 1,but collections(0,1,2,…,q-1),while the decoding still uses the efficient iterative decoding based on belief propagation algorithm.This paper focuses on the check matrix of structure of the quasi-cyclic LDPC codes(QC-LDPC) as well as the min-sum decoding algorithm.Then the LDPC codes decoding performance is simulated under different conditions in white Gaussian noise channel(AWGN) with Matlab.Finally,the impact of non-binary LDPC Decoding performance factors is analyzed.

Related papers

Study on Decoding Algorithm for Non-Binary LDPC Codes

Lei Wen

Non-binary LDPC codes are obtained by generalizing binary LDPC coeds from finite field GF(2) to finite field GF(q).Its elements of parity check matrix are not(0,1),but ensemble(0,1,…,q-1),and its decoding method still employs belief propagation and iterative algorithm.This paper mainly derives the iterative formulas of decoding algorithm for Non-Binary LDPC codes and analyzes an improved algorithm based on FFT.Finally,the predominant performance of FFT decoding algorithm is verified by simulation.

Communications technology•Jan 1, 2011•0 citations

Performance study of non-binary LDPC Codes over GF(q)

V. S. Ganepola, R.A. Carrasco, Ian James Wassell +1 more

Low-density parity check (LDPC) codes are known to perform well in the presence of additive white Gaussian noise (AWGN) but for very large block lengths. It has been proposed to define the codes over high order Galois fields to overcome this limitation. In this paper we construct new quasi-cyclic non-binary LDPC codes with moderate code lengths from Reed-Solomon codes with two message symbols proposed by Lin et al defined over large finite fields. We evaluate the performance of these codes on the AWGN channel by computer simulation and show that they outperform binary LDPC codes of the same length in binary bits.

International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)•Jul 1, 2008•21 citations

Reduced complexity and improved performance decoding algorithm for nonbinary LDPC codes over GF(q)

Xin Chen, Aidong Men

Low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, we present a new reduced-complexity belief propagation (BP) decoding algorithm for GF(q)-LDPC codes by analyzing the reliability of code symbols. Instead of update all the variable nodes during iteration, we just update variable nodes which are mostly to be in an error. The algorithm also shows a property to reduce the effects of oscillating on decoding. The simulations prove that we could improve performance and reduce complexity at the same time for short and medium GF(q)-LDPC codes.

IEEE International Conference on Communication Technology (ICCT)•Nov 1, 2008•6 citations

An Updating Decoding Algorithm of Non-binary LDPC Codes

Xiaoyu Wang

This paper presents an improved decoding algorithm of non-binary LDPC codes based on the Expanded Min-Sum algorithm,analyzes the complexity of the algorithm in decoding efficiency.According to the fact that the reliability of variable note is increased with the increase of the iterative number,the reliability of the variable notes is estimated by the maximum post probability of variable notes and illegal parity-check values.By the estimation rule,the iterative calculations or some variable notes are stopped,the number of calculation for updating variable and parity-check notes is reduced,thus the decoding complexity is decreased and the decoding efficiency is improved.A simulation is made using regular non-binary LDPC codes under White Gaussian Noise channel based on GF(4),the result shows that the performance decreases by about 0.05 dB when BER(Bit Error Rate) is,but the decoding complexity is reduced and the decoding efficiency is improved significantly.

Journal of Air Force Engineering University•Jan 1, 2010•0 citations

FFT based sum product decoding algorithm of LDPC coder for GF(q)

Jigisha N. Patel, Neeta Chapatwala, Mrugesh Patel

Low Density Parity Check (LDPC) codes have excellent error correcting performance. LDPC codes are one of the block coding techniques and it performs near Shannon limit and recommended for many practical applications. Non-binary LDPC codes extension of binary LDPC in error correcting property especially for short and moderate block length. In many digital communication systems these codes have strong competitors of turbo codes for error control. Low Density Parity Check as it name is suggests that in a parity check matrix (H) consists of very small number of non-zero elements comparing with zero elements. The strength of the LDPC code defines Parity Check Matrix (PCM). LDPC code contains two types of decoding algorithms hard and soft decision algorithm. By comparing with other traditional decoding algorithm FFT based sum product algorithm reduced computation complexity with better decoding performance. In this paper, LDPC codes for FFT based sum product decoding algorithm performances are analysed for various order of Galois Field GF(q) using AWGN channel. Decoding performance measured in terms of symbol error rate which improve with increasing order of Galois field.

International Conference on Emerging Technology Trends in Electronics, Communication and Networking (ET2ECN)•Dec 1, 2014•3 citations

Performance evaluation of regular cycle non-binary LDPC codes in AWGN channel

Ameenudeen Pe, Anchare V. Babu

Low Density Parity Check Codes (LDPC) are a group of channel codes which can be decoded using a graph. LDPC codes are known to give near Shannon limit performance in Additive White Gaussian Channel (AWGN), but for large block-lengths and irregular construction. To overcome this limitation, it has been proposed to define codes over a higher order Galois Field. In this paper,we construct a regular cycle non binary LDPC code over GF(q), where q=2p.We use a Fast Fourier Transform (FFT) based low complexity algorithm to decode the LDPC code defined over a large Galois Field. We evaluate the performance of these codes in AWGN channel using computer simulations and show that they are giving excellent BER performance.

International Conference on Advances in Computing, Communications and Informatics (ICACCI)•Aug 3, 2012•0 citations
The non-binary LDPC is the promotion to the finite GF(q) of binary LDPC codes.The parity check matrix elements is no longer 0 and 1,but collections(0,1,2,…,q-1),while the decoding still uses the efficient iterative decoding based on belief propagation algorithm.This paper focuses on the check matrix of structure of the quasi-cyclic LDPC codes(QC-LDPC) as well as the min-sum decoding algorithm.Then the LDPC codes decoding performance is simulated under different conditions in white Gaussian noise channel(AWGN) with Matlab.Finally,the impact of non-binary LDPC Decoding performance factors is analyzed.
Non-binary LDPC codes are obtained by generalizing binary LDPC coeds from finite field GF(2) to finite field GF(q).Its elements of parity check matrix are not(0,1),but ensemble(0,1,…,q-1),and its decoding method still employs belief propagation and iterative algorithm.This paper mainly derives the iterative formulas of decoding algorithm for Non-Binary LDPC codes and analyzes an improved algorithm based on FFT.Finally,the predominant performance of FFT decoding algorithm is verified by simulation.
Low-density parity check (LDPC) codes are known to perform well in the presence of additive white Gaussian noise (AWGN) but for very large block lengths. It has been proposed to define the codes over high order Galois fields to overcome this limitation. In this paper we construct new quasi-cyclic non-binary LDPC codes with moderate code lengths from Reed-Solomon codes with two message symbols proposed by Lin et al defined over large finite fields. We evaluate the performance of these codes on the AWGN channel by computer simulation and show that they outperform binary LDPC codes of the same length in binary bits.
Low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, we present a new reduced-complexity belief propagation (BP) decoding algorithm for GF(q)-LDPC codes by analyzing the reliability of code symbols. Instead of update all the variable nodes during iteration, we just update variable nodes which are mostly to be in an error. The algorithm also shows a property to reduce the effects of oscillating on decoding. The simulations prove that we could improve performance and reduce complexity at the same time for short and medium GF(q)-LDPC codes.
This paper presents an improved decoding algorithm of non-binary LDPC codes based on the Expanded Min-Sum algorithm,analyzes the complexity of the algorithm in decoding efficiency.According to the fact that the reliability of variable note is increased with the increase of the iterative number,the reliability of the variable notes is estimated by the maximum post probability of variable notes and illegal parity-check values.By the estimation rule,the iterative calculations or some variable notes are stopped,the number of calculation for updating variable and parity-check notes is reduced,thus the decoding complexity is decreased and the decoding efficiency is improved.A simulation is made using regular non-binary LDPC codes under White Gaussian Noise channel based on GF(4),the result shows that the performance decreases by about 0.05 dB when BER(Bit Error Rate) is,but the decoding complexity is reduced and the decoding efficiency is improved significantly.
Low Density Parity Check (LDPC) codes have excellent error correcting performance. LDPC codes are one of the block coding techniques and it performs near Shannon limit and recommended for many practical applications. Non-binary LDPC codes extension of binary LDPC in error correcting property especially for short and moderate block length. In many digital communication systems these codes have strong competitors of turbo codes for error control. Low Density Parity Check as it name is suggests that in a parity check matrix (H) consists of very small number of non-zero elements comparing with zero elements. The strength of the LDPC code defines Parity Check Matrix (PCM). LDPC code contains two types of decoding algorithms hard and soft decision algorithm. By comparing with other traditional decoding algorithm FFT based sum product algorithm reduced computation complexity with better decoding performance. In this paper, LDPC codes for FFT based sum product decoding algorithm performances are analysed for various order of Galois Field GF(q) using AWGN channel. Decoding performance measured in terms of symbol error rate which improve with increasing order of Galois field.
Low Density Parity Check Codes (LDPC) are a group of channel codes which can be decoded using a graph. LDPC codes are known to give near Shannon limit performance in Additive White Gaussian Channel (AWGN), but for large block-lengths and irregular construction. To overcome this limitation, it has been proposed to define codes over a higher order Galois Field. In this paper,we construct a regular cycle non binary LDPC code over GF(q), where q=2p.We use a Fast Fourier Transform (FFT) based low complexity algorithm to decode the LDPC code defined over a large Galois Field. We evaluate the performance of these codes in AWGN channel using computer simulations and show that they are giving excellent BER performance.