Abstract
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.
Highlights
Since its inception in 1993, Turbo code [1], which allowed the bound established by Shannon in 1948 [2] to be approached significantly, have been the center of attention of researchers
Different couple lengths and code-rates have been employed with duo-binary Turbo codes with and without the incorporation of circular states have been used for this work
The identified schemes were implemented in Matlab and all the simulations were carried out using an Additive White Gaussian Noise (AWGN) channel, Quadrature Phase Shift Keying (QPSK) modulation and the eight-state double binary turbo encoder of the DVB-RCS standard
Summary
Since its inception in 1993, Turbo code [1], which allowed the bound established by Shannon in 1948 [2] to be approached significantly, have been the center of attention of researchers. In [19] and [20], the authors have presented a symbol level decoding scheme for duobinary and triple-binary Turbo codes This comprehensive study has been carried out over an AWGN channel to demonstrate the good performance of the proposed schemes. The performance of the decoding scheme is compared to the Turbo code standard for DVB-RCS over a Gaussian channel at Frame Error Rate (FER) of 10-4. The symbol-wise decoding algorithm presented in this work operates on bit-level LLRs as input and is shown to outperform the bit-wise decoding The advantage of this technique is that the limitation of using only QPSK modulation with the duo-binary Turbo codes [19, 20] can be overcome.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
