Turbo and Turbo-Like Codes: Principles and Applications in Telecommunications

Abstract

Tremendous progress in reducing turbo code computational complexity, memory requirements and performance limitations is leading to their wide use in commercial communications systems.ABSTRACT | For decades, the de facto standard for forward error correction was a convolutional code decoded with the Viterbi algorithm, often concatenated with another code (e.g., aReed-Solomon code). But since the introduction of turbo codes in 1993, much more powerful codes referred to collectively as turbo and turbo-like codes have eclipsed classical methods.These powerful error-correcting techniques achieve excellent error-rate performance that can closely approach Shannon's channel capacity limit. The lure of these large coding gains has resulted in their incorporation into a widening array of telecommunications standards and systems. This paper will briefly characterize turbo and turbo-like codes, examine their implications for physical layer system design, and discuss standards and systems where they are being used. The emphasis will be on telecommunications applications, particularly wireless, though others are mentioned. Some thoughts on the use of turbo and turbo-like codes in the future will also be given.

Low-Density Parity-Check Codes and Their Rateless Relatives

“…Constructions of LDPC codes using this design philosophy have been proposed in [137], [138], [187], [188], amongst others. Further insights related to the hardware implementation of LDPC codes are provided in [189].…”

A brief overview and experimental researches of novel PL-log-MAP turbo decoding algorithm

“…Thus, turbo code is the most effective method for information transmission in channels with low energy consumption. The results of original work [1] gave a powerful impetus to scientists to perform detailed research in the turbo decoding field with using of complex computational algorithms with high degree of error correction [2]. High turbo code efficiency is caused by special iterative decoding algorithms SOVA, Bi-SOVA, MAP or BCJR, log-MAP and other modifications [4-9, 12, 14].…”

Flexible and high-efficiency turbo product code decoder design

“…Turbo product code (TPC) performs close to the Shannon limit and has lower complexity than turbo convolutional code [1]. TPC easily achieves throughput of gigabit per second by decoding rows and columns in parallel.…”