DocumentCode :
2729983
Title :
A symbol-reliability based message-passing decoding algorithm for nonbinary LDPC codes over finite fields
Author :
Chen, Chao ; Bai, Baoming ; Ma, Xiao ; Wang, Xinmei
Author_Institution :
State Key Lab. of ISN, Xidian Univ., Xi´´an, China
fYear :
2010
fDate :
6-10 Sept. 2010
Firstpage :
251
Lastpage :
255
Abstract :
Based on the idea of plurality voting, we develop a low-complexity symbol-reliability based message-passing decoding algorithm for nonbinary low-density parity-check (LDPC) codes over finite fields. A key feature of the algorithm is that the message passed in the Tanner graph is the field element with the highest reliability. This leads to a very simple check node update. The algorithm requires only finite and integer operations. Moreover, the estimation of the signal-to-noise ratio (SNR) is not needed. Compared to the Fast Fourier Transform based q-ary sum-product algorithm (FFT-QSPA), the proposed decoding algorithm provides an excellent trade-off between performance and complexity for the nonbinary LDPC codes constructed based on finite geometries, finite fields and cyclotomic cosets.
Keywords :
decoding; graph theory; message passing; parity check codes; reliability; Tanner graph; message passing decoding algorithm; nonbinary LDPC codes; signal to noise ratio; symbol reliability; Frequency modulation; Integrated circuits;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on
Conference_Location :
Brest
Print_ISBN :
978-1-4244-6744-0
Electronic_ISBN :
978-1-4244-6745-7
Type :
conf
DOI :
10.1109/ISTC.2010.5613849
Filename :
5613849
Link To Document :
بازگشت