Results 101 to 110 of about 20,900 (152)
Some of the next articles are maybe not open access.
IEEE Transactions on Communications, 2005
In this paper, we introduce the concept of nonsystematic turbo codes and compare them with classical systematic turbo codes. Nonsystematic turbo codes can achieve lower error floors than systematic turbo codes because of their superior effective free distance properties.
Banerjee A. +3 more
openaire +3 more sources
In this paper, we introduce the concept of nonsystematic turbo codes and compare them with classical systematic turbo codes. Nonsystematic turbo codes can achieve lower error floors than systematic turbo codes because of their superior effective free distance properties.
Banerjee A. +3 more
openaire +3 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 +2 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 +2 more sources
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 ...
C. Koller +4 more
openaire +1 more source
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 ...
C. Koller +4 more
openaire +1 more source
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.
C. Berrou, M. Jezequel, C. Douillard
openaire +1 more source
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.
C. Berrou, M. Jezequel, C. Douillard
openaire +1 more source
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.
D. Divsalar, F. Pollara
openaire +1 more source
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.
D. Divsalar, F. Pollara
openaire +1 more source
Turbo-Like Codes Constructions
2014This chapter provides design, analysis, construction, and performance of the turbo codes, serially concatenated codes, and turbo-like codes including the design of interleavers in concatenation of codes. Also this chapter describes the iterative decoding algorithms for these codes.
BENEDETTO, Sergio +2 more
openaire +2 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.
S.A. Barbulescu +2 more
openaire +1 more source
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.
S.A. Barbulescu +2 more
openaire +1 more source
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 +1 more source
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 +1 more source
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 2002
This paper examines the performance of turbo-codes with non-identical component codes. We show that asymmetric turbo-codes provide good performance with respect to both the "error-floor" and the "pre-error-floor" regions of the bit error rate curve.
O.Y. Takeshita +3 more
openaire +1 more source
This paper examines the performance of turbo-codes with non-identical component codes. We show that asymmetric turbo-codes provide good performance with respect to both the "error-floor" and the "pre-error-floor" regions of the bit error rate curve.
O.Y. Takeshita +3 more
openaire +1 more source