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

International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY)

On the performance analysis of short LDPC codes

Luiza R. Medova, Pavel S. Rybin, Ivan V. Filatov

Published Oct 1, 2019• 2 citations
Publisher

Abstract

This paper presents the research on LDPC codes performance depending on several Tanner graph properties. We have simulated 2250 (128,256) different LDPC codes in FPGA and explored their waterfall region as a function of the graph characteristics. These characteristics are different graph centralization measures and the second smallest Laplacian eigenvalue. We have received numerical values that distinguish LDPC codes with a good decoding threshold (less or equal 3.5 dB) from others. In addition, we developed a polynomial regression model that accurately predicts the LDPC decoding threshold with a coefficient of determination equal to 0.87 and RMSE equal 0.16 dB.

DOI
10.1109/redundancy48165.2019.9003310

Related papers

On the performance slope of short LDPC codes

Luiza R. Medova, Pavel S. Rybin, Igor E. Sidorenko

The present work is a continuation of the previous study [1] on the performance of short LDPC codes. We have examined a sample of (128,256) different LDPC codes and explored their bit error-rate curves as a function of Tanner graph properties. It was found that certain graph characteristics correlate with LDPC code performance and can help to distinguish LDPC codes with a good decoding threshold (less or equal 3.5 dB) from others. In this work, we investigate a slope of bit error- rate curves that along with a decoding threshold provides an information on code performance.

International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)•Oct 1, 2020•0 citations

A Convergence Analysis of LDPC Decoding Based on Eigenvalues

Neha Ashok Kharate

Low-density parity check (LDPC) codes are very popular among error correction codes because of their high-performance capacity. Numerous investigations have been carried out to analyze the performance and simplify the implementation of LDPC codes. Relatively slow convergence of iterative decoding algorithm affects the performance of LDPC codes. Faster convergence can be achieved by reducing the number of iterations during the decoding process. In this thesis, a new approach for faster convergence is suggested by choosing a systematic parity check matrix that yields lowest Second Smallest Eigenvalue Modulus (SSEM) of its corresponding Laplacian matrix. MATLAB simulations are used to study the impact of eigenvalues on the number of iterations of the LDPC decoder. It is found that for a given (n, k) LDPC code, a parity check matrix with lowest SSEM converges quickly as compared to the parity check matrix with high SSEM. In other words, a densely connected graph that represents the parity check matrix takes more iterations to converge than a sparsely connected graph.

•Aug 1, 2017•0 citations

The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes

Dikshya Adhikari

The new developments in coding theory research have revolutionized the application of coding to practical systems. Low-Density Parity Check (LDPC) codes form a class of Shannon limit approaching codes opted for digital communication systems that require high reliability. This thesis investigates the underlying relationship between the spectral properties of the parity check matrix and LDPC decoding convergence. The bit error rate of an LDPC code is plotted for the parity check matrix that has different Second Smallest Eigenvalue Modulus (SSEM) of its corresponding Laplacian matrix. It is found that for a given (n,k) LDPC code, large SSEM has better error floor performance than low SSEM. The value of SSEM decreases as the sparseness in a parity-check matrix is increased. It was also found from the simulation that long LDPC codes have better error floor performance than short codes. This thesis outlines an approach to analyze LDPC decoding based on the eigenvalue analysis of the corresponding parity check matrix.

•Aug 1, 2020•0 citations

Several Properties of Short LDPC Codes

We present several properties on minimum distance $(d_min)$ and girth $(G_min)$ in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large $G_min$ could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.

IEEE Transactions on Communications•Apr 1, 2004•0 citations

Several Properties of Short LDPC Codes

Lei Wei

In this paper, we present several properties on minimum distance(d/sub min/) and girth(G/sub min/) in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large G/sub min/ could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.

IEEE Transactions on Communications•May 1, 2004•23 citations

Waterfall Performance Analysis of Finite-Length LDPC Codes on Symmetric Channels

Raman Yazdani, Masoud Ardakani

An efficient method for analyzing the performance of finite-length low-density parity-check (LDPC) codes in the waterfall region, when transmission takes place on a memoryless binary-input output-symmetric channel is proposed. This method is based on studying the variations of the channel quality around its expected value when observed during the transmission of a finite-length codeword. We model these variations with a single parameter. This parameter is then viewed as a random variable and its probability distribution function is obtained. Assuming that a decoding failure is the result of an observed channel worse than the codeiquests decoding threshold, the block error probability of finite-length LDPC codes under different decoding algorithms is estimated. Using an extrinsic information transfer chart analysis, the bit error probability is obtained from the block error probability. Different parameters can be used for modeling the channel variations. In this work, two of such parameters are studied. Through examples, it is shown that this method can closely predict the performance of LDPC codes of a few thousand bits or longer in the waterfall region.

IEEE Transactions on Communications•Nov 1, 2009•24 citations
This paper presents the research on LDPC codes performance depending on several Tanner graph properties. We have simulated 2250 (128,256) different LDPC codes in FPGA and explored their waterfall region as a function of the graph characteristics. These characteristics are different graph centralization measures and the second smallest Laplacian eigenvalue. We have received numerical values that distinguish LDPC codes with a good decoding threshold (less or equal 3.5 dB) from others. In addition, we developed a polynomial regression model that accurately predicts the LDPC decoding threshold with a coefficient of determination equal to 0.87 and RMSE equal 0.16 dB.
The present work is a continuation of the previous study [1] on the performance of short LDPC codes. We have examined a sample of (128,256) different LDPC codes and explored their bit error-rate curves as a function of Tanner graph properties. It was found that certain graph characteristics correlate with LDPC code performance and can help to distinguish LDPC codes with a good decoding threshold (less or equal 3.5 dB) from others. In this work, we investigate a slope of bit error- rate curves that along with a decoding threshold provides an information on code performance.
Low-density parity check (LDPC) codes are very popular among error correction codes because of their high-performance capacity. Numerous investigations have been carried out to analyze the performance and simplify the implementation of LDPC codes. Relatively slow convergence of iterative decoding algorithm affects the performance of LDPC codes. Faster convergence can be achieved by reducing the number of iterations during the decoding process. In this thesis, a new approach for faster convergence is suggested by choosing a systematic parity check matrix that yields lowest Second Smallest Eigenvalue Modulus (SSEM) of its corresponding Laplacian matrix. MATLAB simulations are used to study the impact of eigenvalues on the number of iterations of the LDPC decoder. It is found that for a given (n, k) LDPC code, a parity check matrix with lowest SSEM converges quickly as compared to the parity check matrix with high SSEM. In other words, a densely connected graph that represents the parity check matrix takes more iterations to converge than a sparsely connected graph.
The new developments in coding theory research have revolutionized the application of coding to practical systems. Low-Density Parity Check (LDPC) codes form a class of Shannon limit approaching codes opted for digital communication systems that require high reliability. This thesis investigates the underlying relationship between the spectral properties of the parity check matrix and LDPC decoding convergence. The bit error rate of an LDPC code is plotted for the parity check matrix that has different Second Smallest Eigenvalue Modulus (SSEM) of its corresponding Laplacian matrix. It is found that for a given (n,k) LDPC code, large SSEM has better error floor performance than low SSEM. The value of SSEM decreases as the sparseness in a parity-check matrix is increased. It was also found from the simulation that long LDPC codes have better error floor performance than short codes. This thesis outlines an approach to analyze LDPC decoding based on the eigenvalue analysis of the corresponding parity check matrix.
We present several properties on minimum distance (dmin)(d_min)(dm​in) and girth (Gmin)(G_min)(Gm​in) in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large GminG_minGm​in could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.
In this paper, we present several properties on minimum distance(d/sub min/) and girth(G/sub min/) in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large G/sub min/ could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.
An efficient method for analyzing the performance of finite-length low-density parity-check (LDPC) codes in the waterfall region, when transmission takes place on a memoryless binary-input output-symmetric channel is proposed. This method is based on studying the variations of the channel quality around its expected value when observed during the transmission of a finite-length codeword. We model these variations with a single parameter. This parameter is then viewed as a random variable and its probability distribution function is obtained. Assuming that a decoding failure is the result of an observed channel worse than the codeiquests decoding threshold, the block error probability of finite-length LDPC codes under different decoding algorithms is estimated. Using an extrinsic information transfer chart analysis, the bit error probability is obtained from the block error probability. Different parameters can be used for modeling the channel variations. In this work, two of such parameters are studied. Through examples, it is shown that this method can closely predict the performance of LDPC codes of a few thousand bits or longer in the waterfall region.