DocumentCode :
1642429
Title :
ML vs. BP decoding of binary and non-binary LDPC codes
Author :
Scholl, Stefan ; Kienle, Frank ; Helmling, Michael ; Ruzika, Stefan
Author_Institution :
Microelectron. Syst. Design Res. Group, Univ. of Kaiserslautern, Kaiserslautern, Germany
fYear :
2012
Firstpage :
71
Lastpage :
75
Abstract :
It has been shown that non-binary LDPC codes have a better error correction performance than binary codes for short block lengths. However, this advantage was up to now only shown under belief propagation decoding. To gain new insights, we investigate binary and non-binary codes under ML decoding. Our analysis includes different modulation schemes and decoding algorithms. For ML decoding under different modulation schemes a flexible integer programming formulation is presented. In this paper, we show that with respect to ML decoding short non-binary LDPC codes are not necessarily superior to binary codes. The decoding gain observed under BP decoding originates mainly in the more powerful non-binary decoding algorithm.
Keywords :
binary codes; decoding; error correction; integer programming; parity check codes; BP decoding; ML decoding; belief propagation decoding; binary codes; error correction performance; flexible integer programming; modulation schemes; nonbinary LDPC codes; short block lengths; Binary codes; Complexity theory; Decoding; Demodulation; IP networks; Parity check codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Turbo Codes and Iterative Information Processing (ISTC), 2012 7th International Symposium on
Conference_Location :
Gothenburg
ISSN :
2165-4700
Print_ISBN :
978-1-4577-2114-4
Electronic_ISBN :
2165-4700
Type :
conf
DOI :
10.1109/ISTC.2012.6325201
Filename :
6325201
Link To Document :
بازگشت