EE 5501
Prof. N. Jindal
Digital Communication
Oct. 23, 2009
Homework 5
Due: Friday, Oct. 30, 5:00 PM
1. In this problem you will implement a Viterbi decoder for the running example
R
= 1
/
2
binary convolutional code we have been studying in class (
u
[
k
]+
u
[
k

1]+
u
[
k

2]
, u
[
k
]+
u
[
k

2]). Matlab code that initiates the Viterbi algorithm, runs an outer loop for dif
ferent
E
b
/N
0
values, and that computes the probability of bit error is provided. Your
job is to fill in the main portion of the Viterbi decoding algorithm, and to add expres
sions for the uncoded bit error probability and for the nearest neighbor approximation.
Use your code to generate a plot of bit error (actual bit error, uncoded bit error, and
nearest neighbor approximation) vs.
E
b
/N
0
. Turn in your completed Matlab code and
the numerical plot.
Note: When you are writing the code, you may want to reduce the number of iterations
while you are testing and debugging. When you make the final bit error plot, choose a
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '08
 LOPS
 Error detection and correction, bit error, Viterbi algorithm, Viterbi decoder, nearest neighbor approximation, Prof. N. Jindal

Click to edit the document details