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 Symposium on Information Theory (ISIT)

Irregular codes from regular graphs

Pascal O. Vontobel, Hans‐Andrea Loeliger

Published Jun 25, 2003• 6 citations
Publisher

Abstract

It has been recognized that appropriately chosen irregular low-density parity-check (LDPC) codes have a remarkable performance advantage compared to regular LDPC codes and that their threshold is much better. Starting with regular graphs, we construct codes consisting of more sophisticated subcodes (compared to simple XORs) and show that performance gains can be achieved by optimizing the proportions of the high-degree bit nodes and the different subcodes being used.

DOI
10.1109/isit.2002.1023556

Related papers

Irregular low-density parity-check lattices

Ihn-Jung Baik, Sae-Young Chung

We construct lattices with high coding gains based on nested low-density parity-check (LDPC) codes by Construction D′.We generalize the LDPC lattices [1] to have irregular degrees and call them irregular LDPC lattices. To construct good irregular LDPC lattices, we optimize the degree distributions by using density evolution and a modified sequential quadratic programming (SQP) and show our optimized irregular LDPC lattice has a threshold 0.48dB from the capacity, which is about 0.6dB better than the regular one in [1]. To construct a Tanner graph corresponding to LDPC lattices, we generalize the progressive-edge growth (PEG) algorithm and show a lower bound on the girth of the graph. Simulation is performed using the sum-product algorithm. Also, we compare the performance of joint decoding and multi-stage decoding [2] and show the advantage of joint decoding.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•14 citations

Optimized decoding schedule for irregular LDPC codes

Xuwei Chen, Hui Ling Yu, Youyun Xu

Recently, the concept of layered decoding schedule for Low-Density Parity-Check codes has been introduced. But the advantage of layered decoding schedule for irregular LDPC codes is not as obvious as regular LDPC codes. The major drawback of the layered irregular LDPC codes versus the layered regular LDPC codes is its comparative low convergence decoding speed. Simulation results show that different bit node degrees of irregular LDPC codes significantly contribute to the decoding performance. The decoding performance of bit nodes with different degrees is of great difference. Bit nodes with small degrees always converge slower than larger ones. In this paper, we propose an optimized decoding schedule for irregular LDPC codes to accelerate the decoding convergence rate. Meanwhile, for the irregular LDPC decoder, the faster decoding speed means a higher throughput and almost the same error performance.

IET International Communication Conference on Wireless Mobile and Computing (CCWMC)•Jan 1, 2009•2 citations

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

Degree-Matched Check Node Decoding for Regular and Irregular LDPCs

Sheryl L. Howard, Christian B. Schlegel, Vincent Gaudet

This brief examines different parity-check node decoding algorithms for low-density parity-check (LDPC) codes, seeking to recoup the performance loss incurred by the min-sum approximation compared to sum-product decoding. Two degree-matched check node decoding approximations that depend on the check node degree dcare presented. Both have low complexity and can be applied to any degree distribution. Simulation results show near sum-product decoding performance for both degree-matched check node approximations for regular and irregular LDPCs

IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing•Oct 1, 2006•22 citations

Low‐Density Parity‐Check Codes

Christian B. Schlegel, Lance C. Pérez

Low-density parity-check (LDPC) codes can rightfully take their stand next to turbo codes as the most powerful and most popular error control codes known. They offer a performance spectacularly close to theoretical limits when decoded using iterative soft decision algorithms. This chapter explores the properties and structure of low-density parity-check codes. It begins with the fundamental construction of regular LDPC codes and their representation as bipartite graphs. The graphical representation of LDPC codes then leads to the notion of irregular LDPC codes, which have been used to improve performance, and to the density evolution analysis technique, which predicts the performance of these codes.

Wiley eBooks•Aug 29, 2015•6 citations

A simple algorithm to design irregular LDPC codes for finite length

Mehrdad Taki, Mahdi Orooji

A simple and practical algorithm to design an irregular low density parity check (LDPC) codes for finite length applications is introduced. The simulation result will be proved the advantages of designed codes in compare with conventional regular and irregular finite length LDPC codes. Due to the semi-random structure of proposed codes, it will be encoded simpler than the other LDPC codes. Finally, a modified extended bit filling (EBF) is proposed to control rows weight

IEEE International Conference on Communication Systems (ICCS)•Jan 1, 2006•1 citation
It has been recognized that appropriately chosen irregular low-density parity-check (LDPC) codes have a remarkable performance advantage compared to regular LDPC codes and that their threshold is much better. Starting with regular graphs, we construct codes consisting of more sophisticated subcodes (compared to simple XORs) and show that performance gains can be achieved by optimizing the proportions of the high-degree bit nodes and the different subcodes being used.
We construct lattices with high coding gains based on nested low-density parity-check (LDPC) codes by Construction D′.We generalize the LDPC lattices [1] to have irregular degrees and call them irregular LDPC lattices. To construct good irregular LDPC lattices, we optimize the degree distributions by using density evolution and a modified sequential quadratic programming (SQP) and show our optimized irregular LDPC lattice has a threshold 0.48dB from the capacity, which is about 0.6dB better than the regular one in [1]. To construct a Tanner graph corresponding to LDPC lattices, we generalize the progressive-edge growth (PEG) algorithm and show a lower bound on the girth of the graph. Simulation is performed using the sum-product algorithm. Also, we compare the performance of joint decoding and multi-stage decoding [2] and show the advantage of joint decoding.
Recently, the concept of layered decoding schedule for Low-Density Parity-Check codes has been introduced. But the advantage of layered decoding schedule for irregular LDPC codes is not as obvious as regular LDPC codes. The major drawback of the layered irregular LDPC codes versus the layered regular LDPC codes is its comparative low convergence decoding speed. Simulation results show that different bit node degrees of irregular LDPC codes significantly contribute to the decoding performance. The decoding performance of bit nodes with different degrees is of great difference. Bit nodes with small degrees always converge slower than larger ones. In this paper, we propose an optimized decoding schedule for irregular LDPC codes to accelerate the decoding convergence rate. Meanwhile, for the irregular LDPC decoder, the faster decoding speed means a higher throughput and almost the same error performance.
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 brief examines different parity-check node decoding algorithms for low-density parity-check (LDPC) codes, seeking to recoup the performance loss incurred by the min-sum approximation compared to sum-product decoding. Two degree-matched check node decoding approximations that depend on the check node degree dcare presented. Both have low complexity and can be applied to any degree distribution. Simulation results show near sum-product decoding performance for both degree-matched check node approximations for regular and irregular LDPCs
Low-density parity-check (LDPC) codes can rightfully take their stand next to turbo codes as the most powerful and most popular error control codes known. They offer a performance spectacularly close to theoretical limits when decoded using iterative soft decision algorithms. This chapter explores the properties and structure of low-density parity-check codes. It begins with the fundamental construction of regular LDPC codes and their representation as bipartite graphs. The graphical representation of LDPC codes then leads to the notion of irregular LDPC codes, which have been used to improve performance, and to the density evolution analysis technique, which predicts the performance of these codes.