Design of Low-Complexity Convolutional Codes over GF(q)

Conference object, Preprint English OPEN
Klaimi , Rami; Abdel Nour , Charbel; Douillard , Catherine; Farah , Joumana;
(2018)
  • Publisher: HAL CCSD
  • Related identifiers: doi: 10.1109/GLOCOM.2018.8647824
  • Subject: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] | coded modulation, | non-binary codes | non-binary codes, | recursive systematic convolutional codes, | turbo codes | [ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI] | recursive systematic convolutional codes | [ INFO.INFO-TS ] Computer Science [cs]/Signal and Image Processing | [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing | Finite field | coded modulation | Computer Science - Information Theory | [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT] | Finite field, | [ MATH.MATH-IT ] Mathematics [math]/Information Theory [math.IT] | turbo codes.

International audience; This paper proposes a new family of recursive systematic convolutional codes, defined in the non-binary domain over different Galois fields GF(q) and intended to be used as component codes for the design of non-binary turbo codes. A general frame... View more
  • References (22)
    22 references, page 1 of 3

    [1] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near shannon limit error-correcting coding and decoding: Turbo-codes,” in IEEE Int. Conf. Communications, (ICC'93), vol. 2, Geneva, Switzerland, May 1993, pp. 1064-1070.

    [2] R. Gallager, “Low-density parity-check codes,” IRE Trans. Inform. Theory, vol. 8, no. 1, pp. 21-28, 1962.

    [3] D. J. MacKay and R. M. Neal, “Near shannon limit performance of low density parity check codes,” Electron. Lett., vol. 32, no. 18, pp. 1645-1646, Aug. 1996.

    [4] G. Liva, L. Gaudio, T. Ninacs, and T. Jerkovits, “Code design for short blocks: A survey,” arXiv preprint arXiv:1610.00873, 2016.

    [5] J. Hokfelt, O. Edfors, and T. Maseng, “Turbo codes: Correlated extrinsic information and its impact on iterative decoding performance,” in IEEE 49th Vehicular Technology Conf., vol. 3, Houston, TX, USA, 1999, pp. 1871-1875.

    [6] M. C. Davey and D. J. MacKay, “Low density parity check codes over GF(q),” IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, June 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] T. Konishi, “A coded modulation scheme for 64-QAM with a matched mapping,” in IEEE Int. Symp. Inform. Theory and its Applications (ISITA), Oct. 2014, pp. 191-195.

    [9] G. Liva, S. Scalise, E. Paolini, and M. Chiani, “Turbo codes based on time-variant memory-1 convolutional codes over Fq,” in IEEE Int. Conf. Communications, Kyoto, Japan, June 2011, pp. 1-6.

    [10] G. Liva, E. Paolini, B. Matuz, S. Scalise, and M. Chiani, “Short turbo codes over high order fields,” IEEE Trans. Commun., vol. 61, no. 6, pp. 2201-2211, June 2013.

  • Related Organizations (1)
  • Metrics
Share - Bookmark