Short turbo codes over high order fields

IEEE Transactions on Communications

Volumn 61, Issue 6, 2013, Pages 2201-2211

  Liva, Gianluigi ^a   Paolini, Enrico ^b   Matuz, Balázs ^a   Scalise, Sandro ^a   Chiani, Marco ^b  

^a GERMAN AEROSPACE CENTER DLR   (Germany)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Belief propagation; Fast Fourier transform; Finite field; Low density parity check (LDPC) codes; Non binary codes; Parallel concatenation; Serial concatenation; Turbo codes

Indexed keywords

ALGORITHMS; BINS; DECODING; FAST FOURIER TRANSFORMS; FORWARD ERROR CORRECTION; GRAPH THEORY; SATELLITE COMMUNICATION SYSTEMS; TURBO CODES;

BELIEF PROPAGATION; FINITE FIELDS; LOW-DENSITY PARITY-CHECK (LDPC) CODES; NON-BINARY CODES; PARALLEL CONCATENATION; SERIAL CONCATENATION;

CODES (SYMBOLS);

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

References (49)

1. R. Gallager, Low-Density Parity-Check Codes. MIT Press, 1963.
2. T. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacityapproaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
3. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: turbo-codes," in Proc. 1993 IEEE Int. Conf. Commun., pp. 1064-1070.
4. C. Berrou, A. Graell I Amat, Y. Ould Cheikh Mouhamedou, and Y. Saouter, "Improving the distance properties of turbo codes using a third component code: 3D turbo codes," IEEE Trans. Commun., vol. 57, no. 9, pp. 2505-2509, Sep. 2009.
5. C. Koller, A. Graell i Amat, J. Kliewer, F. Vatta, K. S. Zigangirov, and D. J. Costello, Jr., "Analysis and design of tuned turbo codes," IEEE Trans. Inf. Theory, vol. 58, no. 7, pp. 4796-4813, Jul. 2012.
6. M. Davey and D. MacKay, "Low-density parity check codes over GF(q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 70-71, Jun. 1998.
7. C. Poulliat, M. Fossorier, and D. Declercq, "Design of regular (2, dc)-LDPC codes over GF(q) using their binary images," IEEE Trans. Commun., vol. 56, no. 10, pp. 1626-1635, Oct. 2008.
8. X.-Y. Hu and E. Eleftheriou, "Cycle Tanner-graph codes over GF(2b)," in Proc. 2003 IEEE Int. Symp. Inf. Theory, p. 87.
9. W. Chen, C. Poulliat, and D. Declercq, "Structured high-girth non-binary cycle codes," in Proc. 2009 Asia-Pacific Conference on Communications.
10. G. Liva, E. Paolini, B. Matuz, and M. Chiani, "Short non-binary IRA codes on large-girth Hamiltonian graphs," in Proc. 2012 IEEE Int. Conf. Commun., pp. 2616-2620.
11. D. Divsalar, S. Dolinar, and C. Jones, "Short protograph-based LDPC codes," in Proc. 2007 IEEE Military Commun. Conf., pp. 1-6.
12. R. G. Gallager, Information Theory and Reliable Communication. Wiley, 1968.
13. C. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell System Tech. J., vol. 38, pp. 611-656, 1959.
14. D. MacKay, "Turbo codes are low-density parity-check codes," 1998. Available: http://www.inference.phy.cam.ac.uk/mackay/CodesTurbo. html
15. G. Colavolpe, "Design and performance of turbo Gallager codes," IEEE Trans. Commun., vol. 52, no. 11, pp. 1901-1908, Nov. 2004.
16. G. Liva, S. Scalise, E. Paolini, and M. Chiani, "Turbo codes based on time-variant memory-1 convolutional codes over Fq," in Proc. 2011 IEEE Int. Conf. Commun., pp. 1-6.
17. J. Berkmann, "On turbo decoding of nonbinary codes," IEEE Commun. Lett., vol. 2, no. 4, pp. 94-96, Apr. 1998.
18. -, "Symbol-by-symbol MAP decoding of nonbinary codes," in Proc. 1998 ITG-Fachtagung Codierung für Quelle, Kanal und Übertragung, pp. 95-100.
19. -, "Iterative decoding of nonbinary codes," Munich, Germany, Ph.D. dissertation, Tech. Univ. München, 2000.
20. G. White and D. Costello, Jr., "Construction and performance of q-ary turbo codes for use with m-ary modulation techniques," in Proc. 2000 IEEE Int. Symp. Inf. Theory, p. 220.
21. K. Yang, "Weighted nonbinary repeat-accumulate codes," IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 527-531, Mar. 2004.
22. A. Reid, T. Gulliver, and D. Taylor, "Rate-1/2 component codes for nonbinary turbo codes," IEEE Trans. Inf. Theory, vol. 53, no. 9, pp. 1417-1422, Sep. 2005.
23. K. Kasai, D. Declercq, C. Poulliat, and K. Sakaniwa, "Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codes," in Proc. 2010 IEEE Int. Symp. Inf. Theory, pp. 844-848.
24. T. de Cola, E. Paolini, G. Liva, and G. Calzolari, "Reliability options for data communications in the future deep-space missions," Proc. IEEE, vol. 99, no. 11, pp. 2056-2074, Nov. 2011.
25. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs," JPL INP 42-154, Tech. Rep., Aug. 2003.
26. R. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sep. 1981.
27. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2000 Int. Symp. Turbo Codes and Related Topics, pp. 1-8.
28. J. Huang, S. Zhou, and P. Willett, "Structure, property, and design of nonbinary regular cycle codes," IEEE Trans. Commun., vol. 58, no. 4, pp. 1060-1071, Apr. 2010.
29. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd edition. MIT Press, 1972.
30. S. Crozier, J. Lodge, P. Guinand, and A. Hunt, "Performance of turbo codes with relative prime and golden interleaving strategies," in Proc. 1999 Int. Mobile Satellite Conf., pp. 268-275.
31. P. Vontobel, "On the construction of turbo code interleavers based on graphs with large girth," in Proc. 2002 IEEE Int. Conf. Commun., pp, 1408-1412.
32. A. Mazumdar, A. Chaturvedi, and A. Banerjee, "Construction of turbo code interleavers from 3-regular Hamiltonian graphs," IEEE Commun. Lett., vol. 10, no. 4, pp. 284-286, Apr. 2006.
33. D. A. Holton and J. Sheehan, The Petersen Graph. Cambridge University Press, 1993.
34. A. Venkiah, D. Declercq, and C. Poulliat, "Design of cages with a randomized progressive edge growth algorithm," IEEE Commun. Lett., vol. 12, no. 14, pp. 301-303, Apr. 2008.
35. F. Mac Williams and N. Sloane, The Theory of Error-Correcting Codes. North Holland Mathematical Libray, 1977.
36. S. Yang, T. Honold, Y. Chen, Z. Zhang, and P. Qiu, "Weight distribution of regular low-density parity-check codes over finite fields," IEEE Trans. Inf. Theory, vol. 57, no. 11, pp. 7507-7521, Nov. 2011.
37. D. Truhachev, M. Lentmaier, and K. S. Zigangirov, "Some results concerning the design and decoding of turbo-codes," Problems of Inf. Transmission, vol. 37, no. 3, pp. 190-205, 2001.
38. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
39. C. Douillard and C. Berrou, "Turbo codes with rate-m/(m + 1) constituent convolutional codes," IEEE Trans. Commun., vol. 53, no. 10, pp. 1630-1638, Oct. 2005.
40. Available: www.iterativesolutions.com
41. E. Berlekamp, "The technology of error-correcting codes," Proc. IEEE, vol. 68, no. 5, pp. 564-593, May 1980.
42. R. C. Singleton, "Maximum distance q-nary codes," IEEE Trans. Inf. Theory, vol. 10, no. 2, pp. 116-118, Apr. 1964.
43. D. Divsalar, S. Dolinar, and C. Jones, "Low-rate LDPC codes with simple protograph structure," in Proc. 2005 IEEE Int. Symp. Inf. Theory, pp. 1622-1626.
44. "Code Imperfectness." Available: http://www331.jpl.nasa.gov/public/ imperfectness.html
45. A. Valembois and M. Fossorier, "Box and match techniques applied to soft-decision decoding," IEEE Trans. Inf. Theory, vol. 50, no. 5, pp. 796-810, May 2004.
46. D. Divsalar, S. Dolinar, C. Jones, and K. Andrews, "Capacityapproaching protograph codes," IEEE J. Sel. Areas Commun., vol. 27, no. 6, pp. 876-888, Aug. 2009.
47. A. Goupil, M. Colas, G. Gelle, and D. Declercq, "FFT-based BP decoding of general LDPC codes over Abelian groups," IEEE Trans. Commun., vol. 55, no. 4, pp. 644-649, Apr. 2007.
48. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory, vol. 20, pp. 284-287, Mar. 1974.
49. G. D. Forney, Jr., "Codes on graphs: normal realizations," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 520-548, Feb. 2001.