Conference paper Open Access
Design of Low-Complexity Convolutional Codes over GF(q )
Klaimi, Rami; Abdel Nour, Charbel; Douillard, Catherine; Farah, Joumana
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.
Files
(1.1 MB)
| Name | Size | |
|---|---|---|
|
CCsOverGFq_VF.pdf
md5:0e1737235d75e9260b418b287bb140e2 |
1.1 MB | Download |
79
60
views
downloads
| Views | 79 |
| Downloads | 60 |
| Data volume | 67.3 MB |
| Unique views | 76 |
| Unique downloads | 55 |
Indexed in
- Publication date:
- December 9, 2018
- DOI:
-
- Keyword(s):
- Finite field, non-binary codes, recursive systematic convolutional codes, coded modulation, turbo codes.
- Grants:
-
European Commission:
- EPIC - Enabling Practical Wireless Tb/s Communications with Next Generation Channel Coding (760150)
- Meeting:
- IEEE Global Communications Conference (GLOBECOM 2018), Abu Dhabi, 9-13 December 2018
- Communities:
- License (for files):
- Creative Commons Attribution 4.0 International