Klaimi, Rami
Abdel Nour, Charbel
Douillard, Catherine
Farah, Joumana
2018-12-03
<p>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.</p>
https://doi.org/10.1109/ISTC.2018.8625359
oai:zenodo.org:2560058
Zenodo
https://zenodo.org/communities/epic_h2020
https://zenodo.org/communities/eu
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
ISTC 2018, International Symposium on Turbo Codes & Iterative Information Processing 2018, Hong Kong, 3-7 December 2018
Turbo codes
correlation in decoding
interleaving
asymptotic performance
Low-complexity decoders for non-binary turbo codes
info:eu-repo/semantics/conferencePaper