Correcting capabilities of binary irregular LDPC code under low-complexity iterative decoding algorithm

P. S. Rybin

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

This paper deals with the irregular binary low-density parity-check (LDPC) codes and two iterative low-complexity decoding algorithms. The first one is the majority error-correcting decoding algorithm, and the second one is iterative erasure-correcting decoding algorithm. The lower bounds on correcting capabilities (the guaranteed corrected error and erasure fraction respectively) of irregular LDPC code under decoding (error and erasure correcting respectively) algorithms with low-complexity were represented. These lower bounds were obtained as a result of analysis of Tanner graph representation of irregular LDPC code. The numerical results, obtained at the end of the paper for proposed lower-bounds 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
Pages (from-to)1432-1439
Number of pages8
JournalJournal of Communications Technology and Electronics
Volume61
Issue number12
DOIs
Publication statusPublished - 1 Dec 2016
Externally publishedYes

Keywords

  • binary
  • decoding algorithm
  • erasures
  • errors
  • irregular
  • iterative
  • LDPC code
  • low-complexity

Fingerprint

Dive into the research topics of 'Correcting capabilities of binary irregular LDPC code under low-complexity iterative decoding algorithm'. Together they form a unique fingerprint.

Cite this