In this work, we introduce new complexity reductions to the Local-SOVA algorithm, which allow an efficient implementation at a marginal BER penalty of 0.05 dB.
[PDF] Low-complexity Computational Units for the Local-SOVA Decoding ... - HAL
hal.science › document
May 12, 2020 · In this work, we introduce new complexity reductions to the Local-SOVA algorithm, which allow an efficient implementation at a marginal BER ...
In this work, we introduce new complexity reductions to the Local-SOVA algorithm, which allow an efficient implementation at a marginal BER penalty of 0.05. dB.
A modified accelerated search algorithm for the periodic operating modes of electronic circuits is described. An algorithm for the optimal selection of the ...
Low-complexity Computational Units for the Local-SOVA Decoding Algorithm. Stefan Weithoffer, Rami Klaimi, Charbel Abdel Nour, Norbert Wehn, Catherine ...
A low complexity variant dedicated to the direct association with high order constellations denoted by the nearest neighbor Local SOVA is proposed, ...
Jul 6, 2021 · Recently, the Local-SOVA (LSOVA) algorithm was pro- posed as a reduced-complexity alternative to the MLM for binary Turbo codes [9]. Based on a ...
Motivated by these large complexity reductions, we recently proposed hardware architectures for the computational units of the Local-SOVA algorithm in [20].
The proposed local SOVA exhibits a lower computational complexity than the Max-Log-MAP algorithm when employed for high-radix decoding in order to increase ...
Low-complexity computational units for the local-SOVA decoding algorithm. S Weithoffer, R Klaimi, CA Nour, N Wehn, C Douillard. 2020 IEEE 31st Annual ...