Turbokody-granica marzeń

• Autorzy: Hahn S. , Jarkowski J.

Warianty tytułu

EN

Turbo codes - nearly ideal

• Języki publikacji: PL

Abstrakty

PL

Przedstawiono zasadę działania kanału transmisyjnego z zastosowaniem wynalezionych w roku 1993 turbokodów. Kody te pozwalają zbliżyć się do granicy teoretycznej przepustowości kanału przy transmisji w obecności szumu, wyznaczonej przez CIauda Shannona w roku 1948. Praca jest adresowana do szerokiego kręgu osób zainteresowanych, niekoniecznie specjalistów w dziedzinie kodowania. Dla specjalistów zamieszczono obszerną bibliografię. Opisano również w zwięzły sposób niektóre zastosowania turbokodów.

EN

The principles of digital transmission in the presence of noise using the recently invented (1993) turbo codes arę presented. The turbo codes have a performance in terms of bit error probability very close to the Shannon limit. In principle the paper is addressed to a large forum of nonspecialist in the coding theory. However a large bibliography Is addressed to specialists. A brief description of present and future applications is included.

Słowa kluczowe

PL

kody; detekcja błędów; korekcja błędów; kody splotowe

EN

codes; turbo codes; shannon limits

• Wydawca: Wydawnictwo SIGMA-NOT
• Czasopismo: Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne
• Rocznik: 2000
• Tom: nr 4
• Strony: 288--293
• Opis fizyczny: Bibliogr. 46 poz., rys.

Twórcy

autor

Hahn S.

• Instytut Radioelektroniki,. Politechnika Warszawska

autor

Jarkowski J.

• Instytut Radioelektroniki,. Politechnika Warszawska

Bibliografia

• [1] Berrou C., Glavieux A., Thitmajshima P.: Near Shannon limit error-correcting coding and decoding: Turbo-codes, IEEE Proc. ICC '93, Geneva, Switzerland, May 1993
• [2] Shannon C.E.: A mathematical theory of communication, Bell System Technical Journal, vo1.27, 1948, part I
• [3] Shannon C. E.: Communication in the presence of noise, Proc. of the IRE, Vol. 37 nr 1, Feb. 1949
• [4] Shannon C. E.: Communication in the presence of noise, Proc. of the IEEE, Vol. 86 nr 2, Feb. 1998
• [5] Viterbi A. J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. On Information Theory, voI IT-B. 1967
• [6] Hagenauer J.: Iterative decoding of binary block and convolutional blocks, IEEE Trans. on Info. Theory, vol.42, No.2, March 1996 [
• 7] Podemski R., Tyczka P.: An overview of turbo codes – A novel error correcting technique, IX Krajowe Sympozjum Nauk Radiowych URSI, Poznań, 16-17 marzec, 1999
• [8] Açikel Ö. F., Ryan W.E.: Punctured turbo codes for BPSK/QPSK Channels, IEEE Trans.on Communications, vol. 47, No. 9, September 1999
• [9] Burkert F., Caire G., Hagenauer J., Lechner G. and Hindelang T.: Turbo decoding with unequal error protection applied to GSM speech coding, Proc. IEEE Global Telecomm. Conference-GLOBCOM'1996, London, U.K., Nov.1996
• [10] Kang J. H., Stark W.E.: Turbo codes for noncoherent FH-SS with partial band interference, IEEE Trans. on Communications, vol. 44, No. 10, October 1996
• [11] Wachsman U., Huber J.: Power and bandwidth efficient digital communications using turbo codes in multilevel codes, European Transactions on Telecommunications (EET), vol.6, NO.5, Sept.-Oct. 1995
• [12] Alexander P. D., Reed M. C., Asenstorfer J. A., Schlegel C. B.: Iterative multiuser Interference reduction: Turbo CDMA, IEEE Trans. on Communications, vol.47, No.7, July 1999
• [13] Bahl L.R. et al.: Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans. Info. Theory, vol. 20, March 1974
• [14] Barbulescu A. S., Pietrobon S. S.: Terminating the trellis of turbo codes in the same state, Electron. Lett., vol. 31, No.1,Jan. 1995.
• [15] Battail G.: A conceptual framework tor understanding turbo codes, IEEE Journal on Selected Areas in Communications, Vo1.16, No. 2, February 1998
• [16] Benedetto S. et al.: A soft-input soft-output APP module for iterative decoding ot concatenated codes, IEEE Commun. Lett., vol. 1, No.1, Jan. 1997
• [17] Benedetto S., Montorsi G.: Unveiling turbo codes: Some results on paralleI concatenated coding aschemes, IEEE Trans. Inform. Theory, vol. 42, March 1996
• [18] Benedetto S., Divsalar D., Montorsi G., Pollara F.: Algorithm for continuous decoding ot turbo-codes, Electronic Lett., vol. 32, No.4, Feb. 1996
• [19] Benedetto S., Garello R., Montorsi G.: A search tor good convolutional codes to be used in construction ot turbo codes, IEEE Trans. on Communications, vol.46, NO.9, September 1998
• [20] Berrou C., Glavieux A.: Near optimum error correcting coding and decoding turbo codes, IEEE Trans. on Communications, vol. 44, No.10, October 1996
• [21] Blackert W., Hall E. K., Wilson S. G.: Turbo code termination and interleaver conditions, Electron. Lett., vol. 32, NO.5, Februar 1996.
• [22] Divlsalar D., Pollara F.: On the design ot turbo codes, TDA Progress Report, 42-123, Nov.1995
• [23] Divlsalar D., Pollara F.: Turbo codes tor deep space communications, TDA Progress Report, 42-120, Feb.1995
• [24] Divsalar D., McEliece R. J.: Effective free distance of turbo codes, Electron. Lett., vol. 31, No. 24, November 199
• [25] Dolinar S., Divsalar D.: Weight distribution ot turbo codes using random and nonrandom permutations, TDA Progress Rep., 42-120, Jet Propulsion Lab., Pasadena, Ca., May 15, 1995
• [26] Duman T. M., Salehi M.: New performance bounds for turbo codes, IEEE Trans. on Communications, vol.46, No. 11, Nov. 1998
• [27] Hahn S., Jarkowski J.: Analiza możliwości wykorzystania zakresu częstotliwości 150 kHz - 30 MHz dla potrzeb radiofonii cyfrowej, Etap III .Podstawy teoretyczne transmisji cyfrowej w zakresie częstotliwości 150 kHz - 30 MHz, Politechnika Warszawska, Instytut Radioelektroniki, 1998
• [28] Hall E. K., Wilson S. G.: Design and analysis ot turbo codes on Rayleigh tading channels, IEEE Journal on Selected Areas in Communications, Vol.16, No. 2, February 1998
• [29] Herzog R., Schmidbauer A. and Hagenauer J.: Iterative decoding and despreading improves CDMA Systems using M-ary orthogonal modulation and FEC, Proc. 1997 IEEE Int. Conf. on Communications (ICC'97). Montreal, Que., Canada, June 1997
• [30] Marsland I. D., Mathiopoulos P. T.: Multiple differential detection ot paralleI concatenated convolutional (turbo) codes in correlated tast Rayleigh tading, IEEE Journal on Selected Areas in Communications, Vol.16, No.2, February 1998
• [31] McEliece R. J., MacKay D. J.C., Cheng J. F.: Turbo decoding as an instance ot Pearl's Algorithm, IEEE Journal on Selected Areas in Communications, Vo1.16, No. 2, February 1998
• [32] Narayana K. R., StOber G. L.: List decoding of turbo codes, IEEE Trans. on Communications, vol. 46, No. 6, June 1998
• [33] Narayanan K. R., Stuber G. L.: A serial concatenation approach to iterative demodulation and decoding, IEEE Trans. on Communications, vol. 47, No. 7, July 1999
• [34] Narayanan K. R., Stuber G. L.: Selective serial concatenation of turbo codes, IEEE Comm. Lett., vol. 1, Sept. 1997
• [35] Podemski R, Holubowicz W., Berrou C., and Battail G.: Hamming distance spectra of turbo codes, Annales des Telecommunications, vol. 50, Sept.-Oct. 1997
• [36] Pyndiah R M.: Near-optimum decoding of product codes: Block turbo codes, IEEE Trans.on Communications, vol. 46, No.8, August 1998
• [37] Robertson P. T., Hoeher P., Villebrun E.: Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding, European Trans. on Telecommunication, vol.8, March-April, 1997.
• [38] Robertson P., T., Wörz T.: Bandwidth-Efficient turbo trellis-coded modulation using punctured component codes, IEEE Journal on Selected Areas in Communications, Vol. 16, No. 2, February 1998.
• [39] Ruscitto A., Biglieri E.: Joint source and channel coding using turbo codes over rings, IEEE Trans. on Communications, vol. 46, No. 8, August 1998.
• [40] Ryan W.: A turbo code tutorial, http://www.ece.arizona.edu/~~ryan
• [41] Shao R. Y., Lin S., Fossorier P. C., Two simple stopping criteria for turbo decoding, IEEE Trans. on Comm., vol. 47, No. 8, Aug. 1999.
• [42] Sklar B.: A primer on turbo code concepts, IEEE Communications Magazine, vol. 35, N0.12, Dec.1997
• [43] Summers T.A: Wilson S. G., SNR mismatch and online estimation in turbo decoding, IEEE Trans. on Communications, vol. 46, No. 4, April 1998
• [44] Svirid Y. V.: Weight distributions and bounds for turbo codes European Trans. on Telecommunication, vol. 6, Sept.-Oct. 1995
• [45] Viterbi A.J., An intuitive justification and simplified implementation of the MAP decoder for convolutional codes, IEEE Journal on Selected Areas in Communications, Vol. 16, No. 2, February 1998
• [46] Yuan J., Vucetic B., Feng W.: Combined turbo codes and interleaver design, IEEE Trans. on Communications, vol. 47, No. 4, April1999.