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

IEEE International Magnetics Conference

A systematic construction of capacity-achieving irregular low-density parity-check codes

S. Sankaranarayan, Bane V. Vasic, Erozan M. Kurtas

Published Mar 23, 2004• 0 citations
Publisher

Abstract

In this paper, we propose symmetric method to split column and rows of parity-check matrix (H/sup reg/) of regular LDPC code in order to construct capacity-achieving irregular LDPC code with a given distribution (/spl Lambda//sup req/, /spl Omega//sup req/).
DOI
10.1109/intmag.2003.1230516

Related papers

A systematic construction of irregular low-density parity-check codes from combinatorial designs

S. Sankaranarayanan, Bane V. Vasic, Erozan M. Kurtas

In this paper, we propose an algorithm to design an irregular low-density parity-check (LDPC) code, with a given degree distribution pair, from a combinatorially constructed regular LDPC code. Richardson et al., (2001) showed that long LDPC codes from irregular bipartite graphs with carefully chosen degree distribution pair performed very close to the Shannon capacity limit. It is known that the cyclic or quasicyclic property of regular LDPC codes, constructed from combinatorial designs Colbourn, J et al., (1996), helps to simplify their encoding procedure and also facilitates a memory-efficient storage of the codes. The proposed algorithm involves splitting columns and rows of a regular LDPC code systematically in order to achieve an irregular code with a given distribution pair. Also, this algorithm is a useful alternative to random generation of irregular codes because it enables to exploit the structural properties of the regular code in efficiently storing the resultant irregular code.

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•5 citations

Systematic Recursive Construction of LDPC Codes

N. Miladinovic, M.P.C. Fossorier

This letter presents a systematic and recursive method to construct good low-density parity-check (LDPC) codes, especially those with high rate. The proposed method uses a parity check matrix of a quasi-cyclic LDPC code with given row and column weights as a core upon which the larger code is recursively constructed with extensive use of pseudorandom permutation matrices. This construction preserves the minimum distance and girth properties of the core matrix and can generate either regular, or irregular LDPC codes. The method provides a unique representation of the code in compact notation.

IEEE Communications Letters•May 1, 2004•31 citations

Construction of Irregular LDPC Codes by Row Partition

Xiongfei Tao, Yan Zhang, Pan Liu +1 more

In this paper, we propose an approach to construct a class of irregular low-density parity-check (LDPC) codes based on row partition.We divide the rows of LDPC check matrix into subsets and derive an approach to arrange '1' in each column to prevent low weight code words.When decoded by iterative algorithm, the proposed codes show performance with low error floor and are subject to few undetected errors.The LDPC codes constructed based on the proposed scheme have efficiently encoding structures.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2013•0 citations

Low-density parity-check code based on binary sequence splitting

Zhu Li-yan

A new and simple approach to construct irregular low-density parity-check(LDPC)code based on the binary sequence splitting was proposed.Experimental results show that constructed irregular LDPC code with iterative decoding perform well over the AWGN channel and have a good code weight distribution with 4-cycle free.

Journal of Shandong University of Technology•Jan 1, 2007•0 citations

Irregular low-density parity-check code design based on integer lattices

Wataru Matsumoto, Hirotaka Imai

We propose an irregular low-density parity-check (LDPC) code design scheme by extension of a regular LDPC code using Latin square matrices of random sequence. Our scheme is a deterministic method that enables to easily design good irregular LDPC code for any code rate and degree distributions. We optimize LDPC codes by Gaussian approximation (GA) Chung, S-Y et al., (2001) method and construct irregular LDPC codes based on integer lattices Vasic, B et al., (2002).

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•1 citation

A Grading Construction Method of Irregular LDPC Codes

Aimin Zhu

Low-Density Parity-Check codes have attracted great attention from academic world because of its excellent error-correcting performance.The main problem of its usage is the complexity of encoding.This paper proposes a method of construction of irregular Low-Density Parity-Check codes,which we call method of grading.Parity-Check matrix of the code constructed by this method not only has the characteristic of low-triangle which can lower the complexity of encoding but also has excellent performance that can match the constructed LDPC.

Journal of Huaiyin Institute of Technology•Jan 1, 2009•0 citations
In this paper, we propose an algorithm to design an irregular low-density parity-check (LDPC) code, with a given degree distribution pair, from a combinatorially constructed regular LDPC code. Richardson et al., (2001) showed that long LDPC codes from irregular bipartite graphs with carefully chosen degree distribution pair performed very close to the Shannon capacity limit. It is known that the cyclic or quasicyclic property of regular LDPC codes, constructed from combinatorial designs Colbourn, J et al., (1996), helps to simplify their encoding procedure and also facilitates a memory-efficient storage of the codes. The proposed algorithm involves splitting columns and rows of a regular LDPC code systematically in order to achieve an irregular code with a given distribution pair. Also, this algorithm is a useful alternative to random generation of irregular codes because it enables to exploit the structural properties of the regular code in efficiently storing the resultant irregular code.
This letter presents a systematic and recursive method to construct good low-density parity-check (LDPC) codes, especially those with high rate. The proposed method uses a parity check matrix of a quasi-cyclic LDPC code with given row and column weights as a core upon which the larger code is recursively constructed with extensive use of pseudorandom permutation matrices. This construction preserves the minimum distance and girth properties of the core matrix and can generate either regular, or irregular LDPC codes. The method provides a unique representation of the code in compact notation.
In this paper, we propose an approach to construct a class of irregular low-density parity-check (LDPC) codes based on row partition.We divide the rows of LDPC check matrix into subsets and derive an approach to arrange '1' in each column to prevent low weight code words.When decoded by iterative algorithm, the proposed codes show performance with low error floor and are subject to few undetected errors.The LDPC codes constructed based on the proposed scheme have efficiently encoding structures.
Low-Density Parity-Check codes have attracted great attention from academic world because of its excellent error-correcting performance.The main problem of its usage is the complexity of encoding.This paper proposes a method of construction of irregular Low-Density Parity-Check codes,which we call method of grading.Parity-Check matrix of the code constructed by this method not only has the characteristic of low-triangle which can lower the complexity of encoding but also has excellent performance that can match the constructed LDPC.