Results 181 to 190 of about 156,275 (208)
2008 International Symposium on Information Theory and Its Applications, 2008 As implied by previous studies, there exists a fundamental trade-off between the minimum distance and the iterative decoding convergence behavior of a turbo code. While capacity achieving code ensembles typically are asymptotically bad in the sense that their minimum distance does not grow linearly with block length and they therefore exhibit an error ...
Daniel J. Costello +4 more
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2010
This book is devoted to one of the essential functions of modern telecommunications systems: channel coding or error correction coding. Its main topic is iteratively decoded algebraic codes, convolutional codes and concatenated codes. It also presents digital modulation with which channel coding is closely associated to make up the heart of the ...
Berrou, Claude +17 more
openaire +4 more sources
This book is devoted to one of the essential functions of modern telecommunications systems: channel coding or error correction coding. Its main topic is iteratively decoded algebraic codes, convolutional codes and concatenated codes. It also presents digital modulation with which channel coding is closely associated to make up the heart of the ...
Berrou, Claude +17 more
openaire +4 more sources
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
In this paper we introduce a new coding scheme - so-called laminated turbo codes. It is characterized by a block-convolutional structure that enables us to combine the advantages of a convolutional encoder memory and a block-oriented decoding method. We show that this block-convolutional structure is superior in terms of its error correction capability
Huebner, A. +3 more
openaire +3 more sources
In this paper we introduce a new coding scheme - so-called laminated turbo codes. It is characterized by a block-convolutional structure that enables us to combine the advantages of a convolutional encoder memory and a block-oriented decoding method. We show that this block-convolutional structure is superior in terms of its error correction capability
Huebner, A. +3 more
openaire +3 more sources
1999 Information Theory and Networking Workshop (Cat. No.99EX371), 2003
Random coding applied to blocks of size k offers minimum distances as large as k/4 roughly, but is not decodable in practice. We propose a decodable multidimensional extension of classical two-dimensional turbo codes, giving minimum distances comparable to those of random codes.
Berrou, Claude +2 more
openaire +3 more sources
Random coding applied to blocks of size k offers minimum distances as large as k/4 roughly, but is not decodable in practice. We propose a decodable multidimensional extension of classical two-dimensional turbo codes, giving minimum distances comparable to those of random codes.
Berrou, Claude +2 more
openaire +3 more sources
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002
We prove the existence of thresholds for turbo codes and we prove concentration of the performance of turbo codes within the ensemble determined by the random interleaver. In effect, we show that the results obtained for low-density parity-check codes extend to turbo codes.
Richardson, T., Urbanke, R.
openaire +3 more sources
We prove the existence of thresholds for turbo codes and we prove concentration of the performance of turbo codes within the ensemble determined by the random interleaver. In effect, we show that the results obtained for low-density parity-check codes extend to turbo codes.
Richardson, T., Urbanke, R.
openaire +3 more sources
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002
This paper describes a new class of codes, chaotic turbo codes. They were born from a symbiosis between a chaotic digital encoder and a turbo code. This paper investigates the most important properties of both chaotic digital encoders and turbo encoders in order to understand how the two complement each other.
A. Guidi +2 more
openaire +2 more sources
This paper describes a new class of codes, chaotic turbo codes. They were born from a symbiosis between a chaotic digital encoder and a turbo code. This paper investigates the most important properties of both chaotic digital encoders and turbo encoders in order to understand how the two complement each other.
A. Guidi +2 more
openaire +2 more sources
Proceedings of MILCOM '95, 2002
We introduce multiple turbo codes and a suitable decoder structure derived from an approximation to the maximum a posteriori probability (MAP) decision rule, which is substantially different from the decoder for two-code-based encoders. We developed new rate 1/3 and 2/3 constituent codes to be used in the turbo encoder structure.
Dariush Divsalar, F. Pollara
openaire +2 more sources
We introduce multiple turbo codes and a suitable decoder structure derived from an approximation to the maximum a posteriori probability (MAP) decision rule, which is substantially different from the decoder for two-code-based encoders. We developed new rate 1/3 and 2/3 constituent codes to be used in the turbo encoder structure.
Dariush Divsalar, F. Pollara
openaire +2 more sources
On the ensemble performance of turbo codes
Proceedings of IEEE International Symposium on Information Theory, 2002We derive the ensemble weight enumeration function of turbo-codes, where the ensemble is generated by a uniform choice over the interleaver and a uniform choice over the component codes from the set of time-varying recursive convolutional codes. This reduces the study of the performance of turbo-codes to a two parameter family, namely the interleaving ...
Telatar, E., Urbanke, R.
openaire +2 more sources
2004
Publisher Summary This chapter deals with turbo codes, one of the most powerful types of forward-error-correcting channel codes. It discusses the underlying concepts and presents a description and comparison of the turbo codes used by the Universal Mobile Telecommunications System (UMTS) and cdma2000 third-generation cellular systems.
Jian Sun, Matthew C. Valenti
openaire +2 more sources
Publisher Summary This chapter deals with turbo codes, one of the most powerful types of forward-error-correcting channel codes. It discusses the underlying concepts and presents a description and comparison of the turbo codes used by the Universal Mobile Telecommunications System (UMTS) and cdma2000 third-generation cellular systems.
Jian Sun, Matthew C. Valenti
openaire +2 more sources
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2002
The multifold turbo coding, designed to provide multiple extrinsic estimates and LLRs on a bit basis during decoding iterations, is introduced. Component encoders accept various combinations of information segments, which are obtained by equally dividing the information block prior to encoding.
Tanriover, Cagri C. +3 more
openaire +3 more sources
The multifold turbo coding, designed to provide multiple extrinsic estimates and LLRs on a bit basis during decoding iterations, is introduced. Component encoders accept various combinations of information segments, which are obtained by equally dividing the information block prior to encoding.
Tanriover, Cagri C. +3 more
openaire +3 more sources