DocumentCode :
2266996
Title :
Extended minsum algorithm for decoding LDPC codes over GF(/sub q/
Author :
Declercq, David ; Fossorier, Marc
Author_Institution :
ETIS, ENSEA-UCP-CNRS, Cergy-Pontoise
fYear :
2005
fDate :
4-9 Sept. 2005
Firstpage :
464
Lastpage :
468
Abstract :
In this paper, we develop a generalization of the minsum (MS) algorithm which not only performs additions without the need of channel estimation, but also with the two following objectives: (i) a complexity much lower than O(q2) so that finite fields of large order can be considered; and (ii) a small performance degradation compared with BP decoding. The first objective is achieved by introducing configuration sets, which allow to keep only a small number of meaningful values at the check node processing. The second objective is achieved by applying at the variable node processing the correction techniques of J. Chen and M. Fossorier, (2002) to the proposed algorithm
Keywords :
Galois fields; decoding; error correction; parity check codes; BP decoding; GF(q); LDPC code decoding; check node processing; configuration sets; correction techniques; extended minsum algorithm; small performance degradation; variable node processing; Channel estimation; Degradation; Galois fields; Iterative algorithms; Iterative decoding; Medical services; Parity check codes; Polynomials; Sparse matrices; Tensile stress;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
Type :
conf
DOI :
10.1109/ISIT.2005.1523377
Filename :
1523377
Link To Document :
بازگشت