Abstract
Abstract This paper presents a new family of turbo codes called multi-non-binary turbo codes (MNBTCs) that generalizes the concept of turbo codes to multi-non-binary (MNB) parallel concatenated convolutional codes (PCCC). An MNBTC incorporates, as component encoders, recursive and systematic multi-non-binary convolutional encoders. The more compact data structure for these encoders confers some advantages on MNBTCs over other types of turbo codes, such as better asymptotic behavior, better convergence, and reduced latency. This paper presents in detail the structure and operation of an MNBTC: MNB encoding, trellis termination, Max-Log-MAP decoding adapted to the MNB case. It also shows an example of MNBTC whose performance is compared with the state-of-the-art turbo code adopted in the DVB-RCS2 standard.
Highlights
Two decades after their introduction in [1], turbo codes (TCs) have found their utility in numerous communication systems
Proposing a new family of multi-non-binary turbo codes (MNBTCs), this paper may be seen as a continuation of these concerns
The structure of the paper is as follows: in Section 2, we describe the MNBTC encoder and decoder, as well as component codes, the MNBTC structure, the encoding process and trellis termination, the Max-Logarithmic maximum a posteriori (MAP) (Log-MAP) algorithm adjusted to the MNB case, and details of interleaving
Summary
Two decades after their introduction in [1], turbo codes (TCs) have found their utility in numerous communication systems. The evolution of TC in terms of component convolutional encoder after the classic single binary turbo codes (SBTC) [1], was followed by double/multibinary turbo codes (D/MBTCs) [5,6] and non-binary turbo codes (NBTCs) [7,8,9] These new TC families aim to improve SBTC performance, especially by lowering the error floor. MNBTCs as non-binary LDPCs (NB-LDPCs) can be combined with high-order modulations, yielding increased bandwidth efficiency The price for these benefits is the increased complexity of the component code trellis and, of the computational effort of the decoder.
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 callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: 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.
