Computer Science – Information Theory
Scientific paper
2006-09-15
Computer Science
Information Theory
Accepted by IEEE Information Theory Workshop, Chengdu, China, 2006
Scientific paper
In this paper, we present a fast min-sum algorithm for decoding LDPC codes over GF(q). Our algorithm is different from the one presented by David Declercq and Marc Fossorier in ISIT 05 only at the way of speeding up the horizontal scan in the min-sum algorithm. The Declercq and Fossorier's algorithm speeds up the computation by reducing the number of configurations, while our algorithm uses the dynamic programming instead. Compared with the configuration reduction algorithm, the dynamic programming one is simpler at the design stage because it has less parameters to tune. Furthermore, it does not have the performance degradation problem caused by the configuration reduction because it searches the whole configuration space efficiently through dynamic programming. Both algorithms have the same level of complexity and use simple operations which are suitable for hardware implementations.
Ding Suquan
Huang Xiaofei
Wu Youshou
Yang Zhixing
No associations
LandOfFree
Fast Min-Sum Algorithms for Decoding of LDPC over GF(q) 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 Fast Min-Sum Algorithms for Decoding of LDPC over GF(q), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Min-Sum Algorithms for Decoding of LDPC over GF(q) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-282622