Turbo codes and turbo algorithms
Author(s) -
Claude Berrou,
Charlotte Langlais,
Yi Yu
Publication year - 2017
Publication title -
journal of communications software and systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.191
H-Index - 13
eISSN - 1846-6079
pISSN - 1845-6421
DOI - 10.24138/jcomss.v2i3.282
Subject(s) - turbo code , computer science , serial concatenated convolutional codes , convolutional code , turbo equalizer , turbo , algorithm , bcjr algorithm , decoding methods , trellis (graph) , concatenated error correction code , theoretical computer science , block code , automotive engineering , engineering
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-LogMAP 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom