Scribd
Upload
3K views18 pages

Convolutional Coding Viterbi Algorithm

This document summarizes a presentation on convolutional coding and the Viterbi algorithm. The presentation introduces convolutional codes, describes how they operate on data streams using memory, and defines their parameters. It then explains generator sequences and trellis diagrams. The maximum likelihood decoding problem and the Viterbi algorithm for reducing complexity are presented. Examples are provided to illustrate convolutional encoding, maximum likelihood decoding, and applying the Viterbi algorithm to decode a received sequence. The document concludes by assigning homework for the audience to practice Viterbi decoding.

Uploaded by

api-3827370
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
3K views18 pages

Convolutional Coding Viterbi Algorithm

This document summarizes a presentation on convolutional coding and the Viterbi algorithm. The presentation introduces convolutional codes, describes how they operate on data streams using memory, and defines their parameters. It then explains generator sequences and trellis diagrams. The maximum likelihood decoding problem and the Viterbi algorithm for reducing complexity are presented. Examples are provided to illustrate convolutional encoding, maximum likelihood decoding, and applying the Viterbi algorithm to decode a received sequence. The document concludes by assigning homework for the audience to practice Viterbi decoding.

Uploaded by

api-3827370
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 18

Helsinki University of Technology

S-72.333 Postgraduate Seminar on Radio Communications

Convolutional Coding & Viterbi Algorithm

Er Liu

liuer@cc.hut.fi
Communications Laboratory
16.11.2004
Outline
Convolutional Coding
Convolutional code
Generator sequence
Trellis and state diagram

Viterbi Algorithm
Maximum-Likelihood decoding
Viterbi algorithm

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 2
Convolutional Encoding
Convolutional codes are applied in applications that require
good performance with low implementation cost. They operate
on data stream, not static block.
Convolutional codes have memory that uses previous bits to
encode or decode following bits
It is denoted by (n,k,L), where L is code memory depth
Code rate r is determined by input rate and output rate:

rinput
r= <1
routput

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 3
Convolutional Encoder
Convolutional encoder is a finite state machine (FSM),
processing information bits in a serial manner
Thus the generated code is a function of input and the states of
the FSM
In this (n,k,L)=(2,1,2) encoder each message bits influences a
span of n(L+1)=6 successive output bits

x 'j = m j − 2 ⊕ m j −1 ⊕ m j
x ''j = m j − 2 ⊕ m j

(n,k,L)=(2,1,2) encoder
Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)
Page 4
Another Encoder example

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 5
Generator Sequence
(n,k,L) convolutional code can be described by generator sequences
g(1) , g(2),..., g(n) that are the impulse responses of each coder output
branch

⎧⎪ g (1) = [1 0 1 1]
⎨ (2)
⎪⎩ g = [1 1 1 1]

Generator sequences specify convolutional code completely by the


associated generator matrix
Encoded convolutional code is produced by matrix multiplication of
input and the generator matrix
Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)
Page 6
Example of Using Generator Matrix

It can also use polynomial multiplication


Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)
Page 7
Representation – Code Tree

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 8
Trellis and State Diagram

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 9
Minimum Hamming Distance

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 10
Maximum-Likelihood Decoding
Maximum likelihood decoding means finding the code
branch in the code trellis that was most likely to transmitted
Therefore maximum likelihood decoding is based on
calculating the hamming distances for each branch forming
encode word
Probability to decode sequence is then
∞
p( y, x) = ∏ p( y j x j )
j =0

The most likely path through the trellis will maximize this
metric

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 11
Example of Maximal Likelihood Detection
Assume a three bit message is to transmitted. To clear the encoder two
zero-bits are appended after message. Thus 5 bits are inserted into
encoder and 10 bits produced. Assume channel error probability is
p=0.1. After the channel 10,01,10,11,00 is produced. What comes after
decoder, e.g. what was most likely the transmitted sequence?

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 12
Example of Maximal Likelihood Detection

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 13
Viterbi Algorithm
ML algorithm is too complex to search all available pathes
End to end calculation
Viterbi algorithm performs ML decoding by reducing its
complexity
Eliminate least likely trellis path at each transmission stage
Reduce decoding complexity with early rejection of unlike pathes
Viterbi algorithm gets its efficiency via concentrating on
suvival paths of the trellis

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 14
Viterbi decoding

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 15
Example of Viterbi decoding
Input data : m =1 1 0 1 1
Codeword : X = 11 01 01 00 01
Received code : Z = 11 01 01 10 01

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 16
Homework
Please use Viterbi algorithm to decode the received
sequence:
Z=[11 10 10 10 01]
Please draw the trellis
and state diagram

Convolutional Coding & Viterbi Algorithm Er Liu (liuer@cc.hut.fi)


Page 17
Helsinki University of Technology
S-72.333 Postgraduate Seminar on Radio Communications

Any questions?

Thanks!

You might also like