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

Journal of Electronics (China)

A class of LDPC code’s construction based on an iterative random method

Zhonghu Huang, Lianfeng Shen

Published Jan 1, 2006• 0 citations
Publisher
DOI
10.1007/s11767-005-0057-2

Related papers

Design of Low-Complexity Well-Structured LDPC Codes Based on Iterative-Filled Approach

Wei Zhang, Guangxi Zhu, Li Peng +1 more

Low density parity check codes are a popular class of linear block codes for forward error correction in communication channels. Recent years have seen a lot of work towards the hardware-oriented constructions for LDPC codes which have comparable error-correcting performance to random construction codes. This paper proposes a novel method called Iterative-filled (IF) to construct LDPC codes and a new kind of LDPC codes named IF-LDPC codes. Based on the properties of the method proved in this paper, we present a design of regular and quasi-regular IF-LDPC encoders which have linear encoding complexity, simple construction, low memory requirement and are suitable for partly parallel decoding. These advantages make them easy to hardware implementation. The IF-LDPC codes exhibit good performance in computer simulations and some even better than MacKay codes.

International Congress on Image and Signal Processing (CISP)•Jan 1, 2008•0 citations

A CLASS OF LDPC CODE＇S CONSTRUCTION BASED ON AN ITERATIVE RANDOM METHOD

Huang, Zhong-hu, Shen Shen +1 more

Journal of Electronics (China)•Jan 1, 2006•0 citations

The Design of Structured Low-Density Parity-Check Codes With Large Girth

Jing Long

This paper,based on algebra and graph,proposes a method for constructing structured low-density parity-check(LDPC) codes.In this method,the authors design a connected graph with three kinds of special path to ensure that the Tanner graph of the parity check matrix mapped from the connected graph is without short cycles.The construction method results in two classes of(3,k)-regular quasi-cyclic LDPC codes with girth 8 and 12 respectively.Furthermore,by extending this construction method,two classes of LDPC codes with column weight 2,whose girths are respectively 16 and 24,can be obtained.The simulation studies show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels with iterative decoding.At the BER of 10-5,the new proposed(3,6)-regular(4356,2205) QC-LDPC code performs 1.48dB from the Shannon limit.Moreover,it outperforms the random regular LDPC code of comparable parameters by 0.1dB.For the new proposed structured LDPC codes with column weight 2,they can achieve about 2dB coding gains with respect to the random regular LDPC codes with similar block lengths and code rates.

Chinese Journal of Computers•Jan 1, 2007•1 citation

A Probabilistic Method for Computing the Weight Distribution of LDPC Codes

Masanori Hirotomo, Masami Mohri, Masakatu Morii

IEICE Technical Report; IEICE Tech. Rep.•Sep 9, 2004•0 citations

Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes

Lingqi Zeng, Lan Lan, Y.Y. Tai +1 more

This paper presents three algebraic methods for constructing q-ary LDPC codes. The first method gives a class of dispersed Reed-Solomon codes as LDPC codes. The second method gives a class of q-ary quasi-cyclic LDPC codes. The third method gives two classes of q-ary finite geometry LDPC codes. Codes constructed by these methods perform very well with iterative decoding, even for short codes.

Globecom•Jan 1, 2005•27 citations

An Optimized Algorithm for Constructing Effective LDPC Code

Xi Li, Shuo-chen Wang, Atabaev Doniyor +2 more

한국전자통신학회 학술대회지•Jun 1, 2013•0 citations
Low density parity check codes are a popular class of linear block codes for forward error correction in communication channels. Recent years have seen a lot of work towards the hardware-oriented constructions for LDPC codes which have comparable error-correcting performance to random construction codes. This paper proposes a novel method called Iterative-filled (IF) to construct LDPC codes and a new kind of LDPC codes named IF-LDPC codes. Based on the properties of the method proved in this paper, we present a design of regular and quasi-regular IF-LDPC encoders which have linear encoding complexity, simple construction, low memory requirement and are suitable for partly parallel decoding. These advantages make them easy to hardware implementation. The IF-LDPC codes exhibit good performance in computer simulations and some even better than MacKay codes.
This paper,based on algebra and graph,proposes a method for constructing structured low-density parity-check(LDPC) codes.In this method,the authors design a connected graph with three kinds of special path to ensure that the Tanner graph of the parity check matrix mapped from the connected graph is without short cycles.The construction method results in two classes of(3,k)-regular quasi-cyclic LDPC codes with girth 8 and 12 respectively.Furthermore,by extending this construction method,two classes of LDPC codes with column weight 2,whose girths are respectively 16 and 24,can be obtained.The simulation studies show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels with iterative decoding.At the BER of 10-5,the new proposed(3,6)-regular(4356,2205) QC-LDPC code performs 1.48dB from the Shannon limit.Moreover,it outperforms the random regular LDPC code of comparable parameters by 0.1dB.For the new proposed structured LDPC codes with column weight 2,they can achieve about 2dB coding gains with respect to the random regular LDPC codes with similar block lengths and code rates.