Results 161 to 170 of about 19,018 (206)
Some of the next articles are maybe not open access.
Journal of Semiconductors, 2015
This paper presents a turbo decoder supporting all 188 block sizes in 3GPP long term evolution (LTE) standard which can be employed in the LTE micro-eNodB system. The design allows 1, 2, 4, 8 or 16 soft-in/soft-out (SISO) decoders to concurrently process each block size, and the number of iterations can be adjusted.
Le Yang +3 more
openaire +1 more source
This paper presents a turbo decoder supporting all 188 block sizes in 3GPP long term evolution (LTE) standard which can be employed in the LTE micro-eNodB system. The design allows 1, 2, 4, 8 or 16 soft-in/soft-out (SISO) decoders to concurrently process each block size, and the number of iterations can be adjusted.
Le Yang +3 more
openaire +1 more source
Improvements in Turbo Decoding
IETE Journal of Research, 2002In 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
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
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, A. Ylmaz
openaire +1 more source
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, A. Ylmaz
openaire +1 more source
2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528), 2002
The very powerful turbo codes are a breakthrough in coding theory. The implementation of the iterative turbo decoder however hampers their incorporation in real systems. We tackle this problem by optimizing the decoder on two levels: the separate decoder modules and the global decoder system.
C. Schurgers, F. Catthoor, M. Engels
openaire +1 more source
The very powerful turbo codes are a breakthrough in coding theory. The implementation of the iterative turbo decoder however hampers their incorporation in real systems. We tackle this problem by optimizing the decoder on two levels: the separate decoder modules and the global decoder system.
C. Schurgers, F. Catthoor, M. Engels
openaire +1 more source
Interative (“turbo”) decoding of threshold decodable codes
European Transactions on Telecommunications, 1995AbstractIn 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
Adaptive Iterative Turbo Decoding Algorithm
2006 IEEE 63rd Vehicular Technology Conference, 2006Turbo decoding has large iteration delay. Based on tail bits of turbo codes, a low-complexity adaptive iterative decoder is proposed for turbo codes in this paper. In the proposed algorithm, tail bits work as CRC bits to detect whether the decoding succeeds or not.
null Jian Gu +3 more
openaire +1 more source
Interleaver for High Parallelizable Turbo Decoder
2007In this paper a new interleaver is proposed as turbo codes intern interleaver. This interleaver designed from shifted identity matrices has been developed to facilitate implementation of parallelized turbo decoding. The structure is first illustrated and then, implementation aspects are discussed.
Boher, Laurent +3 more
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 ...
H. Michel, N. Wehn
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 ...
U. Dasgupta, C.N. Georghiades
openaire +1 more source