Computer Science – Information Theory
Scientific paper
2012-02-07
Computer Science
Information Theory
submitted to International Symposium on Information theory (ISIT) 2012, 5 pages
Scientific paper
Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binary Symmetric channel (BSC). More recently, the technique of decimation which involves fixing the values of certain bits during decoding, was proposed for FAIDs in order to make them more amenable to analysis while maintaining their good performance. In this paper, we show how decimation can be used adaptively to further enhance the guaranteed error correction capability of FAIDs that are already good on a given code. The new adaptive decimation scheme proposed has marginally added complexity but can significantly improve the slope of the error floor performance of a particular FAID. We describe the adaptive decimation scheme particularly for 7-level FAIDs which propagate only 3-bit messages and provide numerical results for column-weight three codes. Analysis suggests that the failures of the new decoders are linked to stopping sets of the code.
Declercq David
Planjery Shiva Kumar
Vasic Bane
No associations
LandOfFree
Enhancing the Error Correction of Finite Alphabet Iterative Decoders via Adaptive Decimation 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 Enhancing the Error Correction of Finite Alphabet Iterative Decoders via Adaptive Decimation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enhancing the Error Correction of Finite Alphabet Iterative Decoders via Adaptive Decimation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-578816