TURBO-ENCO-XM-U3 datasheet, PDF

Datasheet> All Categories > semiconductor> Other integrated circuit (IC)> TURBO-ENCO-XM-U3

TURBO-ENCO-XM-U3: Descriptionencoders, decoders, multiplexers & Demultiplexers turbo encoder; Categorysemiconductor Other integrated circuit (IC); File Size249KB，22 Pages; ManufacturerAll Sensors; Environmental Compliance

Download Datasheet Parametric Compare View All

TURBO-ENCO-XM-U3 Online Shopping

Suppliers	Part Number	Price	MOQ	In stock
	TURBO-ENCO-XM-U3	-	-	View	Buy Now

TURBO-ENCO-XM-U3 Overview

encoders, decoders, multiplexers & Demultiplexers turbo encoder

TURBO-ENCO-XM-U3 Parametric

Parameter Name	Attribute value
Manufacture	Lattice
Product Category	Encoders, Decoders, Multiplexers & Demultiplexers
Factory Pack Quantity	1

Preview

Download Datasheet

View All

ispLever

CORE

Turbo Decoder

User’s Guide

November 2008

ipug14_04.4

Lattice Semiconductor

Turbo Decoder User’s Guide

Introduction

Lattice’s Turbo Decoder core provides an ideal solution that meets the needs of turbo decoding applications. The

core provides a customizable solution allowing turbo decoding of data in many system designs. This core allows

designers to focus on the application rather than the Turbo Decoder, resulting in a faster time to market.

Turbo coding is an advanced error correction technique widely used in the communications industry. The Turbo

Decoder IP Core from Lattice is compliant with three different standards: 3GPP, 3GPP2 and CCSDS. Lattice’s

Turbo Decoder core was developed in conjunction with Lattice’s Turbo Encoder core to provide a complete solution.

This User’s Guide explains the functionality of the Turbo Decoder core and how it can be implemented to provide

decoding. The Turbo Decoder core comes with the documentation and ﬁles listed below:

• Lattice gate level netlist

• RTL simulation model

• Core instantiation template

Features

• Fully compatible with Third Generation Partnership Project (3GPP) standard:

– 3GPP TS 25.212 version 4.2.0

• Fully compatible with CDMA2000/3GPP2

– 3GPP2 C.S002-C, May 2002

• Fully compatible with Consultative Committee for Space Data Systems standard:

– CCSDS 101.0-B-5

• Throughput of 2Mbps for 3GPP at 30MHz, 7 iterations, 6-bit input symbol width

• Two’s complement data/parity input

• Depuncturing supported

• Variable soft-widths for input symbols

• User-deﬁned number of states

• Variable block sizes during runtime

• Programmable number of iterations (1-15)

• Optional hard decision storage

• Selectable Max-Log-Map or Log-Map algorithm

• Optional external memory with programmable pipeline stages

• Optional double buffering

• Bit Error Rate of 10

-6

(at 1.5 dB Eb/No SNR)

General Description

Turbo coding is an advanced error correction technique widely used in the communications industry. Turbo encod-

ers and decoders are key elements in today’s communication systems to achieve the best possible data reception

with fewest possible errors. The basis of turbo coding is to introduce redundancy in the data to be transmitted

through a channel. The redundant data helps to recover original data from the received data. In data transmission,

turbo coding helps achieve near Shannon limit performance.

Lattice Semiconductor

Turbo Decoder User’s Guide

Lattice provides a Turbo Decoder IP core that is both ﬂexible and compliant with three different standards: 3GPP,

3GPP2 and CCSDS. 3GPP is widely used in WCDMA and MC-CDMA applications while CCSDS is most com-

monly found in telemetry and space communications. Figure 1 shows the top-level block diagram of this core.

Lattice also supplies a Turbo Encoder core that provides a complete state-of-the-art error correction solution.

Figure 1. Turbo Decoder I/O Block Diagram

rstn

din

inpvalid

rfi

dout

rfno

rfo

Turbo

Decoder

blocksizeset(ipcfgset)

blocksize

iterations

clk

rate

Note: Additional I/O signals are required if either an external memory or double buffer is selected. Please refer to

the Additional Signals for External Memory section of this document for further information.

MAP Algorithm

Turbo decoding is based on the principle of comparing the probability of a received soft input data being a ‘1’ and

‘0’. The Lattice Turbo Decoder uses a decoding scheme called the MAP - Maximum Aposteriori Probability algo-

rithm. The algorithm determines the probability of whether each received data symbol is a ‘1’ as well as ‘0’. This is

done with the help of the data, parity symbols, and the decoder knowledge of the encoder trellis. A trellis is a form

of a state transition table of the encoder input/output. Based on the data and parity information, the MAP decoder

computes the probability of the encoder being in a particular state. Depending on the soft data, parity value and the

weight from the previous state, the probability that the data is a ‘1’ or ‘0’ can be computed. The MAP decoder com-

putes the weight for each data symbol in a given block for both the forward and reverse direction. This results in the

computation of a forward and reverse metric. Using these two values, the probabilities are computed. After the

probabilities are determined, they are compared and a decision is made. The Lattice Turbo Decoder IP core uses

the logarithm of the probability to reduce computation; this is known as Log Likelihood ratio (LLR). The computation

of the probabilities is done iteratively to obtain a reliable result. Once the result is considered reliable, one can

make a ﬁnal decision as to whether the data symbol is a ‘1’ or a ‘0’. The Lattice Turbo Decoder can implement both

the Log-Map and Max-Log-Map algorithm. The Log-Map algorithm gives a slightly better performance than the

Max-Log-Map but utilizes more resources and runs at a slower frequency.

The Log Likelihood ratio is the probability that the received data bit is a ‘0’ divided by the probability that the

received data bit is a ‘1’.

L(D) = log

P (D=0)

P (D=1)

The value of L(D) is positive if P(D=1)

≤

P(D=) and negative otherwise. The output data value is ‘1’ if L(D) is positive

and ‘0’ if L(D) is negative. For one complete cycle of iteration, one needs to compute the LLR using parity for non-

interleaved as well as interleaved data.

Lattice Semiconductor

Turbo Decoder User’s Guide

Block Diagram

Figure 2 shows a block diagram of the Turbo Decoder detailing the key components and the data paths between

these blocks.

Figure 2. Turbo Decoder Functional Block Diagram

din

Data/Parity

Memory

Data

Parity

Memory

Map

Decoder

write address

write enable

Decoder

LLR

Buffer

write address

write enable

Buffer

Hard

dout

Decision

Storage

(optional)

Storage

(optional)

write address

read address

write enable

Control

Interleaver

Functional Description

The Turbo Decoder consists of four main components: control module, decoder, interleaver and memory buffers.

Control Module

The control module takes care of the interface, pipelining and handshake communication between various blocks

and I/O pins. Data and parity are read serially into the memory and it is assumed that the data is received in the

same order as it was transmitted from the encoder. Signal

blocksizeset(ipcfgset)

initializes the

blocksize

by specifying the size of the block to be input to the decoder. Input data can be given only when

rfi

is asserted.

Input data has to be qualiﬁed with

inpvalid

to be accepted by the core.

Decoder and Interleaver

Once the data is entered into the decoder, the decoder starts computing the LLR of each data symbol. The LLR is

computed for the block sequence twice, once using the non-interleaved data and the corresponding parity and then

using the interleaved data and the corresponding parity. One round of this computation is called an iteration. Each

iteration is divided into two sections, an ODD window and an EVEN window. The LLR for systematic parity is com-

puted during the ODD window and the LLR for interleaved data is computed during the EVEN window. When both

ODD and EVEN window computations are done, one iteration is complete. The user can set the number of itera-

tions for each block on the iterations pin. During the second half of the iteration, EVEN window, the LLR computed

in the ﬁrst half is improved upon by using previous computations. Every window makes use of LLR information

computed in the previous window and tries to improve on the estimate of LLR. The interleaver is used in the second

half of iteration to generate the interleaved address. This address is used to address the data and parity memory to

read the interleaved data for the second half of the iteration. It is also used to address the LLR memory unit and get

the previously computed LLR information. At the end of one iteration, the decoder has a set of LLR for each input

data. The second iteration starts with again using the non-interleaved parity bits and data and the previously com-

puted LLR to get a new estimate of the LLR for the data. Once the decoder completes the number of iterations

required to be done, the LLR memory buffer has the ﬁnal LLR values. The sign of the LLR values determines

whether the data is a ‘1’ or a ‘0’. A positive sign means the data value is a ‘1’, otherwise it is a ‘0’.

Lattice Semiconductor

Output Data Handshaking

Turbo Decoder User’s Guide

When the decoder is ready to output data, signal

rfo

is asserted high after the decoder has completed the speci-

ﬁed number of iterations. The user can then assert signal

rfno

to read the decoded data, which then allows data

to be output on

dout

A synchronous reset signal,

is available to reinitialize the Turbo Decoder in the middle of a block processing.

The current block being processed will be completely discarded during this reset. This can be done at any point of

time during the operation

Memory Buffer

The memory buffering for this IP splits into four sections. These sections are described in detail below.

Input Data/Parity Memory

The Turbo Decoder core requires a large amount of memory to store the input data block. Since data memory

requirements are large, an external memory is recommended so that on-chip memory can be used for other pur-

poses. An external memory interface is provided in the IP. A single or double buffer memory mode may be selected

depending on the available external memory at hand. Double buffer memory allows one block of data to be pro-

cessed while another block is written and read. Double buffer memory delivers better performance than the single

buffer selection by minimizing delay between the processing of each block.

Internal Memory

Some internal memory is required to implement the interleaver and other necessary functions of the Turbo

Decoder. Lattice’s Turbo Decoder requires a small amount of memory for internal purposes. For example, the

3GPP conﬁguration uses 4.6Kb spread over four memory blocks.

LLR Memory

After the Turbo Decoder completes the required number of iterations, the LLR memory buffer stores the ﬁnal LLR

values. The size of the LLR memory buffer is dependant on conﬁguration and block size.

Hard Decision Storage Memory

The Turbo Decoder IP core offers optional hard decision storage. When LLR memory is used as an output buffer,

the decoder cannot go onto process the next block of data until current LLR values of the previous block are com-

pletely read out. This results in an extra processing delay of B cycles (B =

blocksize

). To minimize delay, output

data after hard decision can be stored in separate memory to allow the decoder to operate on a new data block if

memory can be spared.

Operational Data Flow

The following ﬂow diagram describes the sequence for every block introduced into the Turbo Decoder core.

TURBO-ENCO-XM-U3 Related Products

	TURBO-ENCO-XM-U3	TURBO-ENCO-E2-U3	TURBO-ENCO-SC-U3	TURBO-ENCO-XP-N1	TURBO-ENCO-P2-U3	TURBO-DECO-XP-N1	TURBO-DECO-O4-N1	TURBO-ENCO-O4-N1
Description	encoders, decoders, multiplexers & Demultiplexers turbo encoder	encoders, decoders, multiplexers & Demultiplexers turbo encoder	encoders, decoders, multiplexers & Demultiplexers turbo encoder	encoders, decoders, multiplexers & Demultiplexers turbo encoder	encoders, decoders, multiplexers & Demultiplexers turbo encoder	encoders, decoders, multiplexers & Demultiplexers turbo decoder	encoders, decoders, multiplexers & Demultiplexers turbo decoder	encoders, decoders, multiplexers & Demultiplexers turbo encoder
Manufacture	Lattice	Lattice	Lattice	Lattice	Lattice	Lattice	Lattice	Lattice
Product Category	Encoders, Decoders, Multiplexers & Demultiplexers	Encoders, Decoders, Multiplexers & Demultiplexers	Encoders, Decoders, Multiplexers & Demultiplexers	Encoders, Decoders, Multiplexers & Demultiplexers	Encoders, Decoders, Multiplexers & Demultiplexers	Encoders, Decoders, Multiplexers & Demultiplexers	Encoders, Decoders, Multiplexers & Demultiplexers	Encoders, Decoders, Multiplexers & Demultiplexers
Factory Pack Quantity	1	1	1	1	1	1	1	1

Recommended Resources

Hydraulic rotary table control circuit 01

Transformerless symmetrical input microphonic preamplifier circuit

Colpitts oscillator

Programmable divider composed of counter data selector

Solid State Open Delay Circuit Diagram

Microwave automatic lamp I

Friends who want the finished product of EE_FPGA soldering can come and take a picture!: Because some friends are afraid that it will be difficult to solder by themselves, we also provide the finished soldered products. We hope that everyone will have fun in the EE_FPGA learning park! Lea...; soso FPGA/CPLD

section lma overlaps previous sections: Hello everyone! Recently, for some reason, I changed the cross-compilation toolchain from 3.4.3 to 4.2.3. When compiling the application module with the same source code, some modules have error messa...; etual1983 Embedded System

Please take a look at the working principle of this transistor switch.: [size=18px]What is the function of the P-tube below? Is the P-tube useful? Why do I feel that it is the same without it? [/size] [size=18px]What do you think? Please feel free to give me some advice, ...; zhaoyanhao Analog electronics

Questions about Zigbee's PHY layer and MAC layer products: The idea is this: use wireless to implement a clock synchronization protocol similar to PTP in Ethernet, and use Zigbee for the wireless transceiver. There are already products that convert Ethernet t...; miaz1207 RF/Wirelessly

Turning Travel into a Spiritual Practice: Equipment (Part 1): The "heart" of the soul bicycle - the principle of chain generator and tricycle generatorAs a "green" and environmentally friendly way of traveling, cycling has been highly praised by more and more ou...; 敏捷 TI Technology Forum

CCS8.3.1 imports CCS3.3 project 28335: After importing, the compilation fails and an error occurs. The error shows that the Flash28335_API_V210.lib library file cannot be found.Right click the project name and select Properties----C2000 Li...; fish001 Microcontroller MCU

Shortcut: A0 A1 A2 A3 A4 A5 A6 A7 A8 A9 AA AB AC AD AE AF AG AH AI AJ AK AL AM AN AO AP AQ AR AS AT AU AV AW AX AY AZ B0 B1 B2 B3 B4 B5 B6 B7 B8 B9 BA BB BC BD BE BF BG BH BI BJ BK BL BM BN BO BP BQ BR BS BT BU BV BW BX BY BZ C0 C1 C2 C3 C4 C5 C6 C7 C8 C9 CA CB CC CD CE CF CG CH CI CJ CK CL CM CN CO CP CQ CR CS CT CU CV CW CX CY CZ D0 D1 D2 D3 D4 D5 D6 D7 D8 D9 DA DB DC DD DE DF DG DH DI DJ DK DL DM DN DO DP DQ DR DS DT DU DV DW DX DZ

Popular Components