On the error-correcting capabilities of low-complexity decoded irregular LDPC codes

Pavel Rybin

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

9 Citations (Scopus)

Abstract

This paper deals with the irregular binary low-density parity-check (LDPC) codes with the constituent single parity check (SPC) codes and the error-correcting iterative low-complex decoding algorithm. The lower bound on the error fraction, guaranteed corrected by the considered iterative algorithm, was obtained for the irregular LDPC code for the first time in this paper. This lower bound was obtained as a result of analysis of Tanner graph representation of irregular LDPC code. The number of decoding iterations, required to correct the errors, is a logarithmic function of the code length. The numerical results, obtained at the end of the paper for proposed lower bound achieved similar results for the previously known best lower-bounds for regular LDPC codes and were represented for the first time for the irregular LDPC codes.

Original languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3165-3169
Number of pages5
ISBN (Print)9781479951864
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: 29 Jun 20144 Jul 2014

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period29/06/144/07/14

Fingerprint

Dive into the research topics of 'On the error-correcting capabilities of low-complexity decoded irregular LDPC codes'. Together they form a unique fingerprint.

Cite this