Turbo codes and turbo algorithms
Abstract
In the first part of this paper, several basic ideas that prompted the coming of turbo codes are commented on. We then present some personal points of view on the main advances obtained in past years on turbo coding and decoding such as the circular trellis termination of recursive systematic convolutional codes and double-binary turbo codes associated with Max-Log-MAP decoding. A novel evaluation method, called genieinitialised iterative processing (GIIP), is introduced to assess the error performance of iterative processing. We show that using GIIP produces a result that can be viewed as a lower bound of the maximum likelihood iterative decoding and detection performance. Finally, two wireless communication systems are presented to illustrate recent applications of the turbo principle, the first one being multiple-input/multiple-output channel iterative detection and the second one multi-carrier modulation with linear precoding.
Keywords
Turbo code, iterative decoding
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
C. Berrou, C. Langlais and Y. Yu, "Turbo codes and turbo algorithms," in Journal of Communications Software and Systems, vol. 2, no. 3, pp. 179-190, April 2017, doi: 10.24138/jcomss.v2i3.282
@article{berrou2006turbocodes,
author = {Claude Berrou and Charlotte Langlais and Yi Yu},
title = {Turbo codes and turbo algorithms},
journal = {Journal of Communications Software and Systems},
month = {4},
year = {2006},
volume = {2},
number = {3},
pages = {179--190},
doi = {10.24138/jcomss.v2i3.282},
url = {https://doi.org/10.24138/jcomss.v2i3.282}
}