Computer Science – Information Theory
Scientific paper
2007-10-27
Computer Science
Information Theory
9 pages, 3 figures
Scientific paper
Aiming at bridging the gap between the maximum likelihood decoding (MLD) and the suboptimal iterative decodings for short or medium length LDPC codes, we present a generalized ordered statistic decoding (OSD) in the form of syndrome decoding, to cascade with the belief propagation (BP) or enhanced min-sum decoding. The OSD is invoked only when the decoding failures are obtained for the preceded iterative decoding method. With respect to the existing OSD which is based on the accumulated log-likelihood ratio (LLR) metric, we extend the accumulative metric to the situation where the BP decoding is in the probability domain. Moreover, after generalizing the accumulative metric to the context of the normalized or offset min-sum decoding, the OSD shows appealing tradeoff between performance and complexity. In the OSD implementation, when deciding the true error pattern among many candidates, an alternative proposed proves to be effective to reduce the number of real additions without performance loss. Simulation results demonstrate that the cascade connection of enhanced min-sum and OSD decodings outperforms the BP alone significantly, in terms of either performance or complexity.
Feng Guangzeng
Li Guangwen
No associations
LandOfFree
Generalized reliability-based syndrome decoding for LDPC codes 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 Generalized reliability-based syndrome decoding for LDPC codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized reliability-based syndrome decoding for LDPC codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-469038