Turbo code

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 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) and in (deep space) satellite 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 (LDPC) codes, which provide similar performance. Until the patent for turbo codes expired,[1] the patent-free status of LDPC codes was an important factor in LDPC's continued relevance.[2]

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. Hagenauer has argued the term turbo code is a misnomer since there is no feedback involved in the encoding process.[3]

  1. ^ US 5446747 
  2. ^ Erico Guizzo (1 March 2004). "CLOSING IN ON THE PERFECT CODE". IEEE Spectrum. Archived from the original on 23 April 2023. "Another advantage, perhaps the biggest of all, is that the LDPC patents have expired, so companies can use them without having to pay for intellectual-property rights."
  3. ^ Hagenauer, Joachim; Offer, Elke; Papke, Luiz (March 1996). "Iterative Decoding of Binary Block and Convolutional Codes" (PDF). IEEE Transactions on Information Theory. 42 (2): 429–445. doi:10.1109/18.485714. Archived from the original (PDF) on 11 June 2013. Retrieved 20 March 2014.