Main Project on Design of LTE Turbo Encoder

By: P.Kavithapriya N.Reshma S.V.Sandhya T.Nagaswetha M.B.Devika

INTRODUCTION

AIMS AND OBJECTIVES An attempt to provide an in-depth study on performance of 3GPP-LTE Turbo encoder design with Quadratic Permutational polynomial interleaver and related issues are presented and explained which includes specifications of LTE.
SCOPE OF THE PROJECT This document describes the high level architecture of turbo encoder as per the 3GPP LTE specifications version 36212-820

Channel Coding: The task of channel coding is to encode the information sent over a communication channel in such a way that in the presence of channel noise, errors can be detected and/or corrected. Backward error correction (BEC): requires only error detection if an error is detected, the sender is requested to retransmit the message Forward error correction (FEC): requires that the decoder should also be capable of correcting a certain number of errors, i.e. it should be capable of locating the positions where the errors occurred. Since FEC codes require only simplex communication, they are especially attractive in wireless communication systems, helping to improve the energy efficiency of the system.

TURBO ENCODER

TURBO ENCODER
The two encoders used are normally identical

The code is in a systematic form, i.e. the input bits also

occur in the output The interleaver reads the bits in a pseudo-random order. Turbocode: A turbo code is formed from the parallel concatenation of two codes separated by an interleaver.

PIN DIAGRAM OF TURBO ENCODER

SYSTEMATIC_1 CLOCK SYSTEMATIC_2 RESET PARITY_1 DATA_IN TURBO ENCODER PARITY_2

BLOCK_SIZE(12:0)

DATA_VALID_1 DATA_VALID_2

ENCODER_EN READY

Structure of 1/3 turbo encoder

xk

1st constituent encoder

zk

ck

Output
Input

Turbo code internal interleaver

Output

2nd constituent encoder

z k

ck

xk

TYPES OF CODING
Block coding: Block codes operate on a block of bits. Using a preset algorithm, we take a group of bits and add a coded part to make a larger block. This block is checked at the receiver. The receiver then makes a decision about the validity of the received sequence. Convolution coding: codes differ from the block codes in the sense that they do not break the message stream into fixed size blocks. Instead redundancy is added continuously to the whole stream. The encoder keeps M previous bits in the memory. Each output bit of the encoder depends on the input bits as well as M stored bits

INTERLEVER
The task of the interlayer is to scramble bits in a pseudo-random, albeit predetermined fashion. This serves two purposes. Firstly, if the input to the second encoder is interleaved, its output is usually quite different from the output of the first encoder. Secondly, since the code is a parallel concatenation of two codes, the divide-and-conquer strategy can be employed for decoding. If the input to the second decoder is scrambled, also its output will be different, or uncorrelated from the output of the first encoder. This means that the corresponding two decoders will gain more from information exchange.

TYPES OF INTER LEVER

A helical interlever: data is written row-wise and read

diagonally. A row-column interlever: data is written row-wise and read column- wise. While very simple, it also provides little randomness. An odd-even interlever: first, the bits are left uninterleaved and en- coded, but only the odd-positioned coded bits are stored. Then, the bits are scrambled and encoded, but now only the even-positioned coded bits are stored. Odd-even encoders can be used, when the second encoder produces one output bit per one input bit. A pseudo-random interlever defined by a pseudo-random number generator or a look-up table.

PARTS OF INTERLEVER
Interlever consists of:

Memoryunit
Control unit Look up table(LUT)

Address generator

 Lookup tables :are also used extensively to

validate input values by matching against a list of valid (or invalid) items in an array and, in some programming languages, may include pointer functions (or offsets to label Memory unit: (storage unit), a unit of a computer or an independent device designed to record, store, and reproduce informations to process the matching input.

 Data Address Generator :

(DAG) The mechanism which generates temporary memory addresses for data that is transferred between memory and registers in a Digital Signal Processor. Control unit:The control unit is the circuitry that controls the flow of data through the processor, and coordinates the activities of the other units within it The outputs of the control unit control the activity of the rest of the device.

APPLICATIONS

Mobile radio:
For applications where delay vs. performance is crucial,

turbo codes offer a wide trade-off space at decoder complexities equal to or better than conventional concatenated code performance. The major benefit is that such systems can work with smaller constraint-length convolution encoders.

Satellite communication and deep space communications:

Turbo codes are used for deep-space applications. Low

power design is important for many communication satellites that orbit closer to earth. Turbo codes can be used in such applications. Many of these satellites are equipped with programmable FECs using turbo codes.

Military applications:
The natural applicability of turbo codes to spread-spectrum

systems provides increased opportunity for anti-jam and low probability of intercept (LPI) communications. WLAN: Turbo codes can increase the performance of a WLAN over traditional convolution Coding techniques. The resulting benefits to the WLAN system are that it requires less power, or it can transmit over a greater coverage area. Turbo code solution is used to Reduce power and boost performance in the transmit portion of mobile devices in a Wireless local area network (WLAN).

Conclusion
Turbo codes are a recent development in the field of

forward-error-correction channel coding. The codes make use of three simple ideas: parallel concatenation of codes to allow simpler decoding; interleaving to provide better weight distribution; and soft decoding to enhance decoder decisions and maximize the gain from decoder interaction.