Non-binary LDPC codes vs. Reed-Solomon codes

This paper investigates the potential of non-binary LDPC codes to replace widely used Reed-Solomon (RS) codes for applications in communication and storage systems for combating mixed types of noise and interferences. The investigation begins with presentation of four algebraic constructions of RS-based non-binary quasi-cyclic (QC)-LDPC codes. Then, the performances of some codes constructed based on the proposed methods with iterative decoding are compared with those of RS codes of the same lengths and rates decoded with the hard-decision Berlekamp-Massey (BM)-algorithm and the algebraic soft-decision Kotter-Vardy (KV)-algorithm over both the AWGN and a Rayleigh fading channels. Comparison shows that the constructed non-binary QC-LDPC codes significantly outperform their corresponding RS codes decoded with either the BM-algorithm or the KV-algorithm. Most impressively, the orders of decoding computational complexity of the constructed non-binary QC-LDPC codes decoded with 5 and 50 iterations of a Fast Fourier Transform based sum-product algorithm are much smaller than those of their corresponding RS codes decoded with the KV-algorithm, while achieve 1:5 to 3 dB coding gains. The comparison shows that well designed non-binary LDPC codes have a great potential to replace RS codes for some applications in communication or storage systems, at least before a very efficient algorithm for decoding RS codes is devised.

[1]  Khaled A. S. Abdel-Ghaffar,et al.  Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels , 2006, IEEE Transactions on Communications.

[2]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[3]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[4]  Yahong Rosa Zheng,et al.  Improved models for the generation of multiple uncorrelated Rayleigh fading waveforms , 2002, IEEE Communications Letters.

[5]  Robert J. McEliece,et al.  Iterative algebraic soft-decision list decoding of Reed-Solomon codes , 2005, IEEE Journal on Selected Areas in Communications.

[6]  T. Fuja,et al.  Design of good low-density parity-check codes for block fading channels , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..

[7]  Shu Lin,et al.  Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking , 2007, IEEE Transactions on Information Theory.

[8]  Paul H. Siegel,et al.  Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels , 2001, IEEE J. Sel. Areas Commun..

[9]  R. M. Tanner Spectral graphs for quasi-cyclic LDPC codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[10]  Frank R. Kschischang,et al.  Applications of algebraic soft-decision decoding of Reed-Solomon codes , 2006, IEEE Transactions on Communications.

[11]  Frank R. Kschischang,et al.  Applications of Algebraic Soft-Decision Decoding of Reed–Solomon Codes , 2006 .

[12]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[13]  Shu Lin,et al.  Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.

[14]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[15]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[16]  David Declercq,et al.  Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ , 2007, IEEE Transactions on Communications.

[17]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[18]  David J. C. MacKay,et al.  Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.

[19]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[20]  Richard D. Wesel,et al.  Robustness of LDPC codes on periodic fading channels , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[21]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

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

[23]  Zongwang Li,et al.  Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..