Results 151 to 160 of about 167,787 (204)
Comparative study of turbo decoding techniques: an overview
IEEE Transactions on Vehicular Technology, 2000 In this contribution, we provide an overview of the novel class of channel codes referred to as turbo codes, which have been shown to be capable of performing close to the Shannon Limit.
Lajos Hanzo
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 more
openaire +2 more sources
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 +2 more
openaire +2 more sources
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 +2 more sources
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 +2 more sources
Network-on-Chip for Turbo Decoders
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2016The 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 +3 more
openaire +3 more sources
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
Turbo decoding of quantized data
IEEE Transactions on Communications, 2002Much 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
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
Turbo-decoder quantization for UMTS
IEEE Communications Letters, 2001The 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
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