Scribd
Upload
190 views

Vlsi Implementation of Turbo Decoder: Seminar On

The document discusses VLSI implementation of a turbo decoder. It begins with an introduction to turbo codes, which were proposed in 1993 and can operate close to the channel capacity limit. The document then explains the principles of turbo codes, which use parallel concatenated convolutional codes and an interleaver. It describes the encoding and iterative decoding operations of turbo codes, including the use of soft-input soft-output algorithms like log-MAP decoding. The document provides block diagrams of both the encoding and decoding processes and discusses potential applications of the turbo principle beyond decoding turbo codes.

Uploaded by

abizerattary
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
190 views

Vlsi Implementation of Turbo Decoder: Seminar On

The document discusses VLSI implementation of a turbo decoder. It begins with an introduction to turbo codes, which were proposed in 1993 and can operate close to the channel capacity limit. The document then explains the principles of turbo codes, which use parallel concatenated convolutional codes and an interleaver. It describes the encoding and iterative decoding operations of turbo codes, including the use of soft-input soft-output algorithms like log-MAP decoding. The document provides block diagrams of both the encoding and decoding processes and discusses potential applications of the turbo principle beyond decoding turbo codes.

Uploaded by

abizerattary
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

SEMINAR ON

VLSI IMPLEMENTATION OF TURBO


DECODER

Hitesh Choudhary(Roll No. 35)


CONTENTS:

 INTRODUCTION

 TURBO CODES

 TURBO ENCODING OPERATION

 TURBO DECODING OPERATION

2
INTRODUCTION TO TURBO CODES
 In communication systems, signal degradation due to noise translates to an
abundance of bit errors. Turbo codes are one of the error correcting codes
used.

 Turbo codes were proposed by Berrou and Glavieux in the 1993 International
Conference in Communications.

 The use of these codes has been proposed for several applications where
highly reliable transmission is required at very low signal to noise ratio
(SNR).

 The need of low power, high speed and low area turbo decoders are very
much felt in present communication systems.

3
TURBO CODES

4
TURBO PRINCIPLE
 Turbo codes get their name because the decoder uses
feedback, like a turbo engine.

5
TURBO CODES:
 A turbo code is the parallel concatenation
convolutional codes.

 Concatenated codes can be classified as either


 parallel concatenated convolutional codes (PCCCs)
 serial concatenated convolutional codes (SCCCs)

 Performance within 0.5 dB of the channel


capacity limit for BPSK was demonstrated.

6
PCCCS
 Parallel Concatenated Convolutional
Codes(PCCCs)

7
PCCCS FEATURES(CONTD.)
 A stronger code can be created by encoding in parallel.

 A non uniform interleaver changes the ordering of bits


at the input of the second encoder

 It is very unlikely that both encoders produce low


weight code words.

 MUX increases code rate from 1/3 to 1/2.


8
PCCCS BLOCK DIAGRAM

Systematic Output
Input Encoder
#1 xi

MUX
Parity
Output
Encoder
#2

9
SCCCS FEATURES
 Serial Concatenated Convolutional Codes(PCCCs)

 SCCCs do not suffer from shallow an error floor as


PCCCs.
10
OTHER APPLICATIONS OF THE TURBO PRINCIPLE

 The turbo-principle is more general than its


application to the decoding of turbo codes

 Other applications of the turbo principle include:


 Decoding serially concatenated codes
 Combined equalization and error correction decoding
 Combined multiuser detection and error correction
decoding.

11
TURBO CODES
 Turbo code advantages:-
 Remarkable power efficiency in AWGN and flat-
fading channels for moderately low BER.

 Turbo code disadvantages:-


 Long latency due to large frame sizes.
 Less beneficial at high SNR.

 Because turbo codes operate at very low SNR channel


estimation and tracking is a critical issue.

12
TURBO ENCODING OPERATION

13
CONVOLUTIONAL ENCODING
 An RSC encoder can be constructed from a
standard convolutional encoder by feeding back
one of the outputs.
 An RSC encoder has an infinite impulse response.

 An arbitrary input will cause a “good” (high


weight) output with high probability.
 Some inputs will cause “bad” (low weight) outputs.

14
CONVOLUTIONAL ENCODING

x i( 0 )

mi xi
D D
x i(1 )
mi x i( 0 )

xi

ri
D D
x i(1 )

Parity output
15
WHY INTERLEAVING AND RECURSIVE ENCODING?

 In a coded systems:
 Performance is dominated by low weight code words.
 A “good” code:
 will produce low weight outputs with very low probability.
 An RSC code:
 Produces low weight outputs with fairly low probability.
 However, some inputs still cause low weight outputs.

 Because of the interleaver:


 The probability that both encoders have inputs that cause low weight outputs
is very low.
 Therefore the parallel concatenation of both encoders will produce a “good”
code.

16
TURBO DECODING OPERATION

17
ITERATIVE DECODING
 There is one decoder for each elementary encoder.

 Each decoder estimates the a posteriori probability (APP) of


each data bit.

 The APP’s are used as a priori information by the other


decoder.

 Decoding continues for a set number of iterations.


• Performance generally improves from iteration to iteration,
but follows a law of diminishing returns.
18
ITERATIVE DECODING BLOCK DIAGRAM

Deinterleaver
APP
APP
Interleaver
systematic Decoder Decoder
data #1 #2
parity
data DeMUX

Interleaver

19
FEATURES:-
 A turbo decoder consists of two elementary
decoders that work cooperatively.
 Soft-in soft-out (SISO) decoders.
• Implemented with Log-MAP algorithm
 Feedback.
• Each decoder produces a posteriori information, which is
used as a priori information by the other decoder.
• Iterative

20
SOFT-INPUT SOFT-OUTPUT (SISO) DECODING ALGORITHMS

Trellis-Based
Estimation Algorithms

Viterbi MAP
Algorithm Algorithm

SOVA max-log-MAP

Improved log-MAP
SOVA

Sequence Symbol-by-symbol
Estimation Estimation

21
QUERIES PLEASE…
Thank You.

22

You might also like