On the performance analysis of short LDPC codes

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publication2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages18-22
Number of pages5
ISBN (Electronic)9781728119441
DOIs
Publication statusPublished - Oct 2019
Externally publishedYes
Event16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019 - Moscow, Russian Federation
Duration: 21 Oct 201925 Oct 2019

Publication series

Name2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019

Conference

Conference16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
Country/TerritoryRussian Federation
CityMoscow
Period21/10/1925/10/19

Keywords

  • eigenvalues
  • graph centrality
  • graph centralization
  • Laplacian matrix
  • Low-density parity check codes(LDPC)
  • polynomial regression
  • Tanner graph

Fingerprint

Dive into the research topics of 'On the performance analysis of short LDPC codes'. Together they form a unique fingerprint.

Cite this