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

IET Conference on Wireless, Mobile and Sensor Networks (CCWMSN)

A new class of non-binary LDPC codes design based on inverse block jacket matrices

Xueqin Jiang, Moon Ho Lee

Published Jan 1, 2007• 2 citations
Publisher

Abstract

In this paper, the authors introduce a new kind of non-binary LDPC Codes in communication systems. We evaluate the performance of the new LDPC codes over an AWGN channel. This new LDPC Codes are constructed based on the Jacket matrics. Codes of this class have girth at least 6. They perform very well with iterative decoding.
DOI
10.1049/cp:20070308

Related papers

NEW CONSTRUCTIONS OF LDPC CODES BASED ON CIRCULANT PERMUTATION MATRICES FOR AWGN CHANNEL

Song, Zixi, Zhang +1 more

Two new design approaches for constructing Low-Density Parity-Check(LDPC) codes are proposed.One is used to design regular Quasi-Cyclic LDPC(QC-LDPC) codes with girth at least 8.The other is used to design irregular LDPC codes.Both of their parity-check matrices are composed of Circulant Permutation Matrices(CPMs).When iteratively decoded with the Sum-Product Algorithm(SPA),these proposed codes exhibit good performances over the AWGN channel.

Journal of Electronics (China)•Jan 1, 2014•2 citations

New constructions of quasi-cyclic LDPC codes based on special classes of BIBD's for the AWGN and binary erasure channels

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

This paper presents new methods for constructing efficiently encodable quasi-cyclic LDPC codes based on special balanced incomplete block designs (BIBD's). Codes constructed perform well over both the AWGN and binary erasure channels with iterative decoding.

IEEE Transactions on Communications•Jan 1, 2008•71 citations

Non-Binary LDPC Codes Design Based on Euclidean Geometries

Guihua Zeng

This paper presents a Euclidean geometric approach to the construction of Non-Binary low-density parity-check(LDPC) codes.Codes of this class have girth at least 6.They perform very well with iterative decoding.Furthermore,these codes can be decoded with simple shift registers,with linear complexity and decoded in the semi-parallel way.The simulation results show that their performance is much better than the binary LDPC codes.

Computer Knowledge and Technology•Jan 1, 2010•2 citations

Construction of protograph LDPC codes based on Jacket matrices

Kaiyao Wang, Shaohai Hu, Yang Xiao +2 more

In this paper, we propose a method to construct the protograph LDPC codes based on Jacket matrices. In the proposed code construction, the Jacket matrices are regarded as derived protograph matrices, the column weights of permutation matrices in parity check matrix depend on the elements' values of Jacket matrices. While the shift rule of the permutation matrices needs to ensure no girth 4. The proposed LDPC codes are easy to be applied for the codec of mobile digital multimedia. The simulation results in AWGN channels show that the BER performance of the proposed codes is better by about 0.5 dB than that of GB20600 LDPC codes.

International Conference on Signal Processing•Oct 1, 2010•4 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•10 citations

Construction of LDPC codes based on resolvable group divisible designs

Hengzhou Xu, Dan Feng, Cheng Sun +1 more

In this paper, we present a method for constructing LDPC codes from resolvable group divisible designs (RGDDs). According to the incidence matrices (or their submatrices) of RGDDs, a class of regular LDPC codes can be constructed. Since the parity-check matrix of the resulting code satisfies the row-column constraint, the girth of the proposed codes is at least six. Furthermore, based on a resolvable group divisible design, we can obtain a sequence of LDPC codes with various lengths and rates, which perform well over the AWGN channel with iterative decoding and have low error floors.

International Workshop on High Mobility Wireless Communications (HMWC)•Oct 1, 2015•9 citations
In this paper, we propose a method to construct the protograph LDPC codes based on Jacket matrices. In the proposed code construction, the Jacket matrices are regarded as derived protograph matrices, the column weights of permutation matrices in parity check matrix depend on the elements' values of Jacket matrices. While the shift rule of the permutation matrices needs to ensure no girth 4. The proposed LDPC codes are easy to be applied for the codec of mobile digital multimedia. The simulation results in AWGN channels show that the BER performance of the proposed codes is better by about 0.5 dB than that of GB20600 LDPC codes.
In this paper, we present a method for constructing LDPC codes from resolvable group divisible designs (RGDDs). According to the incidence matrices (or their submatrices) of RGDDs, a class of regular LDPC codes can be constructed. Since the parity-check matrix of the resulting code satisfies the row-column constraint, the girth of the proposed codes is at least six. Furthermore, based on a resolvable group divisible design, we can obtain a sequence of LDPC codes with various lengths and rates, which perform well over the AWGN channel with iterative decoding and have low error floors.