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

International Conference on Communications and Networking in China (ChinaCom)

Construction of quasi-cyclic LDPC codes based on euclidean geometries

Yuanhua Liu, Meiling Zhang

Published Aug 1, 2013• 1 citation
Publisher

Abstract

A new method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries is presented. The proposed method changes the incidence vectors of some lines in the original Euclidean geometry method to construct much more parity check matrices and results in a large class of QC-LDPC codes with girth of at least 6. Simulations show that some codes in this class have better performance and lower error floor than the original Euclidean geometry codes.

DOI
10.1109/chinacom.2013.6694726

Related papers

Design of Quasi-Cyclic LDPC Codes Based on Euclidean Geometries

Yuanhua Liu, Xinmei Wang, Jianhua Ma

This paper presents an algebraic method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries. The construction method results in a class of QC-LDPC codes with girth of at least 6. Codes in this class perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing QC Euclidean geometry LDPC codes.

International Conference on Advanced Information Networking and Applications (AINA)•Jan 1, 2009•7 citations

Improved quasi-cyclic LDPC codes based on euclidean geometry

Yuanhua Liu, Zhang Mei-ling

This paper presents an improved Euclidean geometry (EG) method for constructing parity check matrix of quasi-cyclic low-density parity-check (QC-LDPC) codes to decrease the performance degradation of short cycles to the iterative decoding. The new method results in a class of QC-LDPC codes with much fewer short cycles than usual EG-LDPC codes with the same parameters. Simulation results show that the designed QC-LDPC codes with fewer short cycles perform better than the existing Euclidean geometry LDPC codes under iterative decoding.

•Jan 1, 2015•1 citation

Hybrid construction of quasi-cyclic low-density parity-check codes with large girth based on euclidean geometries

Jun Li, Khan Md. Hashem Ali, Xueqin Jiang +1 more

This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.

International Conference on Information and Communication Technology Convergence (ICTC)•Nov 1, 2010•0 citations

Optimized geometric LDPC codes with quasi-cyclic structure

Xueqin Jiang, Moon Ho Lee, Shangce Gao +1 more

This paper presents methods to the construction of regular and irregular low-density parity-check (LDPC) codes based on Euclidean geometries over the Galois field. Codes constructed by these methods have quasi-cyclic (QC) structure and large girth. By decomposing hyperplanes in Euclidean geometry, the proposed irregular LDPC codes have flexible column/row weights. Therefore, the degree distributions of proposed irregular LDPC codes can be optimized by technologies like the curve fitting in the extrinsic information transfer (EXIT) charts. Simulation results show that the proposed codes perform very well with an iterative decoding over the AWGN channel.

Journal of Communications and Networks•Jun 1, 2014•1 citation

Multiple-Rate Quasi-Cyclic LDPC Codes Based on Euclidean Geometries

Xueqin Jiang, Moon Ho Lee, Tae Chol Shin

This letter presents an approach to the construction of multiple-rate quasi-cyclic (QC) low-density parity-check (LDPC) codes based on hyperplanes (μ-flats) of two different dimensions in Euclidean geometries. The codes constructed with this method have the same code length, multiple-rate and large stopping sets while maintaining the same basic hardware architecture. The code performance is investigated in terms of the bit error rate (BER) and compared with those of the LDPC codes which are proposed in IEEE 802.16e standard. Simulation results show that our codes perform very well and have low error floors over the AWGN channel.

IEICE Transactions on Communications•Jan 1, 2010•0 citations

Construction of irregular quasi-cyclic LDPC codes based on Euclidean geometries

Xueqin Jiang, Moon Ho Lee, Xiaofei Liao +1 more

This paper presents a method to the construction of irregular low-density parity-check (LDPC) codes based on Euclidean geometries over the Galois field. Codes constructed by this method are quasi-cyclic (QC) and have large girths. The proposed irregular LDPC codes having flexible column/row weights are obtained with a hyperplane decomposing method in Euclidean geometries. Therefore, the degree distributions of proposed irregular LDPC codes can be optimized by technologies like the curve fitting approach in the extrinsic information transfer (EXIT) charts. Simulation results show that these codes perform very well with an iterative decoding over the AWGN channel.

International Conference on Wireless Communications and Signal Processing (WCSP)•Nov 1, 2011•0 citations
A new method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries is presented. The proposed method changes the incidence vectors of some lines in the original Euclidean geometry method to construct much more parity check matrices and results in a large class of QC-LDPC codes with girth of at least 6. Simulations show that some codes in this class have better performance and lower error floor than the original Euclidean geometry codes.
This paper presents an improved Euclidean geometry (EG) method for constructing parity check matrix of quasi-cyclic low-density parity-check (QC-LDPC) codes to decrease the performance degradation of short cycles to the iterative decoding. The new method results in a class of QC-LDPC codes with much fewer short cycles than usual EG-LDPC codes with the same parameters. Simulation results show that the designed QC-LDPC codes with fewer short cycles perform better than the existing Euclidean geometry LDPC codes under iterative decoding.
This paper presents methods to the construction of regular and irregular low-density parity-check (LDPC) codes based on Euclidean geometries over the Galois field. Codes constructed by these methods have quasi-cyclic (QC) structure and large girth. By decomposing hyperplanes in Euclidean geometry, the proposed irregular LDPC codes have flexible column/row weights. Therefore, the degree distributions of proposed irregular LDPC codes can be optimized by technologies like the curve fitting in the extrinsic information transfer (EXIT) charts. Simulation results show that the proposed codes perform very well with an iterative decoding over the AWGN channel.
This letter presents an approach to the construction of multiple-rate quasi-cyclic (QC) low-density parity-check (LDPC) codes based on hyperplanes (μ-flats) of two different dimensions in Euclidean geometries. The codes constructed with this method have the same code length, multiple-rate and large stopping sets while maintaining the same basic hardware architecture. The code performance is investigated in terms of the bit error rate (BER) and compared with those of the LDPC codes which are proposed in IEEE 802.16e standard. Simulation results show that our codes perform very well and have low error floors over the AWGN channel.
This paper presents a method to the construction of irregular low-density parity-check (LDPC) codes based on Euclidean geometries over the Galois field. Codes constructed by this method are quasi-cyclic (QC) and have large girths. The proposed irregular LDPC codes having flexible column/row weights are obtained with a hyperplane decomposing method in Euclidean geometries. Therefore, the degree distributions of proposed irregular LDPC codes can be optimized by technologies like the curve fitting approach in the extrinsic information transfer (EXIT) charts. Simulation results show that these codes perform very well with an iterative decoding over the AWGN channel.