SYMBOL LEVEL DECODING FOR DUO-BINARY TURBO CODES
2017 ◽
Vol 18
(1)
◽
pp. 111-131
◽
Keyword(s):
This paper investigates the performance of three different symbol level decoding algorithms for Duo-Binary Turbo codes. Explicit details of the computations involved in the three decoding techniques, and a computational complexity analysis are given. Simulation results with different couple lengths, code-rates, and QPSK modulation reveal that the symbol level decoding with bit-level information outperforms the symbol level decoding by 0.1 dB on average in the error floor region. Moreover, a complexity analysis reveals that symbol level decoding with bit-level information reduces the decoding complexity by 19.6 % in terms of the total number of computations required for each half-iteration as compared to symbol level decoding.
2011 ◽
Vol 271-273
◽
pp. 458-463
2013 ◽
Vol 7
(1)
◽
pp. 63-75
◽
2014 ◽
Vol 610
◽
pp. 339-344
Keyword(s):
2020 ◽
Vol 11
(4)
◽
pp. 41-59