Absorbing sets and cycles

Title: Absorbing sets and cycles
Creator: Lechner, Gottfried; Johnson, Sarah J.
Relation: 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC 2012). Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing (Gothenburg, Sweden 27-31 August, 2012) p. 185-189
Publisher Link: http://dx.doi.org/10.1109/ISTC.2012.6325224
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Resource Type: conference paper
Date: 2012
Description: 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.
Subject: parity check codes; decoding; message passing; educational institutions; Australia; error analysis; stability analysis
Identifier: http://hdl.handle.net/1959.13/1328805
Identifier: uon:25997
Identifier: ISBN:9781457721151
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format