hw9 - Problem 3 The code you constructed in Problem 2 can...

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

View Full Document Right Arrow Icon
ECE220 Signals and Information Spring 2008 Homework 8: Due Monday, April 28th, at 10:08pm Drop your homework in the collection box marked ”ECE220 Spring 2008, homework” , located on the second foor oF Phillips at the south entrance to 219 Phillips. Print your name, NetId, and lab section in the top right corner on all pages. NOTE: This homework is based on lecture notes that can be Found on Blackboard. Problem 1 Consider the Following binary codes: letter code 1 code 2 code 3 code 4 A 0 0 00 00 B 1 11 01 01 C 01 01 10 1 (a) Which oF the codes are pre±x codes? Expalin. (b) Which oF the codes are uniquely decodable? Explain. (c) How will the sequence 0111 be decoded by each oF the codes? Problem 2 Consider the alphabet { A, B, C } with probabilities oF occurence P = { 0 . 1 , 0 . 2 , 0 . 7 } . (a) Compute the entropy oF the alphabet. (b) Construct a Ho²man code For this alphabet. (c) Calculate the average length oF codewords in (b).
Background image of page 1

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

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

Unformatted text preview: Problem 3 The code you constructed in Problem 2 can be improved by considering pairs oF letters. Assume that the source generating letters is memoryless. Thus the probability oF occurence, For example, oF the sequence AB is 0.02, which is the product oF probailities oF occurence oF A and oF B separately. (a) Construct a new alphabet consisting of all possible pairs of letters from Problem 1. (b) Compute the entropy of the alphabet. (c) Construct a HoFman code for this new alphabet. (d) Calculate the average length of codewords in (c). (e) Dene the eciency of the code as the ratio of the entropy of the alphabet and the average length of codewords. Compare the eciency of the code from Problem 2 with the eciency of the code in (c). 2...
View Full Document

This note was uploaded on 06/25/2008 for the course ECE 2200 taught by Professor Johnson during the Spring '05 term at Cornell University (Engineering School).

Page1 / 2

hw9 - Problem 3 The code you constructed in Problem 2 can...

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