Conference paper Open Access

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

Klaimi, Rami; Abdel Nour, Charbel; Douillard, Catherine; Farah, Joumana

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Klaimi, Rami</dc:creator>
  <dc:creator>Abdel Nour, Charbel</dc:creator>
  <dc:creator>Douillard, Catherine</dc:creator>
  <dc:creator>Farah, Joumana</dc:creator>
  <dc:description>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.</dc:description>
  <dc:subject>Finite field,</dc:subject>
  <dc:subject>non-binary codes,</dc:subject>
  <dc:subject>recursive systematic convolutional codes,</dc:subject>
  <dc:subject>coded modulation,</dc:subject>
  <dc:subject>turbo codes.</dc:subject>
  <dc:title>Design of Low-Complexity Convolutional Codes over GF(q )</dc:title>
Views 127
Downloads 103
Data volume 115.6 MB
Unique views 114
Unique downloads 98


Cite as