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

被引：0
|
作者：
Klaimi, Rami [1 ]
Nour, Charbel Abdel [1 ]
Douillard, Catherine [1 ]
Farah, Joumana [2 ]
机构：
[1] UBL, Lab STICC, IMT Atlantique, F-29238 Brest, France
[2] Lebanese Univ, Fac Engn, Dept Elect & Elect, Roumieh, Lebanon
来源：
2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) | 2018年
基金：
欧盟地平线“2020”;
关键词：
Finite field; non-binary codes; recursive systematic convolutional codes; coded modulation; turbo codes; TURBO CODES;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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.
引用
收藏
页数：7
相关论文
共 50 条
  • [1] New Constructions of Low-Complexity Convolutional Codes
    Katsiotis, Alexandros
    Rizotniliotis, Panagiotis
    Kalouptsidis, Nicholas
    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 1887 - +
  • [2] Convolutional doubly orthogonal codes over GF(q)
    Shen, Xu Hua
    Haccoun, David
    Cardinal, Christian
    IET COMMUNICATIONS, 2013, 7 (11) : 1126 - 1132
  • [3] Design of low-complexity linear dispersion codes
    Marathe, D
    Tandon, A
    2004 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING & COMMUNICATIONS (SPCOM), 2004, : 462 - 466
  • [4] On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
    Luo, Jie
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (12) : 5756 - 5765
  • [5] Low-Complexity ML Decoding for Convolutional Tail-Biting Codes
    Pai, Hung-Ta
    Han, Yunghsiang S.
    Wu, Ting-Yi
    Chen, Po-Ning
    Shieh, Shin-Lin
    IEEE COMMUNICATIONS LETTERS, 2008, 12 (12) : 883 - 885
  • [6] Low-complexity high-throughput decoding architecture for convolutional codes
    Ran Xu
    Kevin Morris
    Graeme Woodward
    Taskin Kocak
    EURASIP Journal on Wireless Communications and Networking, 2012
  • [7] Low-complexity high-throughput decoding architecture for convolutional codes
    Xu, Ran
    Morris, Kevin
    Woodward, Graeme
    Kocak, Taskin
    EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2012, : 1 - 14
  • [8] New Constructions of High-Performance Low-Complexity Convolutional Codes
    Katsiotis, Alexandros
    Rizomiliotis, Panagiotis
    Kalouptsidis, Nicholas
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (07) : 1961 - 1972
  • [9] LOW-COMPLEXITY VITERBI DECODER FOR CONVOLUTIONAL CODES IN CLASS-A NOISE
    Saleh, Tarik Shehata
    Marsland, Ian
    El-Tanany, Mohamed
    2012 25TH IEEE CANADIAN CONFERENCE ON ELECTRICAL & COMPUTER ENGINEERING (CCECE), 2012,
  • [10] Low Density Parity Check codes over GF(q)
    Davey, MC
    MacKay, DJC
    1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND, 1998, : 70 - 71
12345