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

비이진 LDPC 부호를 위한 낮은 복잡도의 복호 방법 및 인터리버 설계

김경범

Published Jan 1, 2014• 0 citations
OpenAlex

Abstract

Low density parity-check (LDPC) codes have been shown to approach the Shannon-limit performance when the code length goes to infinify. On the other hand, for moderate code lengths, the error performance can be farther improved by constructing LDPC codes over finite fleld fields GF(q). However, this improvement is achieved at the expense of increased decoding complexity.In this thesis, we consider the problem of decoding nonbinary LDPC codes over GF(q) with reasonable complexity and good error-rate performance. First, the decoding algorithm with low complexity for nonbinary LDPC codes is proposed, named the weighted symbol reliablity algorithm (WSR) which uses syndrome checking result for measuring reliability of symbol nodes. Second, we analyze the extended min-sum (EMS) algorithm proposed by Declearq and Fossorier. These two approaches provide an effective trade-off between decoding complexity and error-performance, compared with the existing decoding algorithms. We also consider nonbinary LDPC codes conbined with high order QAM in order to apply them to realistic communication systems.

Related papers

비이진 LDPC 부호를 위한 낮은 복잡도를 가지는 복호 알고리즘

조한설

Low complexity parity-check (LDPC) codes have been shown to approach Shannon-limit performance for long code length. On the other hand, for moderate code length, the error performance can be improved by constructing LDPC codes over finite fleld fields GF(q). However, this improvement is achieved at the expense of increased decoding complexity.In this thesis, we consider the problem of decoding nonbinary LDPC codes over GF(q) with reasonable complexity and good error-rate performance. Two decoding algorithms with low complexity for nonbinary LDPC codes are proposed. First algorithm is the extension of weighted symbol-flipping (WSF) algorithm, and it is called multiple weighted symbol-flipping (MWSF) algorithm in this thesis. Second algorithm is based on Iterative Soft-Based Majority logic (ISBM) algorithm, and it is called extended ISBM (EISBM) in this thesis. These algorithms provide effective trade-off between decoding complexity and error-performance compared to the existing decoding algorithms.

•Jan 1, 2012•0 citations

Low-Complexity Symbol-Flipping Decoding Algorithms for Nonbinary LDPC Codes

박성현

Low-density parity-check (LDPC) codes have been shown to have near Shannon-limit performance when a probabilistic decoding is used and the code length goes to infinity. On the other hand, non-binary low-density parity-check (NB-LDPC) codes outperform binary LDPC codes for short code lengths. However, the coding gain of NB-LDPC codes comes from the expense of computational complexity. \n \nIn this thesis, we consider the problem of a trade-off between reasonable complexity and good error-rate performance of decoding nonbinary LDPC codes over GF($q$). We first introduce the existing decoding algorithms of nonbinary LDPC codes and compare with decoding algorithms of binary LDPC codes. Second, low-complexity decoding algorithms of nonbinary LDPC codes is considered and two low-complexity symbol-flipping algorithms based on D-SFDP is proposed. These algorithms outperform the existing D-SFDP algorithm by improving the flipping metric. Proposed algorithms provide good trade-off between complexity and error performance.

•Jan 1, 2018•0 citations

이진 LDPC 부호를 위한 저복잡도 복호 알고리즘

민우홍

Low-density parity-check (LDPC) codes can be efficiently decoded with high performance. Especially, sum-product algorithm can achieve excellent performance, but high complexity. Min-sum algorithm is low complexity, but less performance. So, low complexity and high performance decoding algorithm is needed. \n \n In this thesis, we consider low complexity, high performance decoding algorithms. First, we introduce various decoding algorithms for binary LDPC codes. Second, we propose normalized min-sum algorithm with three normalization factors. This algorithm outperforms the existing normalized min-sum algorithm, normalized min-sum algorithm with two normalization factors. Third, we introduce finite alphabet iterative decoders (FAID) which is a new paradigm for finite precision iterative decoding. But existing FAID algorithm only considers binary LDPC codes with column weight three. So, we propose FAID for binary LDPC codes with column weight five. Our proposed algorithms have low-complexity and good error correcting performance.

•Jan 1, 2018•0 citations

Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$

David Declercq, M.P.C. Fossorier

In this letter, we address the problem of decoding nonbinary low-density parity-check (LDPC) codes over finite fields GF(q), with reasonable complexity and good performance. In the first part of the letter, we recall the original belief propagation (BP) decoding algorithm and its Fourier domain implementation. We show that the use of tensor notations for the messages is very convenient for the algorithm description and understanding. In the second part of the letter, we introduce a simplified decoder which is inspired by the min-sum decoder for binary LDPC codes. We called this decoder extended min-sum (EMS). We show that it is possible to greatly reduce the computational complexity of the check-node processing by computing approximate reliability measures with a limited number of values in a message. By choosing appropriate correction factors or offsets, we show that the EMS decoder performance is quite good, and in some cases better than the regular BP decoder. The optimal values of the factor and offset correction are obtained asymptotically with simulated density evolution. Our simulations on ultra-sparse codes over very-high-order fields show that nonbinary LDPC codes are promising for applications which require low frame-error rates for small or moderate codeword lengths. The EMS decoder is a good candidate for practical hardware implementations of such codes

IEEE Transactions on Communications•Apr 1, 2007•725 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

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
Low density parity-check (LDPC) codes have been shown to approach the Shannon-limit performance when the code length goes to infinify. On the other hand, for moderate code lengths, the error performance can be farther improved by constructing LDPC codes over finite fleld fields GF(q). However, this improvement is achieved at the expense of increased decoding complexity.In this thesis, we consider the problem of decoding nonbinary LDPC codes over GF(q) with reasonable complexity and good error-rate performance. First, the decoding algorithm with low complexity for nonbinary LDPC codes is proposed, named the weighted symbol reliablity algorithm (WSR) which uses syndrome checking result for measuring reliability of symbol nodes. Second, we analyze the extended min-sum (EMS) algorithm proposed by Declearq and Fossorier. These two approaches provide an effective trade-off between decoding complexity and error-performance, compared with the existing decoding algorithms. We also consider nonbinary LDPC codes conbined with high order QAM in order to apply them to realistic communication systems.
Low complexity parity-check (LDPC) codes have been shown to approach Shannon-limit performance for long code length. On the other hand, for moderate code length, the error performance can be improved by constructing LDPC codes over finite fleld fields GF(q). However, this improvement is achieved at the expense of increased decoding complexity.In this thesis, we consider the problem of decoding nonbinary LDPC codes over GF(q) with reasonable complexity and good error-rate performance. Two decoding algorithms with low complexity for nonbinary LDPC codes are proposed. First algorithm is the extension of weighted symbol-flipping (WSF) algorithm, and it is called multiple weighted symbol-flipping (MWSF) algorithm in this thesis. Second algorithm is based on Iterative Soft-Based Majority logic (ISBM) algorithm, and it is called extended ISBM (EISBM) in this thesis. These algorithms provide effective trade-off between decoding complexity and error-performance compared to the existing decoding algorithms.
Low-density parity-check (LDPC) codes have been shown to have near Shannon-limit performance when a probabilistic decoding is used and the code length goes to infinity. On the other hand, non-binary low-density parity-check (NB-LDPC) codes outperform binary LDPC codes for short code lengths. However, the coding gain of NB-LDPC codes comes from the expense of computational complexity. \n \nIn this thesis, we consider the problem of a trade-off between reasonable complexity and good error-rate performance of decoding nonbinary LDPC codes over GF(qqq). We first introduce the existing decoding algorithms of nonbinary LDPC codes and compare with decoding algorithms of binary LDPC codes. Second, low-complexity decoding algorithms of nonbinary LDPC codes is considered and two low-complexity symbol-flipping algorithms based on D-SFDP is proposed. These algorithms outperform the existing D-SFDP algorithm by improving the flipping metric. Proposed algorithms provide good trade-off between complexity and error performance.
Low-density parity-check (LDPC) codes can be efficiently decoded with high performance. Especially, sum-product algorithm can achieve excellent performance, but high complexity. Min-sum algorithm is low complexity, but less performance. So, low complexity and high performance decoding algorithm is needed. \n \n In this thesis, we consider low complexity, high performance decoding algorithms. First, we introduce various decoding algorithms for binary LDPC codes. Second, we propose normalized min-sum algorithm with three normalization factors. This algorithm outperforms the existing normalized min-sum algorithm, normalized min-sum algorithm with two normalization factors. Third, we introduce finite alphabet iterative decoders (FAID) which is a new paradigm for finite precision iterative decoding. But existing FAID algorithm only considers binary LDPC codes with column weight three. So, we propose FAID for binary LDPC codes with column weight five. Our proposed algorithms have low-complexity and good error correcting performance.
Decoding Algorithms for Nonbinary LDPC Codes Over GF(q)(q)(q)
In this letter, we address the problem of decoding nonbinary low-density parity-check (LDPC) codes over finite fields GF(q), with reasonable complexity and good performance. In the first part of the letter, we recall the original belief propagation (BP) decoding algorithm and its Fourier domain implementation. We show that the use of tensor notations for the messages is very convenient for the algorithm description and understanding. In the second part of the letter, we introduce a simplified decoder which is inspired by the min-sum decoder for binary LDPC codes. We called this decoder extended min-sum (EMS). We show that it is possible to greatly reduce the computational complexity of the check-node processing by computing approximate reliability measures with a limited number of values in a message. By choosing appropriate correction factors or offsets, we show that the EMS decoder performance is quite good, and in some cases better than the regular BP decoder. The optimal values of the factor and offset correction are obtained asymptotically with simulated density evolution. Our simulations on ultra-sparse codes over very-high-order fields show that nonbinary LDPC codes are promising for applications which require low frame-error rates for small or moderate codeword lengths. The EMS decoder is a good candidate for practical hardware implementations of such codes
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.
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.