Abstract
The 20th century saw the evolution of wireless communications through electromagnetic waves from the first telegraphic transmission in 1895 by Gugliemo Marconi towards the current so-called ‘third generation’ (3G) [1] and WiFi [2] multimedia communication devices that allow to exchange voice, image and data information at speeds of respectively a couple to over fifty megabits per second (Mb/s). This improvement in communications has been particularly accelerated in the second half of the 20th century thanks to the independent evolution of two fields of science: information theory and microelectronics. The year 1948 is considered as the major landmark in the development of digital technology due to achievements in both fields that would be eventually successfully combined. Claude Shannon on the information theory side set the very founding stone of this science with the definition of one binary unit of information, or bit, as well as the definition of channel capacity. In the same year, William Shockley and his team at Bell laboratories announced the invention of the transistor, which would be used later as the building element of circuits able to process and store bits1.
This parallel between Shannon’s definition of a bit and the transistor was based on Berrou’s and Glavieux’s introduction to their IEEE Information Theory invited paper of 1998, on the occasion of the 50th birthday of the transistor and of information theory. The whole article can be found in http://www.itsoc.org/review/frrev.html.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
3rd Generation Partnership Project (3GPP), Technical Specification Group (TSG), Radio Access Network (RAN), Working Group 1, “Multiplexing and channel coding”, TS 25.222 VI.0.0 Technical Specification, 1999-04.
C. Shannon, “A mathematical theory of communications”, Bell Sys. Tech. Journal, vol 27, October 1948.
Hamming R.W. “Error Detecting and Error Correcting Codes”. Bell Systems Technical Journal, v. 29, p. 147–160, 1950.
Reed Solomon, I.S. “Polynomial Codes over Certain Finite Fields”. J. Soc. Ind. Appl. Math., v.8, p. 300–304,1960.
Bose, R.C.; Ray-Chauduri, D.K. “On a Class of Error Correcting Binary Group Codes”. Inf. Control, v.3, p. 68–79, 1960.
Hocquenghem, A. “Codes corecteurs d’erreurs”. Chiffres, v.2, p. 147–156, 1959.
Elias, P. “Coding for Noisy Channels”. IRE Conv. Rec., parte 4, p.37–47, 1955.
Wozencraft, J.M.; Reiffen, B. “Sequential Decoding’. Massachussets: MIT Press, 1961.
Fano, R.M. “A Heuristic Discussion of Probabilistic Decoding”, IEEE Transactions on Information Theory, v.9, p.64–74,1963.
C. Berrou, A. Glavieux and P. Thitimajshima, “Near Shannon Limit Error Correcting Coding and Decoding: Turbo Codes”, in proc. IEEE International Conference on Communication, Geneva, Switzerland, May 1993, Vol. 2/3, pp. 1064–1071
J. Hagenauer, “The Turbo Principle: Tutorial Introduction and State of the Art”, in proc. International Symposium on Turbo Codes, Brest, France, 1997
Forney, G., Jr., “Burst-Correcting Codes for the Classic Bursty Channel”, in IEEE Transactions on Communications, Oct 1971, Vol. 19, Issue. 5, pp. 772–781
Benedetto, S. et al. Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes. TDA Progress Report 42–124, p. 63–87, 1996.
L.R. Bahl, J. Cocke, F. Jelinek, J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate”, IEEE Transactions on Information Theory, IT-20, pp 248–287, March 1974.
Forney, G., Jr., “Burst-Correcting Codes for the Classic Bursty Channel”, in IEEE Transactions on Communications, Oct 1971, Vol. 19, Issue. 5, pp. 772–781
R. Pyndiah, A. Glavieux, A. Picart and S. Jacq, “Near Optimal Decoding of Product Codes”, in proc. IEEE GLOBECOM’94, San Francisco, Nov. — Dec. 1994, Vol 1/3, pp. 339–343
S. Lin, D. J. Costello, Jr., “Error Control Coding — Fundamentals and Applications”, Prentice-Hall, 1983
A. Berthet, A, J. Fang, F. Buda, E. Lemois, P. Tortelier, “A comparison of SISO algorithms for iterative decoding of multidimensional product codes” in Proc. Vehicular Technologies Conference, Tokyo, Japan, Spring 2000, Vol. 2, pp 1021–1025
D. Chase, “A Class of Algorithms for Decoding Block Codes with Channel Measurement Information”, IEEE Trans. Inform. Theory, Jan. 1972, Vol. IT-18, pp. 170–182.
Viterbi, A.J. “Error bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm”. IEEE Transactions on Information Theory, v. 13, p.260–269, 1967
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Giulietti, A., Bougard, B., Van der Perre, L. (2004). Turbo Codes. In: Turbo Codes. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0477-1_1
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0477-1_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5096-5
Online ISBN: 978-1-4615-0477-1
eBook Packages: Springer Book Archive