Results 151 to 160 of about 19,347 (198)

Parallel Turbo decoding

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512), 2004
Turbo codes are one of the most powerful error correcting codes. The VLSI implementation of Turbo codes for higher decoding speed requires use of parallel architectures. This paper explores the design spaces of both serial and parallel MAP decoders using graphical analysis.
Yuping Zhang, Keshab K. Parhi
openaire   +1 more source

Noncoherent turbo decoding

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002
We propose a new turbo code noncoherent detection scheme based on a novel a-priori probability processor (APP). Using this method, many turbo encoders can be used without a change in the code or in the modulation, and without a significant change in the structure of the iterative decoder.
Jacob Vainappel, Einat Hardy, Dan Raphaeli   +2 more
openaire   +1 more source

Network-on-Chip for Turbo Decoders

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2016
The multi-application specific instruction processor (ASIP) architecture is a promising candidate for flexible high-throughput turbo decoders. This brief proposes a network-on-chip (NoC) structure for multi-ASIP turbo decoders. The process of turbo decoding is studied, and the addressing patterns for turbo codes in long term evolution (LTE) and High ...
Yang, Qingqing, Zhou, Xiaofang, Sobelman, Gerald Edward, Li, Xinxin   +3 more
openaire   +2 more sources

Turbo decoding of quantized data

IEEE Transactions on Communications, 2002
Much of the work on turbo decoding assumes that the decoder has access to infinitely soft (unquantized) channel data. In practice, however, a quantizer is used at the receiver and the turbo decoder must operate on finite precision, quantized data. Hence, the maximum a posteriori (MAP) component decoder which was designed assuming infinitely soft data ...
Udayan Dasgupta, Costas N. Georghiades
openaire   +1 more source

Turbo-decoder quantization for UMTS

IEEE Communications Letters, 2001
The use of turbo codes is proposed for high-rate data services in third generation wireless communication systems. Bit-true models are mandatory for hardware and software implementations. In this paper we present to the best of our knowledge the first investigation of a combined bit-width optimization of input data and internal data for an 8-state ...
Heiko Michel, Norbert Wehn
openaire   +1 more source

Fast Decodable Turbo Codes

IEEE Communications Letters, 2007
Decoding delay is an important consideration for the use of turbo codes in practical applications. We propose a new structure for turbo codes which is very suitable for parallel decoding. It is shown by union bound analysis and simulation results that the proposed system performance is comparable to that of the classical turbo ...
Orhan Gazi, Ali Özgür Yilmaz
openaire   +1 more source

Turbo decoder implementation

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

Energy-efficient turbo decoder

IEEE International Conference on Acoustics Speech and Signal Processing, 2002
Turbo 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

On allocation of turbo decoder iterations

14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003., 2004
The 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, Tuomas Järvinen, Teemu Sipilä, Jarmo Takala   +3 more
openaire   +1 more source

List decoding of turbo codes

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