A Two Stage Selective Averaging LDPC Decoding

Details A Two Stage Selective Averaging LDPC Decoding A Two Stage Selective Averaging LDPC Decoding

2011-07-14

arxiv.org/abs/1107.2867v1

Computer Science

Information Theory

5 pages, 4 figures

Scientific paper

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 regular PEG (504,252,3,6) code shows that the proposed two stage decoder performs significantly better than the standard decoder.

Affiliated with

Also associated with

No associations

Rating

A Two Stage Selective Averaging LDPC Decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Two Stage Selective Averaging LDPC Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Two Stage Selective Averaging LDPC Decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-225726