EE238: Multimedia communications and processing
Homework 1
Prepared by Mihaela van der Schaar.
Please identify your homework with your name and student ID.
Problem 1.
Consider a video source that must send N = 3 video frames to a client over two cascaded
EE 231E
Channel Coding
Homework 4 Solutions
April 26, 2016
Instructor: Rick Wesel
89 pts
1. (12 pts) Massey Length Theorem. Suppose that when originally loaded with s0 , s1 , s2
(as shown below) the shift register in Fig. 1 with length L = 3 generates at
EE 231E
Channel Coding
Instructor: Rick Wesel
Problem Set 5
Thursday, May 5, 2015
Due: Tuesday May 17, 2015
123 pts
Reading: Mainly Lecture Notes. Encyclopedia article, Bahl et al. and Blahut Chapters 9
and 11 are supplemental
1. (10 pts) Viterbi decoding
EE 231E
Channel Coding
Instructor: Rick Wesel
Solution Set 3
April 24, 2016
95 pts
Reading: Relevant sections of chapters 5,6,7 in Blahut.
1. (10 pts) Find the minimal polynomial for each element of GF (16).
From Table 4.1 on page 82 we can see that a pri
EE231E
Channel Coding
Instructor: Rick Wesel
Class Project
05/09/16
10 % of your course grade
Due Friday, June 3, 2015
Project Choice 1: Convolutional Encoder and Viterbi Decoder with Finite Traceback
A popular convolutional encoder is the 64-state, rate-
EE 231E
Channel Coding
Instructor: Rick Wesel
Spring 2016 Midterm
Saturday-Tuesday, April 30-May 3, 2016
120 pts, 120 minutes
Instructions: This exam is closed book except for one side of one sheet of paper with notes
that you have prepared for the exam.
EE 231E
Channel Coding
Instructor: Rick Wesel
Problem Set 7
Tuesday, May 24, 2016
Due Tuesday, May 31, 2016
134 pts
Reading: Handouts
Lecture 13 a: Layered Decoding and Protographs
1. (35 pts) Layered Decoding and Protographs.
The following LDPC parity-ch
EE 231E
Channel Coding
Instructor: Rick Wesel
Handout #4, Problem Set 2
Friday, April 1, 2016
Due: Tuesday April 12, 2016
129 pts
Reading: Chapters 4, 5.1-5.4 of Blahut
1. (10 pts) Groups with three and four elements (Blahut 2.2).
(a) Show that only one g
EE 238 Multimedia Communications and Processing
Solutions
Homework 2
A gambler has the opportunity to make bets on the outcomes of a sequence of coin flips.
If the coin comes up heads, he wins as many dollars as he has staked on that flip; if it is
tails,
EE 231E
Channel Coding
Instructor: Rick Wesel
Handout #6, Problem Set 3
Tuesday, April 12, 2016
Due: Tuesday April 19, 2016
99 pts
Reading: Relevant sections of chapters 5,6,7 in Blahut.
1. (10 pts) Minimal Polynomials (Blahut 5.2) Using the primitive pol
EE 231E
Channel Coding
Instructor: Rick Wesel
Spring 2016 Final Exam
Saturday, June 4, 2016, Boelter 5420, 1-4 pm,
Thursday June 9, 2016, Boelter 7702, 11:30 a.m.- 2:00 p.m.
135 pts, 180 minutes
Solutions
1. (15 pts) Viterbi with Hard Decoding.
Consider t
EE 231E
Channel Coding
Instructor: Rick Wesel
Handout #3, Problem Set 1
Tuesday, March 29, 2016
Due: Tuesday April 5, 2016
93 pts
Reading: Chapters 1-3 of Blahut
1. (12 pts) Hamming and Gilbert Bounds.
For the following codes, find the Hamming, Singleton,
EE 231E
Channel Coding
Instructor: Rick Wesel
Problem Set 1 Solutions
Tuesday, April 12, 2016
1. (12 pts) Hamming and Gilbert Bounds.
For the following codes, find the Hamming, Singleton, and Gilbert bounds on the
required redundancy . State which codes c
EE 231E
Channel Coding
Instructor: Rick Wesel
Spring 2016 Midterm
Saturday-Tuesday, April 30-May 3, 2016
120 pts, 120 minutes
Instructions: This exam is closed book except for one side of one sheet of paper with notes
that you have prepared for the exam.
EE 231E
Channel Coding
Instructor: Rick Wesel
Solution Set 6
Wednesday, May 18, 2016
94 pts
Lecture 12 a: Density Evolution and Reciprocal Channel Approximation
1. (15 pts) Density Evolution on the Binary Symmetric Channel.
In this problem you compute the
EE 231E
Channel Coding
Instructor: Rick Wesel
Spring 2014 Midterm Solutions
Tuesday, May 6, 2014
88 pts, 110 minutes
Instructions: This exam is closed book except for one side of one sheet of paper with notes
that you have prepared for the exam. You are s
EE 231E
Channel Coding
Instructor: Rick Wesel
Problem Set 4
Tuesday, April 19, 2016
Due: Tuesday, April 26, 2016
123 pts
1. (12 pts) Massey Length Theorem. Suppose that when originally loaded with s0 , s1 , s2
(as shown below) the shift register in Fig. 1
EE 231E
Channel Coding
Instructor: Rick Wesel
Solution Set Set 5
Wednesday, May 18, 2016
123 pts
1. (10 pts) Viterbi decoding of convolutional codes.
In this problem you apply Viterbi decoding to the rate-2/3 convolutional code with
generator matrix
1 D 1
EE 231E
Channel Coding
Instructor: Rick Wesel
Spring 2015 Final
Thursday, June 11, 2015
Boelter 7702, 8:00 a.m. - 11:00 a.m.
113 pts, 180 minutes
Instructions: This exam is closed book except for two sides of notes that you have prepared
for the exam. A c
EE 231E
Channel Coding
Instructor: Rick Wesel
Solution Set 2
Sunday 4/17/2015
129 pts
Reading: Chapters 4, 5.1-5.4 of Blahut
1. (10 pts) Groups with three and four elements.
(a) Show that only one group exists with three elements. Construct this group and
EE 231E
Channel Coding
Instructor: Rick Wesel
Spring 2015 Final
Taken Saturday-Thursday, June 6-11, 2015
113 pts, 180 minutes
Solutions
1. (9 pts) Choices. For each question below, please circle the letter of the best answer.
Correct answers earn 3 points
EE 231E
Channel Coding
Instructor: Rick Wesel
Spring 2015 Midterm
Tuesday, May 5, 2015
88 pts, 110 minutes
Instructions: This exam is closed book except for one side of one sheet of paper with notes
that you have prepared for the exam. You are suggested t
EE 231E
Channel Coding
Instructor: Rick Wesel
Problem Set 6
Tuesday, May 17, 2016
Due Tuesday, May 24, 2016
94 pts
Reading: Handouts
Lecture 12 a: Density Evolution and Reciprocal Channel Approximation
1. (15 pts) Density Evolution on the Binary Symmetric
EE 238, Midterm Solution
Consider a wireless channel whose channel conditions are modeled as a two-state Markov chain with
states h
good, bad . In the bad channel state (i.e. h
cost c(bad)
bad ), transmitting one packet incurs a
40 . In the good channel s
EE238: Multimedia communications and processing
Homework 3
Please identify your homework with your name
and student ID
The following probability bounds will be helpful when solving problem 1.
Cherno-Hoeding Bound: Let X1 , X2 , . . . , Xn be independent a