midterm2 - EE 5501 Digital Communication Midterm 2 Prof. N....

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Prof. N. Jindal Digital Communication Nov. 24, 2009 Midterm 2 1. Consider the R = 1 / 2 binary convolutional code with memory 2 that outputs the following two bits for each information bit: u [ k ] + u [ k - 1] + u [ k - 2] u [ k ] (a) Label the branches in the trellis diagram. (10 pts) (b) Compute d free for this code. Find all error events at d free and indicate them on the extended trellis (below). For each error event at d free , write down the corresponding input sequence, output sequence, and input weight. (10 pts) (c) Write down the expression for the nearest neighbor approximation. (10 pts) (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. Hint: You should only have to modify a small number of lines in the Matlab code.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

midterm2 - EE 5501 Digital Communication Midterm 2 Prof. N....

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online