Simulation Research of Nonbinary LDPC Code Based on Finite Fields

The encoding and decoding of binary LDPC codes are expanded using characteristics of the Finite Fields concept, a nonbinary LDPC code encoding and decoding method based on the Finite Fields are investigated and the computational complexity of this algorithm is estimated, providing a foundation for the practical applications of this method. Then this algorithm is compared with the binary algorithm. The results show that its performance is superior to the binary BP iterative algorithm. Finally, the effects of the relevant factors such as the number of iterations selected, the structure of the check matrix etc on the algorithm performance were analyzed.

[1]  Nazanin Rahnavard,et al.  Nonuniform error correction using low-density parity-check codes , 2005, IEEE Transactions on Information Theory.

[2]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[3]  Henk Wymeersch,et al.  Log-domain decoding of LDPC codes over GF(q) , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[4]  Ajay Dholakia,et al.  Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.

[5]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[6]  David Declercq,et al.  Fast decoding algorithm for LDPC over GF(2/sup q/) , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[7]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[8]  Hongxin Song,et al.  Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording , 2003 .

[9]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[10]  D. Declercq,et al.  Fast Decoding Algorithm for LDPC over GF(2q) , 2003 .

[11]  D. Spielman,et al.  Expander codes , 1996 .

[12]  Matthew C. Davey,et al.  Error-Correction using Low Density Parity Check Codes , 1999 .