EL ENG 121 Study Guide - Midterm Guide: Huffman Coding, White Noise, Gaussian Process
Document Summary
Eecs 121 midterm (7:00-9:00 p. m. , 8 wednesday 2000) There are 100 total points and question 4, part c) is a bonus. 1a)argue that for any binary code satisfying the prefix-free condition, the codeword lengths li{ } must satisfy the kraft"s inequality: [6 pts. ] c) suppose now the coded symbols are from a general alphabet of size. [10 pts. ] d) consider a source for which the letter probabilities are of the form is an integer. Con- struct the huffman code and give the corresponding codeword lengths. X t( ) be a zero-mean wss gaussian process with autocorrelation function. [6 pts. ] a) find its power spectral density. [8 pts. ] b) suppose we sample this process every. We perform dpcm quantization by llse prediction of. [8 pts. ] d) the residual error is quantized by a single bit quantizer to values. Find the optimal choice of as a function of. Here is one way to simulate white noise.
