C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error control-correcting coding and decoding: Turbo-codes (1). In Proc. IEEE International Conference on Communications, pages 1064-- 1070, Geneva, Switzerland, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....estimation, unequal error protection, BCJR algorithm. B. Mielczarek and A.Svensson are with the Communication Systems Group, Department of Signals and Systems, Chalmers University of Technology, 412 96 G oteborg, Sweden. E mail: Bartosz. Mielczarek s2.chalmers.se 1 Introduction Turbo codes [1] are one of the most interesting coding techniques for very noisy channels. Their exceptional performance allows to transmit the signal with very low energy per information bit which is one of the most crucial demands for future mobile wireless systems. To fully exploit the exceptional properties ....

C. Berrou, A. Glavieux, and P. Thitimajshima, \Near Shannon limit error control-correcting coding and decoding: Turbo-codes (1)," in Proc. IEEE International Conference on Communications, Geneva, Switzerland, 1993, pp. 1064{ 1070.

....deep space communications (see e.g. 1, p. 434] but has also been reported for use in cellular communications [2] The drawbacks of this solution are the increased bandwidth induced bythetwo codes which both add redundancy, and a complex receiver since twocodes need to be decoded. Turbo coding [3] is also a strong candidate, with possible support for rate compatibility [4] Furthermore, it achieves avery low bit error rate at low signal to noise ratios. However, Turbo codes using convolutional codes have an error oor feature which is related to the interleaver size [5] and it is possible ....

C. Berrou, A. Glavieux, and P. Thitimajshima, \Near Shannon limit error controlcorrecting coding and decoding: Turbo-codes (1)," in ##### #### ############# ####### #### ## ##############, Geneva, Switzerland, May 1993, pp. 1064-1070. 15

....on using very low transmitted signal power. This requirement creates the necessity of using very powerful codes, capable of operating under such difficult conditions. One of the most interesting solutions is turbo coding, a new approach to channel coding introduced in 1993 by Berrou et al. in [1]. Turbo codes are capable of operating very close to the Shannon channel capacity limit. Unfortunately, the very operating region of turbo codes renders the synchronization of the signal difficult since the quality of the estimates decreases with the low signal to noise power ratio. Therefore, any ....

C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error controlcorrecting coding and decoding: Turbo-codes (1)," in Proc. IEEE International Conference on Communications, Geneva, Switzerland, 1993, pp. 1064--1070.

....transmission applications usually employ different block lengths and code structures to adapt to changing parameters of a channel. If the fading channel quality decreases, for example, the problem can be counteracted by sending shorter blocks and or decreasing the rate of the code. Turbo codes [1] are one of the most promising coding techniques for very noisy channels. Their exceptional performance allows transmitting the signal with very low power which is one of the most crucial demands in future mobile systems. The main problem with turbo codes is that they demand rather long packets to ....

C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error control-correcting coding and decoding: Turbocodes (1). In Proc. IEEE International Conference on Communications, pages 1064--1070, Geneva, Switzerland, 1993.

....code. For convolutional codes, soft decision decoding comes naturally using a soft metric in the Viterbi decoder, and the use of rate compatible convolutional (RCC) codes makes it possible to apply the same decoder for all code rates within the family. Other coding schemes such as turbo coding [9] exist. However, for turbo codes to perform well a large interleaver is needed, and therefore it is difficult to use turbo codes for delay sensitive services. Furthermore, the high complexity in decoding turbo codes may be prohibitive. Another possible coding decoding scheme is long constraint ....

C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error control-correcting coding and decoding: Turbo-codes (1)," Geneva, Switzerland, 1993, pp. 1064--1070.

....code. For convolutional codes, softdecision decoding comes naturally using a soft metric in the Viterbi decoder, and the use of rate compatible convolutional (RCC) codes makes it possible to apply the same decoder for all code rates within the family. Other coding schemes such as turbo coding [8] exist. However, for turbo codes to perform well a large interleaver is needed, and therefore it is difficult to use turbo codes for delay sensitive services. Furthermore, the high complexity in decoding turbo codes may be prohibitive. Another possible coding decoding scheme is long constraint ....

C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error control-correcting coding and decoding: Turbo-codes (1)," in Proc. IEEE International Conference on Communications, Geneva, Switzerland, 1993, pp. 1064--1070.

No context found.

C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error control-correcting coding and decoding: Turbo-codes (1). In Proc. IEEE International Conference on Communications, pages 1064-- 1070, Geneva, Switzerland, 1993.

No context found.

C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error control-correcting coding and decoding: Turbo-codes (1). In Proc. IEEE International Conference on Communications, pages 1064--1070, Geneva, Switzerland, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC