Turbo code: Difference between revisions

Revision as of 11:37, 10 July 2005

Revision as of 17:28, 16 July 2005

Line 3:

The method was introduced by [[Claude Berrou|Berrou]], [[Alain Glavieux|Glavieux]], and [[Punya Thitimajshima|Thitimajshima]] in their [[1993]] paper: "''Near Shannon Limit error-correcting coding and decoding: Turbo-codes''" published in the Proceedings of IEEE International Communications Conference [http://www-elec.enst-bretagne.fr/equipe/berrou/Near%20Shannon%20Limit%20Error.pdf]. Turbo code refinements and implementation are an area of active research at a number of universities.

Turbo codes make it possible to increase available bandwidth without increasing the power of a transmission, or they can be used to decrease the amount of power used to transmit at a certain data rate. Its main drawbackdrawbacks isare the relative high decoding complexity and a relatively high [[latency (engineering)|latency]], which makes it unsuitable for some applications. For satellite use, this is not of great concern, since the transmission distance itself introduces latency due to the limited [[speed of light]]. Turbo codes are used extensively in [[3G]] mobile telephony standards.

Prior to Turbo codes, the best known technique combined a [[Reed-Solomon error correction]] [[block code]] with a [[Viterbi algorithm]] [[convolutional code]].