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

Rami Klaimi (1, 2) , Charbel Abdel Nour (1, 2) , Catherine Douillard (1, 2) , Joumana Farah (3)

1 IMT Atlantique - ELEC - Département Electronique
2 Lab-STICC_IMTA_CACS_IAS
3 ULFG2 - Université Libanaise, Faculté de Génie en électricité et électronique, Branche 2 (Université Libanaise)

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 framework for the design of the best codes over different GF(q) is described. The designed codes offer better performance than the non-binary convolutional codes found in the literature. They also outperform their binary counterparts when combined with their corresponding QAM modulation or with lower order modulations.

Mots clés: Finite field; non-binary codes; recursive systematic convolutional codes; coded modulation; turbo codes

Domaines: Traitement du signal et de l'image [eess.SP]; Réseaux et télécommunications [cs.NI]; Théorie de l'information et codage [math.IT]

Rami Klaimi, Charbel Abdel Nour, Catherine Douillard, Joumana Farah. Design of Low-Complexity Convolutional Codes over GF(q). IEEE Global Communications Conference (GLOBECOM 2018), Dec 2018, Abu Dhabi, United Arab Emirates. ⟨hal-01868752v1⟩