S. A. Barbulescu and S. S. Pietrobon. Turbo Codes: A Tutorial on a New Class of Powerful Error Correcting Coding Schemes. Journal of Electrical and Electronics Engineering, Australia, 19(3):129--152, Sept. 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Near-Shannon-limit channel coding using woven convolutional codes - Ip, Lun (2000) (Correct)
....SNR is very low, or low power consumption is required or desirable. In this chapter, we aim to provide a simple introduction to the construction and design of turbo coding schemes so that we may comparatively discuss turbo codes and WCCs in subsequent chapters. The interested reader is referred to [18, 19, 20] for a more thorough introduction to turbo codes. 3.1 Parallel concatenated codes The rst turbo codes were formed by parallel concatenation, and are called parallel concatenated convolutional codes (PCCCs) to distinguish them from the serially concatenated convolutional codes (SCCCs) that we ....
A. S. Barbulescu and S. S. Pietrobon, \Turbo codes: A tutorial on a new class of powerful error correcting coding schemes: Part 2: Decoder design and performance," Journal of Electrical and Electronics Engineering, Australia, vol. 19, pp. 143-152, Sept. 1999.
Near-Shannon-limit channel coding using woven convolutional codes - Ip, Lun (2000) (Correct)
....SNR is very low, or low power consumption is required or desirable. In this chapter, we aim to provide a simple introduction to the construction and design of turbo coding schemes so that we may comparatively discuss turbo codes and WCCs in subsequent chapters. The interested reader is referred to [18, 19, 20] for a more thorough introduction to turbo codes. 3.1 Parallel concatenated codes The rst turbo codes were formed by parallel concatenation, and are called parallel concatenated convolutional codes (PCCCs) to distinguish them from the serially concatenated convolutional codes (SCCCs) that we ....
....designed to combat the problem of weight 2 input sequences producing low weight output sequences in PCCCs, results in inferior performance to pseudo random permutations. It should, however, be noted that interleavers have been designed that outperform pseudo random interleaving in certain regimes [18]. 3.3.3 Uniform interleavers Consider an input sequence of length T and weight w. An uniform interleaver is a conceptual interleaver that maps the sequence to all its T w distinct permutations with equal probability, 1= T w . For example, the input sequence, 0101, is mapped to the ....
A. S. Barbulescu and S. S. Pietrobon, \Turbo codes: A tutorial on a new class of powerful error correcting coding schemes: Part 1: Code structure and interleaver design," Journal of Electrical and Electronics Engineering, Australia, vol. 19, pp. 129-142, Sept. 1999.
Communication Centric Architectures for Turbo-Decoding on - Embedded Multiprocessors.. (2003) (Correct)
No context found.
S. A. Barbulescu and S. S. Pietrobon. Turbo Codes: A Tutorial on a New Class of Powerful Error Correcting Coding Schemes. Journal of Electrical and Electronics Engineering, Australia, 19(3):129--152, Sept. 1999.
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