Results 291 to 300 of about 2,554,253 (371)
Some of the next articles are maybe not open access.

Turbo-Like Codes Constructions

2014
This 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

Chaotic turbo codes

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

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.   +3 more
openaire   +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.Y. Takeshita   +3 more
openaire   +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   +1 more source

Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1

IEEE International Conference on Communications, 1993
C. Berrou, A. Glavieux, P. Thitimajshima
semanticscholar   +1 more source

Turbo-SPC codes

IEEE Transactions on Communications, 2001
Summary: This letter is concerned with a family of modified turbo-type codes, referred to as turbo-SPC (single parity check) codes. A technique based on the SPC code is introduced to replace puncturing for rate adjustment. A noticeable feature of the proposed scheme is the significantly reduced decoding complexity compared with the standard punctured ...
openaire   +2 more sources

Turbo coded BLAST

Proceedings of the IEEE Information Theory Workshop, 2003
In this paper we investigate turbo coding for BLAST (Bell Labs layered space-time) by encoding single user data streams and transmitting the symbols in different antennas. At the receiver we adopt an MMSE nulling, incremental decoding and soft cancellation approach to decode the symbols.
openaire   +1 more source

Codes and Turbo Codes

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 ...
openaire   +1 more source

Home - About - Disclaimer - Privacy