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 INFORMATION TECHNOLOGY

Design and Optimization of Degree Distributions of Irregular LDPC

Pla Navy

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

Good degree distributions can improve the error-floor and reduce the complication in encoding and decoding of LDPC.Under AWGN channel,Gaussian approximation algorithm can analyze the decoding threshold of LDPC presented by their degree distributions.Using differential evolution,the degree distributions that possess maximal threshold can be gotten.Through simulation results,the optimized degree distributions which possess a 0.15dB better noisy threshold than using linear algorithm.

Related papers

Optimization of Degree Distribution of Fast Encodable Irregular Low-density Parity-check Code

Zengping Chen

Because the structure of check matrix of fast encodable irregular LDPC code is exceptional,normal design technique of optimization of degree distribution can not work well in this case.In this paper,a method of optimization of fast encodable irregular low-density parity-check codes' degree distribution is discussed based on differential evolution with particular restrictions.The principle of density evolution of irregular LDPC codes is explained.Gaussian approximation to program the evolution proceeding and differential evolution are analysed,and the particular restrictions on degree distribution are discussed.Simulation results show that some good distribution sequences are better than that reported before.

Jisuanji fangzhen•Jan 1, 2010•0 citations

Research of Fixed Point of LDPC Decoding over Rice Channel

Chengqi Xu

Research of the fixed point which appears in decoding process of LDPC codes is important to further analyze the decoding mechanism and speed up decoding convergence.Firstly,a new optimization scheme which combines DDE(Discrete Density Evolution)for offset BP-based decoding algorithm with differential evolution is presented for optimizing irregular LDPC codes.Then the optimized degree distribution pair and threshold of LDPC codes over Rice channel are given,with the maximum bit node degree 10 and code rate R=1/2,1/3.Furthermore,we analyze a series of simulated curves related to LDPC decoding fixed point and threshold phenomenon.Simulation results show that the node with higher degree contributes more to the decoding for LDPC codes.Therefore,we tentatively put forward two kinds of thinking to improve LDPC decoding algorithm.

Journal of Nanjing University of Posts and Telecommunications•Jan 1, 2007•0 citations

Study and improvement on construction methods of irregular LDPC code

Liang Zhao

Through designing degree distributions,irregular LDPC code have better error correcting performance than regular LDPC code.However,irregular LDPC code have error floor at high SNR region.This thesis improves PEG algorithm to make irregular LDPC have lower error floor by ACE algorithm.At last,through Matlab simulations,we confirm that this algorithm improves the error correction performance of irregular LDPC code performance over the additive white Gaussian noise channel.

Information technology newsletter•Jan 1, 2009•0 citations

Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

Sae-Young Chung, Tom Richardson, Rudiger L. Urbanke

Density evolution is an algorithm for computing the capacity of low-density parity-check (LDPC) codes under message-passing decoding. For memoryless binary-input continuous-output additive white Gaussian noise (AWGN) channels and sum-product decoders, we use a Gaussian approximation for message densities under density evolution to simplify the analysis of the decoding algorithm. We convert the infinite-dimensional problem of iteratively calculating message densities, which is needed to find the exact threshold, to a one-dimensional problem of updating the means of the Gaussian densities. This simplification not only allows us to calculate the threshold quickly and to understand the behavior of the decoder better, but also makes it easier to design good irregular LDPC codes for AWGN channels. For various regular LDPC codes we have examined, thresholds can be estimated within 0.1 dB of the exact value. For rates between 0.5 and 0.9, codes designed using the Gaussian approximation perform within 0.02 dB of the best performing codes found so far by using density evolution when the maximum variable degree is 10. We show that by using the Gaussian approximation, we can visualize the sum-product decoding algorithm. We also show that the optimization of degree distributions can be understood and done graphically using the visualization.

IEEE Transactions on Information Theory•Jan 1, 2001•1,155 citations

On Lowering the Error Floor of Short-to-Medium Block Length Irregular Low Density Parity Check Codes

Umar-Faruk Abdu-Aguye

Gallager proposed and developed low density parity check (LDPC) codes in the early 1960s. LDPC codes were rediscovered in the early 1990s and shown to be capacity approaching over the additive white Gaussian noise (AWGN) channel. Subsequently, density evolution (DE) optimized symbol node degree distributions were used to significantly improve the decoding performance of short to medium length irregular LDPC codes. Currently, the short to medium length LDPC codes with the lowest error floor are DE optimized irregular LDPC codes constructed using progressive edge growth (PEG) algorithm modifications which are designed to increase the approximate cycle extrinsic message degrees (ACE) in the LDPC code graphs constructed. The aim of the present work is to find efficient means to improve on the error floor performance published for short to medium length irregular LDPC codes over AWGN channels in the literature. An efficient algorithm for determining the girth and ACE distributions in short to medium length LDPC code Tanner graphs has been proposed. A cyclic PEG (CPEG) algorithm which uses an edge connections sequence that results in LDPC codes with improved girth and ACE distributions is presented. LDPC codes with DE optimized/’good’ degree distributions which have larger minimum distances and stopping distances than previously published for LDPC codes of similar length and rate have been found. It is shown that increasing the minimum distance of LDPC codes lowers their error floor performance over AWGN channels; however, there are threshold minimum distances values above which there is no further lowering of the error floor performance. A minimum local girth (edge skipping) (MLG (ES)) PEG algorithm is presented; the algorithm controls the minimum local girth (global girth) connected in the Tanner graphs of LDPC codes constructed by forfeiting some edge connections. A technique for constructing optimal low correlated edge density (OED) LDPC codes based on modified DE optimized symbol node degree distributions and the MLG (ES) PEG algorithm modification is presented. OED rate-½ (n, k)=(512, 256) LDPC codes have been shown to have lower error floor over the AWGN channel than previously published for LDPC codes of similar length and rate. Similarly, consequent to an improved symbol node degree distribution, rate ½ (n, k)=(1024, 512) LDPC codes have been shown to have lower error floor over the AWGN channel than previously published for LDPC codes of similar length and rate. An improved BP/SPA (IBP/SPA) decoder, obtained by making two simple modifications to the standard BP/SPA decoder, has been shown to result in an unprecedented generalized improvement in the performance of short to medium length irregular LDPC codes under iterative message passing decoding. The superiority of the Slepian Wolf distributed source coding model over other distributed source coding models based on LDPC codes has been shown.

•Jan 1, 2018•0 citations

Density evolution method and threshold decision for irregular LDPC codes

Lin Wang, Juan Xiao, Guanrong Chen

Density evolution is a new method for analyzing the asymptotic performance of network capability approaching error-correcting codes. For irregular LDPC codes with message-passing decoding, the density evolution method can track the messages to find out the threshold, enabling optimization of the degree distribution. In this paper, the principle of density evolution combined with the decoding process is firstly explored. Then, two algorithms for programming the evolution proceeding are discussed: the discretized density evolution and the Gaussian approximation, as well as their application conditions. Finally, simulation results are presented.

International Conference on Communications, Circuits and Systems•Jan 1, 2004•12 citations
Good degree distributions can improve the error-floor and reduce the complication in encoding and decoding of LDPC.Under AWGN channel,Gaussian approximation algorithm can analyze the decoding threshold of LDPC presented by their degree distributions.Using differential evolution,the degree distributions that possess maximal threshold can be gotten.Through simulation results,the optimized degree distributions which possess a 0.15dB better noisy threshold than using linear algorithm.
Because the structure of check matrix of fast encodable irregular LDPC code is exceptional,normal design technique of optimization of degree distribution can not work well in this case.In this paper,a method of optimization of fast encodable irregular low-density parity-check codes' degree distribution is discussed based on differential evolution with particular restrictions.The principle of density evolution of irregular LDPC codes is explained.Gaussian approximation to program the evolution proceeding and differential evolution are analysed,and the particular restrictions on degree distribution are discussed.Simulation results show that some good distribution sequences are better than that reported before.
Research of the fixed point which appears in decoding process of LDPC codes is important to further analyze the decoding mechanism and speed up decoding convergence.Firstly,a new optimization scheme which combines DDE(Discrete Density Evolution)for offset BP-based decoding algorithm with differential evolution is presented for optimizing irregular LDPC codes.Then the optimized degree distribution pair and threshold of LDPC codes over Rice channel are given,with the maximum bit node degree 10 and code rate R=1/2,1/3.Furthermore,we analyze a series of simulated curves related to LDPC decoding fixed point and threshold phenomenon.Simulation results show that the node with higher degree contributes more to the decoding for LDPC codes.Therefore,we tentatively put forward two kinds of thinking to improve LDPC decoding algorithm.
Density evolution is an algorithm for computing the capacity of low-density parity-check (LDPC) codes under message-passing decoding. For memoryless binary-input continuous-output additive white Gaussian noise (AWGN) channels and sum-product decoders, we use a Gaussian approximation for message densities under density evolution to simplify the analysis of the decoding algorithm. We convert the infinite-dimensional problem of iteratively calculating message densities, which is needed to find the exact threshold, to a one-dimensional problem of updating the means of the Gaussian densities. This simplification not only allows us to calculate the threshold quickly and to understand the behavior of the decoder better, but also makes it easier to design good irregular LDPC codes for AWGN channels. For various regular LDPC codes we have examined, thresholds can be estimated within 0.1 dB of the exact value. For rates between 0.5 and 0.9, codes designed using the Gaussian approximation perform within 0.02 dB of the best performing codes found so far by using density evolution when the maximum variable degree is 10. We show that by using the Gaussian approximation, we can visualize the sum-product decoding algorithm. We also show that the optimization of degree distributions can be understood and done graphically using the visualization.
Gallager proposed and developed low density parity check (LDPC) codes in the early 1960s. LDPC codes were rediscovered in the early 1990s and shown to be capacity approaching over the additive white Gaussian noise (AWGN) channel. Subsequently, density evolution (DE) optimized symbol node degree distributions were used to significantly improve the decoding performance of short to medium length irregular LDPC codes. Currently, the short to medium length LDPC codes with the lowest error floor are DE optimized irregular LDPC codes constructed using progressive edge growth (PEG) algorithm modifications which are designed to increase the approximate cycle extrinsic message degrees (ACE) in the LDPC code graphs constructed. The aim of the present work is to find efficient means to improve on the error floor performance published for short to medium length irregular LDPC codes over AWGN channels in the literature. An efficient algorithm for determining the girth and ACE distributions in short to medium length LDPC code Tanner graphs has been proposed. A cyclic PEG (CPEG) algorithm which uses an edge connections sequence that results in LDPC codes with improved girth and ACE distributions is presented. LDPC codes with DE optimized/’good’ degree distributions which have larger minimum distances and stopping distances than previously published for LDPC codes of similar length and rate have been found. It is shown that increasing the minimum distance of LDPC codes lowers their error floor performance over AWGN channels; however, there are threshold minimum distances values above which there is no further lowering of the error floor performance. A minimum local girth (edge skipping) (MLG (ES)) PEG algorithm is presented; the algorithm controls the minimum local girth (global girth) connected in the Tanner graphs of LDPC codes constructed by forfeiting some edge connections. A technique for constructing optimal low correlated edge density (OED) LDPC codes based on modified DE optimized symbol node degree distributions and the MLG (ES) PEG algorithm modification is presented. OED rate-½ (n, k)=(512, 256) LDPC codes have been shown to have lower error floor over the AWGN channel than previously published for LDPC codes of similar length and rate. Similarly, consequent to an improved symbol node degree distribution, rate ½ (n, k)=(1024, 512) LDPC codes have been shown to have lower error floor over the AWGN channel than previously published for LDPC codes of similar length and rate. An improved BP/SPA (IBP/SPA) decoder, obtained by making two simple modifications to the standard BP/SPA decoder, has been shown to result in an unprecedented generalized improvement in the performance of short to medium length irregular LDPC codes under iterative message passing decoding. The superiority of the Slepian Wolf distributed source coding model over other distributed source coding models based on LDPC codes has been shown.
Density evolution is a new method for analyzing the asymptotic performance of network capability approaching error-correcting codes. For irregular LDPC codes with message-passing decoding, the density evolution method can track the messages to find out the threshold, enabling optimization of the degree distribution. In this paper, the principle of density evolution combined with the decoding process is firstly explored. Then, two algorithms for programming the evolution proceeding are discussed: the discretized density evolution and the Gaussian approximation, as well as their application conditions. Finally, simulation results are presented.