midterm2_practice

midterm2_practice - EE 5501 Digital Communication Prof. N....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
EE 5501 Prof. N. Jindal Digital Communication Nov. 19, 2009 Practice Problems for Midterm 2 1. Consider the R = 1 / 2 binary convolutional code with memory 2 that outputs the following two coded bits for each information bit: u [ k ] + u [ k - 1] u [ k ] + u [ k - 2] (a) Draw the trellis diagram (with outputs labeled for each branch) for this code. (b) Compute d free for this code. Find all error events at d free , and for each write down the corresponding input sequence, output sequence, and input weight. (c) Write down the expression for the nearest neighbor approximation. (d) On the following page you are given the Matlab code for the Viterbi decoder for the [7 , class. Modify the Matlab code so that it implements the Viterbi decoder for the convolutional code in this problem. The code is terminated in state 00 by setting two additional information bits to zero.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the 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.

Ask a homework question - tutors are online