DOC PREVIEW
MIT 6 041 - Probabilistic Systems Analysis

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

� � � � � Massachusetts Institute of Technology Department of Electrical Engineering & Computer Science 6.041/6.431: Probabilistic Systems Analysis (Fall 2010) Tutorial 11 1. Continuous random variables X and Y have a joint PDF given by 2/3 if (x, y) belongs to the closed shaded region fX,Y (x, y) = 0 otherwise y 2 1 1 2 x We want to estimate Y based on X. (a) Find the LMS estimator g(X) of Y . (b) Calculate the conditional mean squared error E (Y − g(X))2 | X = x . (c) Calculate the mean squared error E (Y − g(X))2 . Is it the same as E [var(Y |X)]? (d) Derive L(X), the linear LMS estimator of Y based on X. (e) How do you expect the mean squared error of L(X) to compare to that of g(X)? (f) What problem do you expect to encounter, if any, if you try to find the MAP estimator for Y based on observations of X. 2. Consider a noisy channel over which you send messages consisting of 0s and 1s to your friend. It is known that the channel independently flips each bit sent with some fixed probability p; however the value of p is unknown. You decide to conduct some experiments to estimate p and seek your friend’s help. Your friend, cheeky as she is, insists that you send her messages consisting of three bits each (which you will both agree upon in advance); for each message, she will only tell you the total number of bits in that message that were flipped. Let X denote the number of bits flipped in a particular three-bit message. (a) Find the PMF of X. (b) Derive the ML estimator for p based on X1, . . . , Xn, the numbers of bits flipped in the first n three-bit messages. (c) Is the ML estimator unbiased? (d) Is the ML estimator consistent? (e) You send n = 100 three-bit messages and find that the total number of bits flipped is 20. Construct a 95% confidence interval for p. If necessary, you may use a conservative bound on the variance of the number of bits flipped. (f) What are some other ways to estimate the variance. How do you expect your confidence interval to change with different estimates of the variance. Page 1 of 1MIT OpenCourseWare http://ocw.mit.edu 6.041 / 6.431 Probabilistic Systems Analysis and Applied Probability Fall 2010 For information about citing these materials or our Terms of Use, visit:


View Full Document

MIT 6 041 - Probabilistic Systems Analysis

Documents in this Course
Quiz 1

Quiz 1

5 pages

Quiz 2

Quiz 2

6 pages

Quiz 1

Quiz 1

11 pages

Quiz 2

Quiz 2

2 pages

Syllabus

Syllabus

11 pages

Quiz 2

Quiz 2

7 pages

Quiz 1

Quiz 1

6 pages

Quiz 1

Quiz 1

11 pages

Quiz 2

Quiz 2

13 pages

Quiz 1

Quiz 1

13 pages

Load more
Download Probabilistic Systems Analysis
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Probabilistic Systems Analysis and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Probabilistic Systems Analysis 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?