Open AccessConvolutional doubly orthogonal codes over GF ( q )
Author(s) -
Shen Xu Hua,
Haccoun David,
Cardinal Christian
Publication year - 2013
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2012.0491
Subject(s) - convolutional code , computer science , turbo code , serial concatenated convolutional codes , mathematics , algorithm , speech recognition , pattern recognition (psychology) , combinatorics , concatenated error correction code , artificial intelligence , block code , decoding methods
Convolutional doubly orthogonal (CDO) codes constitute a recent group of binary error correcting codes for additive white gaussian noise channel, achieving very good error performance at moderate values of E b / N 0 under the threshold decoding algorithm. Inspired by the low‐density parity‐check codes over the finite fields, this study extends the construction and decoding of single shift register CDO codes from binary field to the finite fields GF ( q ) for q > 2, referred to as the q ‐ary CDO codes. The threshold decoding algorithm is modified to accommodate the decoding requirement for this set of codes. Superior error performance has been observed for q ‐ary CDO codes over their binary counterparts, especially in the error floor region.