Computer Science – Information Theory
Scientific paper
2008-04-18
Computer Science
Information Theory
2008 Advanced Satellite Mobile Systems Conference. 9 pages, 12 figures
Scientific paper
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an ideal maximum-distance-separable code on the binary erasure channel. Such result is achievable down to low error rates, even for small and moderate block sizes, while keeping the decoding complexity low, thanks to a class of decoding algorithms which exploits the sparseness of the parity-check matrix to reduce the complexity of Gaussian elimination (GE). In this paper the main concepts underlying ML decoding of LDPC codes are recalled. A performance analysis among various LDPC code classes is then carried out, including a comparison with fixed-rate Raptor codes. The results show that LDPC and Raptor codes provide almost identical performance in terms of decoding failure probability vs. overhead.
Chiani Marco
Liva Gianluigi
Matuz Balazs
Paolini Enrico
Varrella Michela
No associations
LandOfFree
Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC 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 Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-304067