Results 291 to 300 of about 86,909 (315)
Some of the next articles are maybe not open access.
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.
Thomas Richardson, R. Urbanke
openaire +2 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.
Thomas Richardson, R. Urbanke
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 +2 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 +2 more sources
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 +2 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 ...
openaire +2 more sources
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 +3 more
openaire +2 more sources
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 +3 more
openaire +2 more sources
Turbo Codes and Turbo Equalization
2000Turbo 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
On the performance of turbo codes [PDF]
IEEE Military Communications Conference. Proceedings. MILCOM 98 (Cat. No.98CH36201), 2002 The performance of the turbo code is sensitive to its code structure, which is made up of code rate, constraint length, tap connection, block size, interleaving pattern and number of decoding iterations. In this paper, mitigation techniques that can lower the error floor are adopted in both encoder and decoder.
openaire +1 more source
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 +2 more sources
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 +2 more sources
Performance Comparison of Punctured Turbo Codes and Multi Binary Turbo Codes
2007 International Symposium on Signals, Circuits and Systems, 2007In this paper we analyze the performance of punctured turbo codes (TCs) and punctured multi binary turbo codes (MBTCs) over additive white Gaussian noise (AWGN) channel in terms of Bit Error Rate (BER) and Frame Error Rate (FER). We consider the original TCs that consist of the parallel concatenation of two identical rate 1/2 recursive systematic ...
M.M. Nafornita +3 more
openaire +2 more sources
IEEE Transactions on Communications, 2001
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 turbo code.
openaire +2 more sources
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 turbo code.
openaire +2 more sources