Results 201 to 210 of about 17,219 (249)
Some of the next articles are maybe not open access.
A note on asymmetric turbo-codes
IEEE Communications Letters, 1999Little attention has been devoted in the literature to turbo-codes with nonidentical component codes. However, in order to optimize the performance of parallel concatenated schemes with respect to both the so called "error-floor" and the "waterfall" regions, the idea has certain advantages.
Oscar Y. Takeshita +3 more
openaire +1 more source
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
VLSI architectures for turbo codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1999A great interest has been gained in recent years by a new error-correcting code technique, known as "turbo coding", which has been proven to offer performance closer to the Shannon's limit than traditional concatenated codes. In this paper, several very large scale integration (VLSI) architectures suitable for turbo decoder implementation are proposed ...
MASERA, Guido +3 more
openaire +2 more sources
IEEE Communications Letters, 1999
We present a new turbo-coding method which parses the input block into n-bit symbols and interleaves on a symbol-by-symbol basis. This is used in conjunction with different modulation techniques to take advantage of tradeoffs between bit error rate performance, code-rate, spectral efficiency, and decoder complexity.
Mark Bingeman, Amir K. Khandani
openaire +1 more source
We present a new turbo-coding method which parses the input block into n-bit symbols and interleaves on a symbol-by-symbol basis. This is used in conjunction with different modulation techniques to take advantage of tradeoffs between bit error rate performance, code-rate, spectral efficiency, and decoder complexity.
Mark Bingeman, Amir K. Khandani
openaire +1 more source
IEEE Communications Letters, 2007
Decoding delay is an important consideration for the use of turbo codes in practical applications. We propose a new structure for turbo codes which is very suitable for parallel decoding. It is shown by union bound analysis and simulation results that the proposed system performance is comparable to that of the classical turbo ...
Orhan Gazi, Ali Özgür Yilmaz
openaire +1 more source
Decoding delay is an important consideration for the use of turbo codes in practical applications. We propose a new structure for turbo codes which is very suitable for parallel decoding. It is shown by union bound analysis and simulation results that the proposed system performance is comparable to that of the classical turbo ...
Orhan Gazi, Ali Özgür Yilmaz
openaire +1 more source
Performance analysis of turbo codes
Proceedings of MILCOM '95, 2002We apply transfer function bounding techniques to obtain upper bounds on the bit error rate for maximum likelihood decoding of turbo codes constructed with random permutations. These techniques are applied to two turbo codes with constraint length 3 and later extended to other codes. The performance predicted by these bounds is compared with simulation
Divsalar, D. +3 more
openaire +2 more sources
IEEE Transactions on Communications, 1998
Summary: List decoding of turbo codes is analyzed under the assumption of a maximum-likelihood (ML) list decoder. It is shown that large asymptotic gains can be achieved on both the additive white Gaussian noise and fully interleaved flat Rayleigh-fading channels. It is also shown that the relative asymptotic gains for turbo codes are larger than those
Krishna R. Narayanan, Gordon L. Stüber
openaire +1 more source
Summary: List decoding of turbo codes is analyzed under the assumption of a maximum-likelihood (ML) list decoder. It is shown that large asymptotic gains can be achieved on both the additive white Gaussian noise and fully interleaved flat Rayleigh-fading channels. It is also shown that the relative asymptotic gains for turbo codes are larger than those
Krishna R. Narayanan, Gordon L. Stüber
openaire +1 more source
IEEE Communications Letters, 2004
Turbo codes typically utilize time-invariant component codes whose total encoder memory is no greater than 4. In this letter, turbo codes with time-varying component codes are studied via EXIT analysis, distance spectrum analysis and simulation. Turbo codes with time-varying component codes and memory 6 are shown to have similar performance in the ...
Fan Jiang +2 more
openaire +1 more source
Turbo codes typically utilize time-invariant component codes whose total encoder memory is no greater than 4. In this letter, turbo codes with time-varying component codes are studied via EXIT analysis, distance spectrum analysis and simulation. Turbo codes with time-varying component codes and memory 6 are shown to have similar performance in the ...
Fan Jiang +2 more
openaire +1 more source