Decoding algorithms for nonbinary LDPC codes over GF(q)

IEEE Transactions on Communications

Volumn 55, Issue 4, 2007, Pages 633-643

  Declercq, David ^a   Fossorier, Marc ^b  

^a Cergy Pontoise University   (France)

^b University of Hawaii at Manoa   (United States)

Author keywords

Complexity reduction; Iterative decoder; Nonbinary low density parity check (LDPC) codes

Indexed keywords

BAYESIAN NETWORKS; BINARY CODES; COMPUTATIONAL COMPLEXITY; ERROR CORRECTION; FOURIER TRANSFORMS; ITERATIVE DECODING; MESSAGE PASSING; TENSORS;

BELIEF PROPAGATION DECODING ALGORITHM; EXTENDED MIN-SUM; LOW-DENSITY PARITY-CHECK CODES; ULTRA-SPARSE CODES;

DATA COMMUNICATION SYSTEMS;

EID: 34247209021     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2007.894088     Document Type: Article

References (26)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching low-density parity check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
3. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
4. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
5. S. Y. Chung, G. D. Forney, T. J. Richardson, and R. L. Urbanke, "On the design of low-density parity check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001.
6. M. Davey and D. J. C. MacKay, "Low density parity check codes over GF(q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, Jun. 1998.
7. q) codes," in Proc. IEEE Int. Conf. Commun., Paris, France, Jun. 2004, pp. 528-532.
8. D. J. C. MacKay and M. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Proc. IMA Workshop Codes, Syst., Graphical Models, 1999, CD-ROM.
9. H. Song and J. R. Cruz, "Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording," IEEE Trans. Magn., vol. 39, no. 3, pp. 1081-1087, Mar. 2003.
10. q)," in Proc. Inf. Theory Workshop, Paris, France, Mar. 2003, pp. 70-73.
11. J. Chen and M. Fossorier, "Density evolution for two improved BP-based decoding algorithms of LDPC codes," IEEE Commun. Lett., vol. 6, no. 5, pp. 208-210, May 2002.
12. H. Wymeersch, H. Steendam, and M. Moeneclaey, "Log-domain decoding of LDPC codes over GF(q)," in Proc. IEEE Int. Conf. Commun., Paris, France, Jun. 2004, pp. 772-776.
13. A. P. Hekstra, Reduced-complexity decoding of LDPC codes over GF(q), preprint, 2003.
14. F. Kschischang, B. Frey, and H.-A. Loeliger, "Factor graphs and the sum product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
15. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
16. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
17. X. Li and M. R. Soleymani, "A proof of the Hadamard transform decoding of the belief propagation decoding for LDPCC over GF(q)," in Proc. Fall Veh. Technol. Conf., Sep. 2004, vol. 4, pp. 2518-2519.
18. M. Fossorier, M. Mihaljević, and H. Imai, "Reduced complexity iterative decoding of LDPC codes based on belief propagation," IEEE Trans. Commun., vol. 47, no. 5, pp. 673-680, May 1999.
19. J. Chen, A. Dholakia, E. Eleftheriou, M. Fossorier, and X.-Y. Hu, "Reduced-complexity decoding of LDPC codes," IEEE Trans. Commun. to be published.
20. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
21. J. Chen, R. M. Tanner, C. Jones, and Y. Li, "Improved min-sum decoding algorithms for irregular LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005, pp. 449-453.
22. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell Syst. Tech. J., vol. 38, pp. 611-656, 1959.
23. S. Dolinar, D. Dolinar, and F. Pollara, "Code performance as a function of block size," Jet Propulsion Lab., Pasadena, CA, TMO Progr. Rep. 42-133, May 1998.
24. H. Wymeersch, H. Steendam, and M. Moeneclaey, "Computational complexity and quantization effects of decoding algorithms of LDPC codes over GF(q)," in Proc. ICASSP, Montreal, QC, Canada, May 2004, pp. 772-776.
25. A. Goupil, M. Colas, G. Gelle, and D. Declercq, "On BP decoding of LDPC codes over groups," in Proc. Int. Symp. Turbo Codes, Munich, Germany, Apr. 2006, CD-ROM.
26. J. Zhao, F. Zarkeshvari, and A. H. Banihashemi, "On implementation of min-sum algorithm and its modifications for decoding LDPC codes," IEEE Trans. Commun., vol. 53, no. 4, pp. 549-554, Apr. 2005.