This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 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 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 . 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 awhile you are testing and debugging....
View
Full
Document
This note was uploaded on 11/21/2011 for the course EE 5501 taught by Professor Lops during the Fall '08 term at Minnesota.
 Fall '08
 LOPS

Click to edit the document details