Augmented decoders for LDPC codes

The performance of a belief propagation decoder for low-density parity-check codes is limited by the presence of trapping sets in the code’s graph. This leads to an error floor at higher signal-to-noise ratios. We propose the use of an augmented decoder which operates by iteratively decoding on a se...

Full description

Saved in:

Bibliographic Details
Published in:	EURASIP journal on wireless communications and networking Vol. 2018; no. 1; pp. 1 - 9
Main Authors:	Rigby, Alex R., Olivier, JC, Myburgh, Hermanus C., Xiao, Chengshan, Salmon, Brian P.
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 02-08-2018 Springer Nature B.V SpringerOpen
Subjects:	Binary system BP decoding Codes Communications Engineering Decoders Decoding Engineering Error correcting codes Error floor mitigation Errors Information Systems Applications (incl.Internet) LDPC codes Networks Propagation Signal,Image and Speech Processing Trapping sets BP decoding Trapping sets LDPC codes Error floor mitigation
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The performance of a belief propagation decoder for low-density parity-check codes is limited by the presence of trapping sets in the code’s graph. This leads to an error floor at higher signal-to-noise ratios. We propose the use of an augmented decoder which operates by iteratively decoding on a set of graphs which have a subset of repeated check nodes. We compare the augmented decoder to other modified belief propagation decoders that have been presented in the literature. We show that for all the codes considered, the augmented decoder yields the best frame error rate in the error floor region.
ISSN:	1687-1499 1687-1472 1687-1499
DOI:	10.1186/s13638-018-1203-5