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

arXiv:0901.2838 · IEEE International Symposium on Information Theory (ISIT)

Analytical solution of covariance evolution for regular LDPC codes

T. Nozaki, Kenta Kasai, Kohichi Sakaniwa

Published Jun 1, 2009• 1 citation
arXivHTMLPDF

Abstract

The covariance evolution is a system of differential equations with respect to the covariance of the number of edges connecting to the nodes of each residual degree. Solving the covariance evolution, we can derive distributions of the number of check nodes of residual degree 1, which helps us to estimate the block error probability for finite-length LDPC code. Amraoui et al. resorted to numerical computations to solve the covariance evolution. In this paper, we give the analytical solution of the covariance evolution.

DOI
10.1109/isit.2009.5205923

Related papers

Analytical Solution of Covariance Evolution for Irregular LDPC Codes

T. Nozaki, Student Member, Kenta Kasai +1 more

A scaling law developed by Amraoui et al. is a powerful technique to estimate the block error probability of finite length low-density parity-check (LDPC) codes. Solving a system of differential equations called covariance evolution is a method to obtain the scaling parameter. However, the covariance evolution has not been analytically solved. In this paper, we present the analytical solution of the covariance evolution for irregular LDPC code ensembles.

•Aug 16, 2016•6 citations

Analytical Solution of Covariance Evolution for Irregular LDPC Codes

Takayuki Nozaki, Kenta Kasai, Kohichi Sakaniwa

The scaling law developed by Amraoui et al. is a powerful technique to estimate the block erasure probabilities of finite- length low-density parity-check (LDPC) codes. Solving a system of differential equations called covariance evolution, one can obtain the scaling parameter. However, the covariance evolution has not been analytically solved. In this paper, we present the analytical solution of the covariance evolution for irregular LDPC code ensembles.

arXiv:1011.1701•IEEE Transactions on Information Theory•Mar 22, 2012•4 citations

Detailed evolution of degree distributions in residual graphs with joint degree distributions

隆之 野﨑, Kenta Kasai, TOMOHARU SHIBUYA +1 more

Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles.Evolution of degree distributions in residual graphs is important characteristic which is used for finite-length analysis of the expected block and bit error probability over the binary erasure channel.In this paper, we derive detailed evolution of degree distributions in residual graphs for irregular LDPC code ensembles with joint degree distributions.

•Jul 1, 2008•0 citations

Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions

T. Nozaki, K. KASAI, T. SHIBUYA +1 more

Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles. Evolution of degree distributions in residual graphs is important characteristic which is used for finite-length analysis of the expected block and bit error probability over the binary erasure channel. In this paper, we derive detailed evolution of degree distributions in residual graphs for irregular LDPC code ensembles with joint degree distributions.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 1, 2008•0 citations

Detailed evolution of degree distributions in residual graphs with joint degree distributions

T. Nozaki, Kenta Kasai, Tomoharu Shibuya +1 more

Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles. Evolution of degree distributions in residual graphs is an important characteristic which is used for finite-length analysis of the expected block and bit error probabilities over the binary erasure channel. In this paper, we derive detailed evolution of degree distributions in residual graphs for irregular LDPC code ensembles with joint degree distributions.

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

Analytic Determination of Scaling Parameters

Abdelaziz Amraoui, Andrea Montanari A, Rudiger L. Urbanke

We show that the finite-length scaling parameters for irregular LDPC codes when used over the binary erasure channel can be computed without resorting to "covariance evolution". We provide simple expressions that can be evaluated using solely the degree distributions and the characteristics of the fixed point of density evolution

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•14 citations
The covariance evolution is a system of differential equations with respect to the covariance of the number of edges connecting to the nodes of each residual degree. Solving the covariance evolution, we can derive distributions of the number of check nodes of residual degree 1, which helps us to estimate the block error probability for finite-length LDPC code. Amraoui et al. resorted to numerical computations to solve the covariance evolution. In this paper, we give the analytical solution of the covariance evolution.