A Two Stage Selective Averaging LDPC Decoding

Kumar, Dinesh A and Dukkipati, Ambedkar (2012) A Two Stage Selective Averaging LDPC Decoding. In: IEEE International Symposium on Information Theory, JUL 01-06, 2012 , Cambridge, MA.

PDF ieee_isitp_2012.pdf - Published Version Restricted to Registered users only Download (342kB) | Request a copy

Abstract

Low density parity-check (LDPC) codes are a class of linear block codes that are decoded by running belief propagation (BP) algorithm or log-likelihood ratio belief propagation (LLR-BP) over the factor graph of the code. One of the disadvantages of LDPC codes is the onset of an error floor at high values of signal to noise ratio caused by trapping sets. In this paper, we propose a two stage decoder to deal with different types of trapping sets. Oscillating trapping sets are taken care by the first stage of the decoder and the elementary trapping sets are handled by the second stage of the decoder. Simulation results on the regular PEG (504,252,3,6) code and the irregular PEG (1024,518,15,8) code shows that the proposed two stage decoder performs significantly better than the standard decoder.

Item Type:	Conference Paper
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copyright for this article belongs to IEEE, NEW YORK
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	07 Feb 2013 11:52
Last Modified:	07 Feb 2013 11:52
URI:	http://eprints.iisc.ac.in/id/eprint/45754

Actions (login required)

View Item