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

Telecommunication Engineering

Construction of Nonbinary LDPC Codes Based on BIBD Circulant Permutation Matrices

Jun Gao

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

The algebraic method for constructing nonbinary quasi-cyclic(QC) low-density parity-check(LDPC) codes based on balanced incomplete block designs(BIBD) is presented.The generalized nonbinary location vector is proposed on constructions.A nonbinary matrix,which consists of nonbinary circulant submatrices,is formed by generalized two-dimensional matrix dispersion considering the generalized nonbinary location vector and BIBD method.The codes constructed by this method have girths at least 6.Experimental results show that significant coding gains are achieved over Reed-Solomon codes of the same parameters under the Additive White Gaussian Noise(AWGN) channel with iterative decoding Fast Fourier Transform based q-ary Sum-Product Algorithm(FFT-QSPA).And a good performance is also achieved over nonbinary Mackay LDPC codes with almost the same conditions.

Related papers

LDPC Code Based on Balanced Incomplete Block Design and Cycle Permutation Matrix

Yanhu Shan

A method to construct a flexible length or rate of quasi-cyclic Low Density Parity Check(LDPC) codes based on Balanced Incomplete Block Design(BIBD) and cycle permutation matrix is proposed.Based on actual demand,the corresponding template matrix is constructed by BIBD method.The template matrix is extended by the appropriate cycle permutation matrix.The quasi-cyclic LDPC codes constructed by the proposed method have a good structure and flexibility.This method improves the efficiency of construction good codes which meet the needs of a practical application.Simulations show that quasi-cyclic LDPC codes constructed by the proposed method perform well over AWGN channels with iterative decoding and have a lower error floor.

Jisuanji gongcheng•Jan 1, 2012•0 citations

Large-Girth Nonbinary QC-LDPC Codes of Various Lengths

Jie Huang, Lei Liu, Wuyang Zhou +1 more

In this paper, we construct nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes whose parity check matrices consist of an array of square sub-matrices which are either zero matrices or circulant permutation matrices. We propose a novel method to design the shift offset values of the circulant permutation sub-matrices, so that the code length can vary while maintaining a large girth. Extensive Monte Carlo simulations demonstrate that the obtained codes of a wide range of rates (from 1/2 to 8/9) with length from 1000 to 10000 bits have very good performance over both AWGN and Rayleigh fading channels. Furthermore, the proposed method is extended to design multiple nonbinary QC-LDPC codes simultaneously where each individual code can achieve large girth with variable lengths. The proposed codes are appealing to practical adaptive systems where the block length and code rate need to be adaptively adjusted depending on traffic characteristics and channel conditions.

IEEE Transactions on Communications•Oct 27, 2010•37 citations

New Constructions of Quasi-Cyclic LDPC Codes Based on Special Classes of BIBDs for the AWGN and Binary Erasure Channels

Lan Lan, Ying Yu Tai, Shu Lin +2 more

This paper presents new methods for efficiently constructing encodable quasi-cyclic low-density parity-check (LDPC) codes based on special balanced incomplete block designs (BIBDs). Codes constructed perform well over both the additive white Gaussian noise (AWGN) and binary erasure channels with iterative decoding.

IEEE Transactions on Communications•Dec 1, 2007•11 citations

Construction of well-structured quasi-cyclic low-density parity check codes

B. Honary, Abdolhosein Moinian, Bassem Ammar

Two classes of well-structured binary low-density parity check codes (LDPC) are described. The first class is based on a branch of combinatorial mathematics, known as the balanced incomplete block design (BIBD). Construction of three types of codes derived from BIBD designs is illustrated in addition to a family of LDPC codes constructed by decomposition of incidence matrices of the proposed BIBD designs. The decomposition technique reduces the density of the parity check matrix and hence reduces the number of short cycles, which generally lead to better performing LDPC codes. The second class of well-structured LDPC codes, Vandermonde or array LDPC codes, are defined by a small number of parameters and cover a large set of code lengths and rates with different column weights. The presented LDPC codes are quasi-cyclic with no cycles of length four; hence simple encoding while maintaining good performance is achieved. Furthermore, the codes are compared with known random LDPC codes, in order to assess their relative achievable performance/complexity trade-offs. It is shown that well-structured LDPC codes perform very similar to the known random LDPC codes.

IEE Proceedings - Communications•Jan 1, 2005•10 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

구조적인 LDPC 부호의 설계 및 성능 분석

최상훈

The objective of this thesis is to develop schemes to construct algebraically structured low-density parity-check (LDPC) codes for improving their performance and memory efficiency. It is well-known that the sum-product algorithm provides optimum decoding for LDPC codes with no cycles. However, short cycles in the Tanner graph of LDPC codes may induce a serious performance degradation. Several researchers made an effort to obtain the LDPC codes with no short cycles. Quasi-cyclic LDPC (QC-LDPC) code is a type of LDPC codes, based on circulant permutation matrices. It required a smaller size of memory for encoding and/or decoding and are easier to analyze their algebraic properties than random LDPC codes. This motivates us to take an intensive interest in constructing nonbinary QC-LDPC codes without short cycles. In this thesis, we propose a construction method of nonbinary QC-LDPC codes without short cycles. We present the mathematical proof for girth and cycle properties of proposed design method. As a result, we present the constructing method for nonbinary QC-LDPC codes without short cycles and show it performs well.

•Jan 1, 2016•0 citations
The algebraic method for constructing nonbinary quasi-cyclic(QC) low-density parity-check(LDPC) codes based on balanced incomplete block designs(BIBD) is presented.The generalized nonbinary location vector is proposed on constructions.A nonbinary matrix,which consists of nonbinary circulant submatrices,is formed by generalized two-dimensional matrix dispersion considering the generalized nonbinary location vector and BIBD method.The codes constructed by this method have girths at least 6.Experimental results show that significant coding gains are achieved over Reed-Solomon codes of the same parameters under the Additive White Gaussian Noise(AWGN) channel with iterative decoding Fast Fourier Transform based q-ary Sum-Product Algorithm(FFT-QSPA).And a good performance is also achieved over nonbinary Mackay LDPC codes with almost the same conditions.
A method to construct a flexible length or rate of quasi-cyclic Low Density Parity Check(LDPC) codes based on Balanced Incomplete Block Design(BIBD) and cycle permutation matrix is proposed.Based on actual demand,the corresponding template matrix is constructed by BIBD method.The template matrix is extended by the appropriate cycle permutation matrix.The quasi-cyclic LDPC codes constructed by the proposed method have a good structure and flexibility.This method improves the efficiency of construction good codes which meet the needs of a practical application.Simulations show that quasi-cyclic LDPC codes constructed by the proposed method perform well over AWGN channels with iterative decoding and have a lower error floor.
In this paper, we construct nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes whose parity check matrices consist of an array of square sub-matrices which are either zero matrices or circulant permutation matrices. We propose a novel method to design the shift offset values of the circulant permutation sub-matrices, so that the code length can vary while maintaining a large girth. Extensive Monte Carlo simulations demonstrate that the obtained codes of a wide range of rates (from 1/2 to 8/9) with length from 1000 to 10000 bits have very good performance over both AWGN and Rayleigh fading channels. Furthermore, the proposed method is extended to design multiple nonbinary QC-LDPC codes simultaneously where each individual code can achieve large girth with variable lengths. The proposed codes are appealing to practical adaptive systems where the block length and code rate need to be adaptively adjusted depending on traffic characteristics and channel conditions.
Two classes of well-structured binary low-density parity check codes (LDPC) are described. The first class is based on a branch of combinatorial mathematics, known as the balanced incomplete block design (BIBD). Construction of three types of codes derived from BIBD designs is illustrated in addition to a family of LDPC codes constructed by decomposition of incidence matrices of the proposed BIBD designs. The decomposition technique reduces the density of the parity check matrix and hence reduces the number of short cycles, which generally lead to better performing LDPC codes. The second class of well-structured LDPC codes, Vandermonde or array LDPC codes, are defined by a small number of parameters and cover a large set of code lengths and rates with different column weights. The presented LDPC codes are quasi-cyclic with no cycles of length four; hence simple encoding while maintaining good performance is achieved. Furthermore, the codes are compared with known random LDPC codes, in order to assess their relative achievable performance/complexity trade-offs. It is shown that well-structured LDPC codes perform very similar to the known random LDPC 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).
The objective of this thesis is to develop schemes to construct algebraically structured low-density parity-check (LDPC) codes for improving their performance and memory efficiency. It is well-known that the sum-product algorithm provides optimum decoding for LDPC codes with no cycles. However, short cycles in the Tanner graph of LDPC codes may induce a serious performance degradation. Several researchers made an effort to obtain the LDPC codes with no short cycles. Quasi-cyclic LDPC (QC-LDPC) code is a type of LDPC codes, based on circulant permutation matrices. It required a smaller size of memory for encoding and/or decoding and are easier to analyze their algebraic properties than random LDPC codes. This motivates us to take an intensive interest in constructing nonbinary QC-LDPC codes without short cycles. In this thesis, we propose a construction method of nonbinary QC-LDPC codes without short cycles. We present the mathematical proof for girth and cycle properties of proposed design method. As a result, we present the constructing method for nonbinary QC-LDPC codes without short cycles and show it performs well.