Content deleted Content added
m →External links: HTTP → HTTPS for IEEE Spectrum, replaced: http://spectrum.ieee.org/ → https://spectrum.ieee.org/ |
m Use lower case consistently for the term "turbo codes", removed a few redundant spaces |
||
Line 7:
==History==
The fundamental patent application for turbo codes was filed on 23 April 1991.
The first public paper on turbo codes was "''Near Shannon Limit Error-correcting Coding and Decoding: Turbo-codes''".<ref>{{Citation|url=https://www.researchgate.net/publication/3604275|first=Claude|first2=Alain|first3=Punya|last=Berrou|last2=Glavieux|last3=Thitimajshima|title=Near Shannon Limit Error – Correcting|accessdate=11 February 2010}}</ref> This paper was published 1993 in the Proceedings of IEEE International Communications Conference.
Turbo codes were so revolutionary at the time of their introduction that many experts in the field of coding did not believe the reported results. When the performance was confirmed a small revolution in the world of coding took place that led to the investigation of many other types of iterative signal processing.
Line 15:
The first class of turbo code was the parallel concatenated convolutional code (PCCC). Since the introduction of the original parallel turbo codes in 1993, many other classes of turbo code have been discovered, including serial versions [[serial concatenated convolutional codes]] and [[repeat-accumulate code]]s. Iterative turbo decoding methods have also been applied to more conventional FEC systems, including Reed-Solomon corrected convolutional codes, although these systems are too complex for practical implementations of iterative decoders. Turbo equalization also flowed from the concept of turbo coding.
In addition to turbo codes, Berrou also invented recursive systematic convolutional (RSC) codes, which are used in the example implementation of turbo codes described in the patent.
Prior to turbo codes, the best constructions were serial [[concatenated code]]s based on an outer [[Reed-Solomon error correction]] code combined with an inner [[Viterbi algorithm|Viterbi-decoded]] short constraint length [[convolutional code]], also known as RSV codes.
In a later paper, Berrou gave credit to the intuition of "G. Battail, [[Joachim Hagenauer|J. Hagenauer]] and P. Hoeher, who, in the late 80s, highlighted the interest of probabilistic processing."
==An example encoder==
| |||