Skip to Main content Skip to Navigation
Conference papers

Low-complexity decoders for non-binary turbo codes

Abstract : 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.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Catherine Douillard Connect in order to contact the contributor
Submitted on : Wednesday, September 5, 2018 - 5:58:18 PM
Last modification on : Friday, August 5, 2022 - 2:54:52 PM
Long-term archiving on: : Thursday, December 6, 2018 - 6:45:57 PM


Files produced by the author(s)



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⟩



Record views


Files downloads