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

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 correct...

Full description

Saved in:
Bibliographic Details
Published in:Journal of communications technology & electronics Vol. 61; no. 12; pp. 1432 - 1439
Main Author: Rybin, P. S.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01.12.2016
Springer
Springer Nature B.V
Subjects:
Algorithms
Analysis
Binary codes
Binary system
Codes
Coding theory
Communications Engineering
Decoding
Electronics
Engineering
Error correcting codes
Error correction
Error correction & detection
Graph representations
Iterative methods
Low density parity check codes
Lower bounds
Networks
Parity
Studies
Theory and Methods of Information Processing
low-complexity
erasures
binary
iterative
irregular
LDPC code
errors
decoding algorithm
ISSN:1064-2269, 1555-6557
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1064-2269
1555-6557
DOI:10.1134/S1064226916120214