Results 161 to 170 of about 19,347 (198)

Optimality and Duality of the Turbo Decoder

Proceedings of the IEEE, 2007
The near-optimal performance of the turbo decoder has been a source of intrigue among communications engineers and information theorists, given its ad hoc origins that were seemingly disconnected from optimization theory. Naturally one would inquire whether the favorable performance might be explained by characterizing the turbo decoder via some ...
Phillip A. Regalia, John MacLaren Walsh
openaire   +1 more source

Convergence and errors in turbo-decoding

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2001
Summary: Turbo-codes are decoded using iterative decoding algorithms with somewhat elusive convergence properties. In this paper, the modes of convergence observed in an extensive series of turbo-code simulations are categorized by examining the bit convergence behavior for each frame.
Andrew C. Reid, T. Aaron Gulliver, Desmond P. Taylor   +2 more
openaire   +1 more source

On turbo decoding of nonbinary codes

IEEE Communications Letters, 1998
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for nonbinary block and convolutional codes over an extension field GF(p/sup a/) are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more efficient for high-rate codes.
openaire   +1 more source

Turbo decoders for Markov channels

IEEE Communications Letters, 1998
We present a decoder for parallel concatenated codes that incorporates a binary-input binary-output Markov channel model, thereby allowing the receiver to utilize the statistical structure of the channel during the decoding process. These decoders can enable reliable communication at rates which are above the capacity of a memoryless channel with the ...
Javier Garcia-Frías, John D. Villasenor
openaire   +1 more source

Turbo decoding for generalized channels

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04., 2005
We propose a turbo decoding framework in the presence of insertions and deletions as well as substitutions in the received sequence. The decoding algorithm is based on the Viterbi algorithm for this special channel. The synchronization information is exchanged between decoders in the proposed structure and extrinsic information is used, as is commonly ...
Mohamed F. Mansour, Ahmed H. Tewfik
openaire   +1 more source

Decoding metrics and their applications in VLSI turbo decoders

2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100), 2002
In this paper, a set of variables which can be easily computed in the course of iterative decoding of turbo decoders called decoding metrics (DMs) are introduced. According to the measured DMs after each iteration, a lot of information other than signal-to-noise ratio (SNR) in the received bits, such as how good/bad the current block is and how close ...
Zhongfeng Wang 0001, Keshab K. Parhi
openaire   +1 more source

Stochastic models for turbo decoding

IEEE International Conference on Communications, 2005. ICC 2005. 2005, 2005
This paper proposes a stochastic framework for modelling and analysis of turbo decoding. By modelling the input and output signals of a turbo decoder as random processes, we prove that these signals become ergodic when the code block size becomes very large.
openaire   +1 more source

Interative (“turbo”) decoding of threshold decodable codes

European Transactions on Telecommunications, 1995
AbstractIn this paper we extend the idea of iterative decoding of two‐dimensional systematic convolutional codes ‐ so‐called “turbo” codes ‐ to threshold decoding. A threshold decoding algorithm is presented which uses soft information from the channel and a priori values in order to generate soft outputs.
Sven Riedel, Yuri V. Svirid
openaire   +1 more source

Turbo STFC decoding with the Zero Forcing decoder

IEEE Africon '11, 2011
In this paper, a method for the joint decoding of a MIMO system using apriori information in conjunction with the Zero-Forcing decoder is presented. The proposed method is compared with an existing method based on receive vector translation. It is shown that both methods perform similarly in the case of the Zero-Forcing decoder.
Philip R. Botha, Bodhaswar T. Maharaj
openaire   +1 more source

Improvements in Turbo Decoding

IETE Journal of Research, 2002
In recent years iterative concatenated decoding has regained popularity starting with the remarkable results presented in a paper by a group of French researchers. They introduced a new family of convolutional codes, nicknamed "Turbo codes" due to its resemblance with the turbo engine.
Bhuwanendra Kumar, Vishwanath Sinha
openaire   +1 more source