Absorbing sets and cycles
Files
(Published version)
Date
2012
Authors
Lechner, G.
Johnson, S.J.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
International Symposium on Turbo Codes and Iterative Information Processing, ISTC, 2012, pp.185-189
Statement of Responsibility
Conference Name
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (27 Aug 2012 - 31 Aug 2012 : Gothenburg, Sweden)
Abstract
Absorbing sets have been identified as structures in the graph of a low-density parity-check code that cause error floors - in particular in combination with binary message passing decoding algorithms. In this paper it is shown that absorbing sets involving only variable nodes up to degree 3 are equivalent to cycles and a sufficient and necessary condition on the degree distribution to avoid these absorbing sets is derived. The results are extended to irregular graphs and simulation results demonstrate the improvement in the error floor region.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.