Low-complexity decoding for non-binary LDPC codes in high order fields

IEEE Transactions on Communications

Volumn 58, Issue 5, 2010, Pages 1365-1375

  Voicila, Adrian ^a   Declercq, David ^a   Verdier, Francois ^a   Fossorier, Marc ^a   Urard, Pascal ^b  

^a Cergy Pontoise University   (France)

^b STMICROELECTRONICS   (France)

Author keywords

Iterative decoding; Low complexity algorithm; Non binary LDPC codes

Indexed keywords

COMPLEXITY REDUCTION; DECODING ITERATION; DENSITY EVOLUTION; EFFICIENT IMPLEMENTATION; HIGH ORDER; KEY FEATURE; LDPC DECODER; LOW COMPLEXITY ALGORITHM; LOW-COMPLEXITY; MEMORY PROBLEMS; MEMORY REQUIREMENTS; MIN-SUM; NON-BINARY; NON-BINARY LDPC CODES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

ITERATIVE DECODING;

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

References (18)

1. 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, pp. 619-637, Feb. 2001
2. M. Davey and D. J. C. MacKay, "Low density parity check codes over GF (q), " IEEE Commun. Lett., vol. 2, pp. 165-167, June 1998.
3. q) codes, " in Proc. IEEE Intern. Conf. on Commun., Paris, France, pp. 528-532, June 2004.
4. C. Poulliat, M. Fossorier, and D. Declercq, "Design of non binary LDPC codes using their binary image: algebraic properties, " ISIT'06, Seattle, USA, July 2006.
5. A. Bennatan and D. Burshtein, "Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels, " IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 549-583, Feb. 2006.
6. q), " in Proc. 2003 Inform. Theory Workshop, Paris, France, pp. 70-73, Mar. 2003
7. D. Declercq and M. Fossorier, "Decoding algorithms for nonbinary LDPC codes over GF (q), " IEEE Trans. Commun., vol. 55, no. 4, pp. 633-643, Apr. 2007. (Pubitemid 46621444)
8. H. Song and J. R. Cruz, "Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording, " IEEE Trans. Magn., vol. 39, pp. 1081-1087, Mar. 2003.
9. H. Wymeersch, H. Steendam, and M. Moeneclaey, "Log-domain decoding of LDPC codes over GF (q), " in Proc. IEEE Intern. Conf. on Commun., Paris, France, June 2004, pp. 772-776.
10. J. Chen, A. Dholakia, E. Eleftheriou, M. Fossorier, and X.-Y. Hu, "Reduced complexity decoding of LDPC codes, " IEEE Trans. Commun., vol. 53, pp. 1288-1299, July 2005 (Pubitemid 41269104)
11. R. M. Tanner, "A recursive approach to low complexity codes, " IEEE Trans. Inf. Theory, vol. 27, pp. 533-547, 1981.
12. L. Ping and W. K. Leung, "Decoding low density parity check codes with finite quantization bits, " IEEE Commun. Lett., vol. 4, no. 2, pp. 62-64, Feb. 2000.
13. J. Chen and M. Fossorier, "Density evolution for two improved BP-based decoding algorithms of LDPC codes, " IEEE Commun. Lett., vol. 6, pp. 208-210, May 2002.
14. J. Zhang and M. Fossorier "Shuffled iterative decoding, " IEEE Trans. Commun., vol. 53, pp. 209-213, Feb. 2005
15. N. Yacov, H. Efraim, H. Kfir, I. Kanter, and O. Shental, "Parallel vs. sequential belief propagation decoding of LDPC codes over GF (q) and Markov sources, " ArXiv Computer Science e-prints, cs/0605069, May 2006
16. 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, Canada, May 2004
17. D. J. C. MacKay, "Online database of low-density parity check codes." [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/ codes/data.html.
18. T. Zhang, Z. Wang, and K. K. Pahri, "On finite precision implementation of low parity check codes, " in Proc. ISCAS, Sydney, Australia, May 2001