DocumentCode :
1829528
Title :
Fast Min-Sum Algorithms for Decoding of LDPC over GF(q)
Author :
Huang, Xiaofei ; Ding, Suquan ; Yang, Zhixing ; Wu, Youshou
Author_Institution :
Sch. of Inf. Sci. & Technol., Tsinghua Univ., Beijing
fYear :
2006
fDate :
22-26 Oct. 2006
Firstpage :
96
Lastpage :
99
Abstract :
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 (2005) 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
Keywords :
Galois fields; decoding; dynamic programming; parity check codes; GF(q); LDPC; configuration reduction algorithm; decoding; dynamic programming; min-sum algorithms; Algorithm design and analysis; Decoding; Degradation; Digital video broadcasting; Dynamic programming; Galois fields; Heuristic algorithms; Parity check codes; Satellite broadcasting; Space technology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE
Conference_Location :
Chengdu
Print_ISBN :
1-4244-0067-8
Electronic_ISBN :
1-4244-0068-6
Type :
conf
DOI :
10.1109/ITW2.2006.323764
Filename :
4119262
Link To Document :
بازگشت