Scheduled-PEG construction of LDPC codes for Upper-Layer FEC

Details Scheduled-PEG construction of LDPC codes for Upper-Layer FEC Scheduled-PEG construction of LDPC codes for Upper-Layer FEC

2011-03-14

arxiv.org/abs/1103.2690v1

Computer Science

Information Theory

WCC 2011

Scientific paper

The Progressive Edge Growth (PEG) algorithm is one of the most widely-used method for constructing finite length LDPC codes. In this paper we consider the PEG algorithm together with a scheduling distribution, which specifies the order in which edges are established in the graph. The goal is to find a scheduling distribution that yields "the best" performance in terms of decoding overhead, performance metric specific to erasure codes and widely used for upper-layer forward error correction (UL-FEC). We rigorously formulate this optimization problem, and we show that it can be addressed by using genetic optimization algorithms. We also exhibit PEG codes with optimized scheduling distribution, whose decoding overhead is less than half of the decoding overhead of their classical-PEG counterparts.

Affiliated with

Also associated with

No associations

Rating

Scheduled-PEG construction of LDPC codes for Upper-Layer FEC 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 Scheduled-PEG construction of LDPC codes for Upper-Layer FEC, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduled-PEG construction of LDPC codes for Upper-Layer FEC will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-259806