Results 131 to 140 of about 861 (178)
Some of the next articles are maybe not open access.
IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211), 2002
Recently, turbo code has gathered much attention for its outstanding performance. However, its complexity and decoding latency are severe drawbacks. Turbo code has been adopted in the 3GPP specification as one of the channel coding schemes. To implement a turbo decoder compliant with the 3GPP specification, the author adopted the sliding window method ...
openaire +1 more source
Recently, turbo code has gathered much attention for its outstanding performance. However, its complexity and decoding latency are severe drawbacks. Turbo code has been adopted in the 3GPP specification as one of the channel coding schemes. To implement a turbo decoder compliant with the 3GPP specification, the author adopted the sliding window method ...
openaire +1 more source
On allocation of turbo decoder iterations
14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003., 2004The computational requirements of turbo decoders are heavy and depend on the number of decoding iterations. However, only a few iterations are often enough for obtaining an error free outcome. Instead of idling during the unused iterations, the released time slots can be used for enabling extra iterations required by the decoding, when the errors are ...
Perttu Salmela +3 more
openaire +1 more source
Energy-efficient turbo decoder
IEEE International Conference on Acoustics Speech and Signal Processing, 2002Turbo codes have been recently adopted in the next generation of wideband CDMA standards. These codes achieve superior performance at the expense of high computational complexity. This makes their low energy implementation a very important yet challenging problem.
Jagadeesh Kaza, Chaitali Chakrabarti
openaire +1 more source
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
Optimality and Duality of the Turbo Decoder
Proceedings of the IEEE, 2007The 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
On List Sequence Turbo Decoding
IEEE Transactions on Communications, 2005An algorithm for decoding Turbo codes that combines conventional Turbo decoding and list sequence maximum a posteriori probability decoding is presented and evaluated. Compared to previous results on this theme, performance improvements in the order of 0.7 dB are obtained for Turbo codes with 514-b pseudorandom interleaving at a frame error rate of 10 ...
Carl Fredrik Leanderson +1 more
openaire +1 more source
Convergence and errors in turbo-decoding
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2001Summary: 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 +2 more
openaire +1 more source
On turbo decoding of nonbinary codes
IEEE Communications Letters, 1998Symbol-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, 1998We 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
Decoding metrics and their applications in VLSI turbo decoders
2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100), 2002In 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