Problem set 3 - Random Vectors and Minimum Mean Squared Error Estimation - Fall 2004 | ECE 534, Assignments of Electrical and Electronics Engineering

Material Type: Assignment; Class: Random Processes; Subject: Electrical and Computer Engr; University: University of Illinois - Urbana-Champaign; Term: Fall 2004;

Typology: Assignments

Pre 2010

Uploaded on 03/11/2009

koofers-user-fhw
koofers-user-fhw 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 534 RANDOM PROCESSES FALL 2004
PROBLEM SET 3 Due Wednesday, October 6
Random Vectors and Minimum Mean Squared Error Estimation
Assigned Reading: Chapter 3 and the section on matrices in the Appendix, in the course notes.
Problems to be handed in:
1. Linear approximation of the cosine function over [0, π]
Let Θ be uniformly distributed on the interval [0, π] (yes, [0, π], not [0,2π]). Suppose Y= cos(Θ)
is to be estimated by an estimator of the form a+bΘ. What numerical values of aand bminimize
the mean square error?
2. Projections onto nested linear subspaces
(a) Use the Orthogonality Principle to prove the following statement: Suppose V0and V1are
two closed linear spaces of second order random variables, such that V0 V1, and suppose X
is a random variable with finite second moment. Let Z
ibe the random variable in Viwith the
minimum mean square distance from X. Then Z
1is the variable in V1with the minimum mean
square distance from Z
0. (b) Suppose that X, Y1,and Y2are random variables with finite second
moments. For each of the following three statements, identify the choice of subspace V0and V1
such that the statement follows from part (a):
(i) b
E[X|Y1] = b
E[b
E[X|Y1, Y2]|Y1].
(ii) E[X|Y1] = E[E[X|Y1, Y2]|Y1]. (Sometimes called the “tower property.”)
(iii) E[X] = E[b
E[X|Y1]]. (Think of the expectation of a random variable as the constant closest to
the random variable, in the m.s. sense. )
3. Diagonalizing a two-dimensional Gaussian distribution
Let X= X1
X2!be a mean zero Gaussian random vector with correlation matrix 1ρ
ρ1!,
where |ρ|<1. Find an orthonormal 2 by 2 matrix Usuch that X=UY for a Gaussian vector
Y= Y1
Y2!such that Y1is independent of Y2. Also, find the variances of Y1and Y2.
Note: The following identity might be useful for some of the problems that follow. If A, B, C,
and Dare jointly Gaussian and mean zero, then E[ABCD] = E[AB]E[CD] + E[AC]E[B D] +
E[AD]E[BC ]. This implies that E[A4]=3E[A2]2, Var(A2)=2E[A2], and Cov(A2, B2) =
2Cov(A, B)2.Also, E[A2B] = 0.
4. A quadratic estimator
Suppose Yhas the N(0,1) distribution and that X=|Y|. Find the estimator for Xof the form
b
X=a+bY +cY 2which minimizes the mean square error. (You can use the following numerical
values: E[|Y|] = 0.8, E[Y4] = 3, E[|Y|Y2] = 1.6.)
(a) Use the orthogonality principle to derive equations for a, b, and c.
(b) Find the estimator b
X.
(c) Find the resulting minimum mean square error.
1
pf2

Partial preview of the text

Download Problem set 3 - Random Vectors and Minimum Mean Squared Error Estimation - Fall 2004 | ECE 534 and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

ECE 534 RANDOM PROCESSES FALL 2004

PROBLEM SET 3 Due Wednesday, October 6

Random Vectors and Minimum Mean Squared Error Estimation

Assigned Reading: Chapter 3 and the section on matrices in the Appendix, in the course notes.

Problems to be handed in:

  1. Linear approximation of the cosine function over [0, π] Let Θ be uniformly distributed on the interval [0, π] (yes, [0, π], not [0, 2 π]). Suppose Y = cos(Θ) is to be estimated by an estimator of the form a + bΘ. What numerical values of a and b minimize the mean square error?
  2. Projections onto nested linear subspaces (a) Use the Orthogonality Principle to prove the following statement: Suppose V 0 and V 1 are two closed linear spaces of second order random variables, such that V 0 ⊃ V 1 , and suppose X is a random variable with finite second moment. Let Z i∗ be the random variable in Vi with the minimum mean square distance from X. Then Z 1 ∗ is the variable in V 1 with the minimum mean square distance from Z 0 ∗. (b) Suppose that X, Y 1 , and Y 2 are random variables with finite second moments. For each of the following three statements, identify the choice of subspace V 0 and V 1 such that the statement follows from part (a): (i) Ê [X|Y 1 ] = Ê [ Ê [X|Y 1 , Y 2 ] |Y 1 ]. (ii) E[X|Y 1 ] = E[ E[X|Y 1 , Y 2 ] |Y 1 ]. (Sometimes called the “tower property.”) (iii) E[X] = E[Ê [X|Y 1 ]]. (Think of the expectation of a random variable as the constant closest to the random variable, in the m.s. sense. )
  3. Diagonalizing a two-dimensional Gaussian distribution

Let X =

( X 1 X 2

) be a mean zero Gaussian random vector with correlation matrix

( 1 ρ ρ 1

) ,

where |ρ| < 1. Find an orthonormal 2 by 2 matrix U such that X = U Y for a Gaussian vector

Y =

( Y 1 Y 2

) such that Y 1 is independent of Y 2. Also, find the variances of Y 1 and Y 2.

Note: The following identity might be useful for some of the problems that follow. If A, B, C, and D are jointly Gaussian and mean zero, then E[ABCD] = E[AB]E[CD] + E[AC]E[BD] + E[AD]E[BC]. This implies that E[A^4 ] = 3 E[A^2 ]^2 , Var(A^2 ) = 2 E[A^2 ], and Cov(A^2 , B^2 ) = 2Cov(A, B)^2. Also, E[A^2 B] = 0.

  1. A quadratic estimator Suppose Y has the N (0, 1) distribution and that X = |Y |. Find the estimator for X of the form X̂ = a + bY + cY 2 which minimizes the mean square error. (You can use the following numerical values: E[|Y |] = 0.8, E[Y 4 ] = 3, E[|Y |Y 2 ] = 1.6.) (a) Use the orthogonality principle to derive equations for a, b, and c. (b) Find the estimator X̂. (c) Find the resulting minimum mean square error.
  1. Estimating a quadratic Let

( X Y

) be a mean zero Gaussian vector with correlation matrix

( 1 ρ ρ 1

) , where |ρ| < 1.

(a) Find E[X^2 |Y ], the best estimator of X^2 given Y. (b) Compute the mean square error for the estimator E[X^2 |Y ]. (c) Find Ê [X^2 |Y ], the best linear (actually, affine) estimator of X^2 given Y, and compute the mean square error.

  1. An innovations sequence and its application

Let

  

Y 1

Y 2

Y 3

X

   be a mean zero random vector with correlation matrix

  

  .

(a) Let Y˜ 1 , ˜Y 2 , ˜Y 3 denote the innovations sequence. Find the matrix A so that

  

˜Y 1

˜Y 2

˜Y 3

   =^ A

  

Y 1

Y 2

Y 3

  .

(b) Find the correlation matrix of

  

˜Y 1

˜Y 2

˜Y 3

   and cross covariance matrix Cov(X,

  

Y˜ 1

Y^ ˜ 2

Y^ ˜ 3

  ).

(c) Find the constants a, b, and c to minimize E[(X − aY˜ 1 − bY˜ 2 − cY˜ 3 )^2 ].

  1. The Kalman Filter for xk|k Suppose in a given application a Kalman filter has been implemented to recursively produce x̂ k+1|k for k ≥ 0, as in class. Thus by time k, ̂xk+1|k, Σk+1|k, x̂k|k− 1 , and Σk|k− 1 are already computed. Suppose that it is desired to also compute x̂k|k at time k. Give additional equations that can be used to compute ̂xk|k. (You can assume as given the equations in the class notes, and don’t need to write them all out. Only the additional equations are asked for here. Be as explicit as you can, expressing any matrices you use in terms of the matrices already given in the class notes.)