This preview shows page 1. Sign up to view the full content.
Unformatted text preview: decisions on a trellis diagram, labelling the partial path metric of each survivor at each time unit. What is the smallest possible Hamming distance between any of the possible code sequences and this received sequence? 2. Consider the recursive systematic convolutional encoder shown below. a i--s (1) i-s (2) i ?-?-c (1) i-c (2) i (a) Draw the state diagram. (b) Find the transfer function T ( D ) of the code. (c) Find the minumum free distance ( d free ) of the code. (d) What is the code sequence for the message sequence a = 10110? (e) What is the code sequence for the message sequence a = 1000? SYSC 5504 1 Fall 2010/11...
View Full Document
This note was uploaded on 01/25/2011 for the course SCE 5201 taught by Professor Huang during the Spring '10 term at Carleton CA.
- Spring '10