Results 311 to 320 of about 2,501,833 (347)

On the ensemble performance of turbo codes

Proceedings of IEEE International Symposium on Information Theory, 2002
We 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

Comparison of Turbo-Code Decoders Applied to Short Frame Transmission Systems

IEEE J. Sel. Areas Commun., 1996
A novel class of binary parallel concatenated recursive systematic convolutional codes termed turbo-codes, having amazing error correcting capabilities, has previously been proposed.
P. Jung
semanticscholar   +1 more source

A turbo code interleaver design criterion based on the performance of iterative decoding

IEEE Communications Letters, 2001
The performance of a turbo code is dependent on two code properties: its distance spectrum and its suitability to be iteratively decoded. Both these properties are influenced by the choice of interleaver used in the turbo encoder.
J. Hokfelt, O. Edfors, T. Maseng
semanticscholar   +1 more source

Turbo Codes

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

Multifold turbo codes

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., Xu, J., Lin, Shu, Honary, Bahram   +3 more
openaire   +3 more sources

Reconstruction of turbo-code encoders

SPIE Defense + Commercial Sensing, 2005
Turbo-code encoders are one of the spreadest family of error correcting codes used in the communication's world, especially in space transmissions. This paper presents an efficient technique to reconstruct turbo-code encoders which allows a passive ...
Johann Barbier
semanticscholar   +1 more source

Turbo Codes and Turbo Equalization

2000
Turbo codes, introduced by Berrou, et al.[Berrou et al., 1993] in 1993, provide large coding gain for the memoryless additive white Gaussian noise (AWGN) channel and bring the system performance to within 1 dB from the Shannon capacity limit [Shannon, 1948]. The superior performance soon caused turbo codes to receive intense study.
openaire   +2 more sources

Turbo code at 0.03 dB from capacity limit

Proceedings IEEE International Symposium on Information Theory,, 2002
We propose a rate 1/3 infinite-length irregular turbo code capable of achieving an error rate P/sub eb/=10/sup -5/ at signal-to-noise ratio E/sub b//N/sub 0/=-0.46 dB, which is at distance 0.03 dB from Shannon capacity limit. Our turbo code is derived by
J. Boutros, G. Caire, E. Viterbo, H. Sawaya, S. Vialle   +4 more
semanticscholar   +1 more source

Asymmetric turbo-codes

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.M. Collins, Daniel J. Costello, O.Y. Takeshita, P.C. Massey   +3 more
openaire   +2 more sources

Punctured turbo code ensembles

Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), 2003
We analyze the asymptotic performance of punctured turbo codes. The analysis is based on the union bound on the word error probability of maximum likelihood decoding for punctured turbo code ensembles averaged over all possible puncturing patterns and ...
Ruoheng Liu, P. Spasojevic, E. Soljanin
semanticscholar   +1 more source