Content deleted Content added
m reorder sections |
No edit summary |
||
Line 2:
{{Use dmy dates|date=January 2020}}
{{Use American English|date = March 2019}}
In [[information theory]], '''turbo codes''' (originally in French ''Turbocodes'') are a class of high-performance [[forward error correction]] (FEC) codes developed around 1990–91, but first published in 1993. They were the first practical codes to closely approach the maximum channel capacity or [[Shannon–Hartley theorem|Shannon limit]], a theoretical maximum for the [[code rate]] at which reliable communication is still possible given a specific noise level. Turbo codes are used in [[3G]]/[[4G]] mobile communications (e.g., in [[UMTS]] and [[LTE (telecommunication)|LTE]]) and in ([[Deep Space Network|deep space]]) [[satellite]] [[telecommunication|communications]] as well as other applications where designers seek to achieve reliable information transfer over bandwidth- or latency-constrained communication links in the presence of data-corrupting noise. Turbo codes compete with [[Low-density_parity-check_code|low-density parity-check]] (LDPC) codes, which provide similar performance.
The name "turbo code" arose from the feedback loop used during normal turbo code decoding, which was analogized to the exhaust feedback used for engine [[turbocharging]]. [[Joachim Hagenauer|Hagenauer]] has argued the term turbo code is a misnomer since there is no feedback involved in the encoding process.<ref>{{cite web |url=http://www.ima.umn.edu/csg/bib/bib16.0429hage.pdf |first1=Joachim |last1=Joachim Hagenauer |display-authors=etal |title=Iterative Decoding of Binary Block and Convolutional Codes |accessdate=20 March 2014 |url-status=dead |archiveurl=https://web.archive.org/web/20130611235418/http://www.ima.umn.edu/csg/bib/bib16.0429hage.pdf |archivedate=11 June 2013 }}</ref>
| |||