© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Cambridge University Press eBooks

Nonbinary LDPC Codes

W.E. Ryan, Shu Wen Lin

Published Sep 17, 2009• 0 citations

Abstract

Although a great deal of research effort has been expended on the design, construction, encoding, decoding, performance analysis, and applications of binary LDPC codes in communication and storage systems, very little has been done on nonbinary LDPC codes in these respects. The first study of nonbinary LDPC codes was conducted by Davey and MacKay in 1998. In their paper, they generalized the SPA for decoding binary LDPC codes to decode q -ary LDPC codes, called QSPA . Later, in 2000, MacKay and Davey introduced a fast-Fourier-transform (FFT)-based QSPA to reduce the decoding computational complexity of QSPA. This decoding algorithm is referred to as FFT-QSPA. MacKay and Davey's work on FFT-QSPA was further improved by Barnault and Declercq in 2003 and Declercq and Fossorier in 2007. Significant works on the design, construction and analysis of nonbinary LDPC codes didn't appear until the middle of 2000. Results in these works are very encouraging. They show that nonbinary LDPC codes have a great potential to replace widely used RS codes in some applications in communication and storage systems. This chapter is devoted to nonbinary LDPC codes. Just like binary LDPC codes, nonbinary LDPC codes can be classified into two major categories: (1) random-like nonbinary codes constructed by computer under certain design criteria or rules; and (2) structured nonbinary codes constructed on the basis of algebraic or combinatorial tools, such as finite fields and finite geometries.

DOI: 10.1017/cbo9780511803253.015

Related papers

A Construction of Algebraic Geometric LDPC Codes*

Dongliang Xiao, Huizhen Li, Ke Wen +1 more

This paper presents an original method for constructing high performance non-binary LDPC codes based on algebraic geometric codes’ parity check matrix. Codes constructed based on this method perform very well over the AWGN channel. With iterative decoding using a Fast Fourier Transform (FFT) based q-ary sum-product algorithm (QSPA), AG-LDPC codes achieve significantly large coding gains over the PEG non-binary LDPC and binary LDPC. Simulation results also show that the AG-LDPC significantly lower the decoding error floor, and the undetected error rate.

IEEE/CIC International Conference on Communications in China (ICCC)•Aug 7, 2024•0 citations

Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes

Shu Hwa Lin, Shumei Song, Ying Tai +2 more

In the late 1950's and early 1960's, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for correcting random errors with algebraic decoding, such as Bose-Chaudhuri-Hocqenghem (BCH) and Reed-Solomon (RS) codes. Recently it has been shown that finite fields can also be used successfully to construct binary quasi-cyclic (QC)-LDPC codes that perform very well not only over the AWGN channel but also over the binary erasure channel with iterative decoding, besides being efficiently encodable. This paper is concerned with constructions of nonbinary QC-LDPC codes based on finite fields

International Conference on Communications, Circuits and Systems•Jun 1, 2006•19 citations

Research on encoding and decoding algorithms of non-binary LDPC code and FPGA implementation

Zhongxun Wang, Baojun Liu, Min Zhang +1 more

Low density parity check (LDPC) code is a kind of linear block code with excellent performance which is proposed by Dr. Gallager. It overcomes the shortcomings of other error correcting codes and it is the nearest channel code from Shannon limit at the present discover. The decoding algorithms of L DPC code can reduce the decoding delay by the parallel decoding structure, so this has caused great concern in many fields. In recent years more and more scholars begin to study LDPC code, this makes the coding and decoding algorithms of LDPC code improved continuously. LDPC code has been widely used in many fields such as optical fiber communication, digital watermarking, underwater communication and deep space communication because of its excellent performance. Non-binary LDPC code has better performance compared with binary LDPC code. In this paper, FFT-BP decoding algorithm of non-binary LDPC code is studied, and on this basis, we proposed an improved FFT-BP algorithm. The improved decoding algorithm can effectively reduce the average iteration number. Finally, we achieved encode and decode algorithm of non-binary LDPC code with FPGA.

Journal of Computational Methods in Sciences and Engineering•Aug 20, 2019•1 citation

Three algebraic methods for constructing nonbinary LDPC codes based on finite fields

Keke Liu, Zesong Fei, Jingming Kuang

In this paper, we present three algebraic methods for constructing structured nonbinary LDPC codes over finite fields, among which the first method is used to construct quasi-cyclic codes with girth at least 6 based on the automorphisms of finite fields, the second method gives a class of (4,ρ) quasi-cyclic codes with girth at least 8, the third method gives a class of codes with cycles limited. Simulation results show that the constructed codes perform very well over AWGN channel, and they have better performances or far lower computational complexities than the corresponding random Mackay codes or codes algebraically constructed by Lin.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2008•2 citations

Non-Binary Protograph-Based LDPC Codes: Enumerators, Analysis, and Designs

Lara Dolecek, D. Divsalar, Yizeng Sun +1 more

This paper provides a comprehensive analysis of nonbinary low-density parity check (LDPC) codes built out of protographs. We consider both random and constrained edge-weight labeling, and refer to the former as the unconstrained nonbinary protograph-based LDPC codes (U-NBPB codes) and to the latter as the constrained nonbinary protograph-based LDPC codes (C-NBPB codes). Equipped with combinatorial definitions extended to the nonbinary domain, ensemble enumerators of codewords, trapping sets, stopping sets, and pseudocodewords are calculated. The exact enumerators are presented in the finite-length regime, and the corresponding growth rates are calculated in the asymptotic regime. An EXIT chart tool for computing the iterative decoding thresholds of protograph-based LDPC codes is presented, followed by several examples of finite-length U-NBPB and C-NBPB codes with high performance. Throughout this paper, we provide accompanying examples, which demonstrate the advantage of nonbinary protograph-based LDPC codes over their binary counterparts and over random constructions. The results presented in this paper advance the analytical toolbox of nonbinary graph-based codes.

IEEE Transactions on Information Theory•Apr 9, 2014•95 citations

Construction of Structured Regular LDPC Codes: A Design-Theoretic Approach

Hossein Falsafain, Morteza Esmaeili

A new combinatorial technique for constructing girth-6 structured binary regular low-density parity-check (LDPC) codes based on special types of t-designs is given. A very large number of well-known t-designs can be used by this method for code construction. Based on this method, a t-(v,k,λ) design D=(X,B) can be exploited for code construction if it satisfies the following three conditions: 1) |B1 ∩ B2|≤ t for any two blocks B1,B2∈ B and B1≠ B2; 2) λ>1; and 3) k>t. Though the technique works for any t-design satisfying these conditions, we focus only on the utilization of simple triple systems, super-simple BIBDs, Steiner systems, and large sets (LSs) of t-designs. We also construct binary and non-binary girth-6 QC-LDPC codes from the t-designs satisfying these conditions by using matrix dispersion method. Experimental results show that the constructed non-binary QC-LDPC codes can provide good practical performance under iterative decoding using the fast Fourier transform based q-ary sum-product algorithm (FFT-QSPA) and they can achieve acceptable coding gains over random-like codes of comparable parameters decoded with sum-product algorithm (SPA).

IEEE Transactions on Communications•May 1, 2013•8 citations

Although a great deal of research effort has been expended on the design, construction, encoding, decoding, performance analysis, and applications of binary LDPC codes in communication and storage systems, very little has been done on nonbinary LDPC codes in these respects. The first study of nonbinary LDPC codes was conducted by Davey and MacKay in 1998. In their paper, they generalized the SPA for decoding binary LDPC codes to decode q -ary LDPC codes, called QSPA . Later, in 2000, MacKay and Davey introduced a fast-Fourier-transform (FFT)-based QSPA to reduce the decoding computational complexity of QSPA. This decoding algorithm is referred to as FFT-QSPA. MacKay and Davey's work on FFT-QSPA was further improved by Barnault and Declercq in 2003 and Declercq and Fossorier in 2007. Significant works on the design, construction and analysis of nonbinary LDPC codes didn't appear until the middle of 2000. Results in these works are very encouraging. They show that nonbinary LDPC codes have a great potential to replace widely used RS codes in some applications in communication and storage systems. This chapter is devoted to nonbinary LDPC codes. Just like binary LDPC codes, nonbinary LDPC codes can be classified into two major categories: (1) random-like nonbinary codes constructed by computer under certain design criteria or rules; and (2) structured nonbinary codes constructed on the basis of algebraic or combinatorial tools, such as finite fields and finite geometries.

This paper presents an original method for constructing high performance non-binary LDPC codes based on algebraic geometric codes’ parity check matrix. Codes constructed based on this method perform very well over the AWGN channel. With iterative decoding using a Fast Fourier Transform (FFT) based q-ary sum-product algorithm (QSPA), AG-LDPC codes achieve significantly large coding gains over the PEG non-binary LDPC and binary LDPC. Simulation results also show that the AG-LDPC significantly lower the decoding error floor, and the undetected error rate.

In the late 1950's and early 1960's, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for correcting random errors with algebraic decoding, such as Bose-Chaudhuri-Hocqenghem (BCH) and Reed-Solomon (RS) codes. Recently it has been shown that finite fields can also be used successfully to construct binary quasi-cyclic (QC)-LDPC codes that perform very well not only over the AWGN channel but also over the binary erasure channel with iterative decoding, besides being efficiently encodable. This paper is concerned with constructions of nonbinary QC-LDPC codes based on finite fields

Low density parity check (LDPC) code is a kind of linear block code with excellent performance which is proposed by Dr. Gallager. It overcomes the shortcomings of other error correcting codes and it is the nearest channel code from Shannon limit at the present discover. The decoding algorithms of L DPC code can reduce the decoding delay by the parallel decoding structure, so this has caused great concern in many fields. In recent years more and more scholars begin to study LDPC code, this makes the coding and decoding algorithms of LDPC code improved continuously. LDPC code has been widely used in many fields such as optical fiber communication, digital watermarking, underwater communication and deep space communication because of its excellent performance. Non-binary LDPC code has better performance compared with binary LDPC code. In this paper, FFT-BP decoding algorithm of non-binary LDPC code is studied, and on this basis, we proposed an improved FFT-BP algorithm. The improved decoding algorithm can effectively reduce the average iteration number. Finally, we achieved encode and decode algorithm of non-binary LDPC code with FPGA.

In this paper, we present three algebraic methods for constructing structured nonbinary LDPC codes over finite fields, among which the first method is used to construct quasi-cyclic codes with girth at least 6 based on the automorphisms of finite fields, the second method gives a class of (4,ρ) quasi-cyclic codes with girth at least 8, the third method gives a class of codes with cycles limited. Simulation results show that the constructed codes perform very well over AWGN channel, and they have better performances or far lower computational complexities than the corresponding random Mackay codes or codes algebraically constructed by Lin.

This paper provides a comprehensive analysis of nonbinary low-density parity check (LDPC) codes built out of protographs. We consider both random and constrained edge-weight labeling, and refer to the former as the unconstrained nonbinary protograph-based LDPC codes (U-NBPB codes) and to the latter as the constrained nonbinary protograph-based LDPC codes (C-NBPB codes). Equipped with combinatorial definitions extended to the nonbinary domain, ensemble enumerators of codewords, trapping sets, stopping sets, and pseudocodewords are calculated. The exact enumerators are presented in the finite-length regime, and the corresponding growth rates are calculated in the asymptotic regime. An EXIT chart tool for computing the iterative decoding thresholds of protograph-based LDPC codes is presented, followed by several examples of finite-length U-NBPB and C-NBPB codes with high performance. Throughout this paper, we provide accompanying examples, which demonstrate the advantage of nonbinary protograph-based LDPC codes over their binary counterparts and over random constructions. The results presented in this paper advance the analytical toolbox of nonbinary graph-based codes.

A new combinatorial technique for constructing girth-6 structured binary regular low-density parity-check (LDPC) codes based on special types of t-designs is given. A very large number of well-known t-designs can be used by this method for code construction. Based on this method, a t-(v,k,λ) design D=(X,B) can be exploited for code construction if it satisfies the following three conditions: 1) |B1 ∩ B2|≤ t for any two blocks B1,B2∈ B and B1≠ B2; 2) λ>1; and 3) k>t. Though the technique works for any t-design satisfying these conditions, we focus only on the utilization of simple triple systems, super-simple BIBDs, Steiner systems, and large sets (LSs) of t-designs. We also construct binary and non-binary girth-6 QC-LDPC codes from the t-designs satisfying these conditions by using matrix dispersion method. Experimental results show that the constructed non-binary QC-LDPC codes can provide good practical performance under iterative decoding using the fast Fourier transform based q-ary sum-product algorithm (FFT-QSPA) and they can achieve acceptable coding gains over random-like codes of comparable parameters decoded with sum-product algorithm (SPA).