Turbo code: Difference between revisions

Revision as of 22:13, 23 April 2019

Revision as of 01:07, 17 August 2019

Line 10:

The fundamental patent application for turbo codes was filed on April 23, 1991. The patent application lists [[Claude Berrou]] as the sole inventor of turbo codes. The patent filing resulted in several patents including [https://www.google.com/patents/US5446747 US Patent 5,446,747], which expired August 29, 2013.

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_Near_Shannon_limit_error-correcting_coding_and_decoding_Turbo-codes_13604275|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. The 1993 paper was formed from three separate submissions that were combined due to space constraints. The merger caused the paper to list three authors: Berrou, [[Alain Glavieux|Glavieux]], and [[Punya Thitimajshima|Thitimajshima]] (from Télécom Bretagne, former [[École Nationale Supérieure des Télécommunications de Bretagne|ENST Bretagne]], France). However, it is clear from the original patent filing that Berrou is the sole inventor of turbo codes and that the other authors of the paper contributed material other than the core concepts.

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 20:

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." He adds "[[Robert G. Gallager|R. Gallager]] and M. Tanner had already imagined coding and decoding techniques whose general principles are closely related," although the necessary calculations were impractical at that time.<ref>{{Citation|first=Claude|last=Berrou|title=The ten-year-old turbo codes are entering into service|___location=Bretagne, France|accessdate=11 February 2010|url=https://www.researchgate.net/publication/3199004_The_ten-year-old_turbo_codes_are_entering_into_service3199004}}</ref>

==An example encoder==

Line 112:

| doi=10.1109/49.661103

| postscript=.

| url=https://authors.library.caltech.edu/6938/1/MCEieeejstc98.pdf

}}</ref>