Low-complexity decoders for non-binary turbo codes - Archive ouverte HAL Access content directly
Conference Papers Year :

Low-complexity decoders for non-binary turbo codes


Following the increasing interest in non-binary coding schemes, turbo codes over different Galois fields have started to be considered recently. While showing improved performance when compared to their binary counterparts, the decoding complexity of this family of codes remains a main obstacle to their adoption in practical applications. In this work, a new low-complexity variant of the Min-Log-MAP algorithm is proposed. Thanks to the introduction of a bubble sorter for the different metrics used in the Min-Log-MAP decoder, the number of required computations is significantly reduced. A reduction by a factor of 6 in the number of additions and compare-select operations can be achieved with only a minor impact on error rate performance. With the use of an appropriate quantization, the resulting decoder paves the way for a future hardware implementation.
Fichier principal
Vignette du fichier
NB-LowComplexDecoder.pdf (1.18 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01868757 , version 1 (05-09-2018)



Rami Klaimi, Charbel Abdel Nour, Catherine Douillard, Joumana Farah. Low-complexity decoders for non-binary turbo codes. 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC 2018), Dec 2018, Hong Kong, Hong Kong SAR China. ⟨10.1109/ISTC.2018.8625359⟩. ⟨hal-01868757⟩
182 View
258 Download



Gmail Facebook Twitter LinkedIn More