Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
3 views13 pages

ECE/EEE Communication Systems Guide

The document discusses convolutional codes, focusing on the convolutional encoder and its parameters, including constraint length and code rate. It explains maximum likelihood decoding and introduces the Viterbi algorithm as a practical method for decoding convolutional codes by minimizing Hamming distance through a trellis structure. Examples are provided to illustrate the encoding and decoding processes.

Uploaded by

cladboy023
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views13 pages

ECE/EEE Communication Systems Guide

The document discusses convolutional codes, focusing on the convolutional encoder and its parameters, including constraint length and code rate. It explains maximum likelihood decoding and introduces the Viterbi algorithm as a practical method for decoding convolutional codes by minimizing Hamming distance through a trellis structure. Examples are provided to illustrate the encoding and decoding processes.

Uploaded by

cladboy023
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Convolutional codes

A Convolutional encoder

I Sem 2020-21 ECE/EEE F311 Communication Systems 1


If input bits are 11010,
The output bit stream is 11010100101100.

This encoder has


• a constraint length 𝑁 = 3, and
• 𝑙 = 2.

1 Output bit stream


Code rate ≅
𝑙

I Sem 2020-21 ECE/EEE F311 Communication Systems 2


Code Tree
State Transition
Diagram

Trellis Diagram

I Sem 2020-21 ECE/EEE F311 Communication Systems 3


Decoding Convolutional codes

Maximum likelihood Decoding

Chose the estimate 𝑐Ƹ that minimizes the Hamming


distance between the received vector 𝑟 and the
transmitted vector 𝑐 .

For a large number of 𝑘 data bits , since there are 2𝑘 codewords,


the MLD involves storage of large number of words and comparing
the received word with each of them.

For encoding with large constraint length, it becomes not practical.

I Sem 2020-21 ECE/EEE F311 Communication Systems 4


The Viterbi Algorithm

It is a maximum likelihood decoder


A major simplification for MLD.

The decoding involves walking through the Trellis, while computing


a ‘metric’ for every possible path in the trellis.
The metric for a particular path is defined as the Hamming distance
between the coded sequence represented by that path and the
received sequence.

At each stage, the path with lower metric is retained, while the
other path is discarded.

The paths that are retained are called ‘survivor’ paths.

I Sem 2020-21 ECE/EEE F311 Communication Systems 5


Example 2

Consider the encoder example discussed earlier.

Let the first 12 received bits are 011011100000.

I Sem 2020-21 ECE/EEE F311 Communication Systems 6


Example 1

Let the received bits are 11010100101100. Find the transmitted bits.

I Sem 2020-21 ECE/EEE F311 Communication Systems 7


I Sem 2020-21 ECE/EEE F311 Communication Systems 8
I Sem 2020-21 ECE/EEE F311 Communication Systems 9
I Sem 2020-21 ECE/EEE F311 Communication Systems 10
I Sem 2020-21 ECE/EEE F311 Communication Systems 11
I Sem 2020-21 ECE/EEE F311 Communication Systems 12
Wishing you all the best….

I Sem 2020-21 ECE/EEE F311 Communication Systems 13

You might also like