ECE 534: Random Processes - Solutions to Problem Set 6 - Prof. Rayadurgam Srikant, Assignments of Electrical and Electronics Engineering

Material Type: Assignment; Professor: Srikant; Class: Random Processes; Subject: Electrical and Computer Engr; University: University of Illinois - Urbana-Champaign; Term: Spring 2010;

Typology: Assignments

Pre 2010

Uploaded on 05/09/2010

zhaowen
zhaowen 🇺🇸

5

(2)

11 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 534: Random Pro cesses Spring 2010
Solutions to Problem Set 6
3.21 Estimation for an additive Gaussian noise model
The vectors xand yare jointly Gaussian since they are obtained from xand nvia linear
operations. Thus, the conditional distribution of xgiven yis a Gaussian distribution. For
a given value of y, that distribution has mean ¯x+ ΣxyΣ1
yy (y¯y) and covariance matrix
equal to Σee = Σxx ΣxyΣ1
yy Σyx where ¯x=Ex, ¯y=Ey, ¯y=E[x+n] = ¯x+ ¯n,
Σxy = Cov(x, x +n)=Σx+ Σxn = Σx,and
Σyy = Cov(x+n, x +n)=Σx+ Σn.
The proof of the equivalent formulas is left to the reader.
3.23 Steady state gains for one-dimensional Kalman filter
(a) Let bk=σ2
k. The solution to Problem 3.22 shows that the sequence bksatisfies the
recursion bk+1 =F(bk), where F(b) = bf 2
1+b+ 1, with the initial condition b0=σ20
given. The function Fis positive, strictly increasing, and bounded. Thus if bkbk+1
for some k, then bk+1 =F(bk)F(bk+1) = bk+2 . Therefore, if b0b1, then the
sequence (bk:k0) is monotone nondecreasing and bounded. Simlarly, if b0b1
then the sequence (bk:k0) is monotone nonincreasing and bounded. Since bounded
monotone sequences have finite limits, the sequence (bk:k0) converges.
(b) Denote the limit by b(so b=σ2
). Since Fis a continuous function, letting k
in the equation bk+1 =F(bk) yields b=F(b), which has the unique nonnegative
solution b=f2+f4+4
2.
(c) If f= 0, the states xkare uncorrelated with variance one. The observations y0, . . . , yk1
are therefore orthogonal to xk, and the variance of the error, σ2
k, is just the variance of
xk, equal to one for all k. The limiting variance of error is thus also one.
3.25 The Kalman filter for xk|k
By time kwe have already calculated bxk|k1. In fact, it was already done at time k1.
The problem is to update bxk|k1by incorporating the new observation yk, or equivalently
the new observation eyk. Therefore,
bxk|k=bxk|k1+Ak
eyk
where eyk=ykHT
k
bxk|k1and
Ak= Cov(xk,eyk)Cov(eyk,eyk)1
= Cov(xkbxk|k1, HT
k(xkbxk|k1) + vk)Cov(eyk,eyk)1
= Σk|k1Hk[HT
kΣk|k1Hk+Rk]1.
1

Partial preview of the text

Download ECE 534: Random Processes - Solutions to Problem Set 6 - Prof. Rayadurgam Srikant and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

ECE 534: Random Processes Spring 2010

Solutions to Problem Set 6

3.21 Estimation for an additive Gaussian noise model The vectors x and y are jointly Gaussian since they are obtained from x and n via linear operations. Thus, the conditional distribution of x given y is a Gaussian distribution. For a given value of y, that distribution has mean ¯x + ΣxyΣ− yy^1 (y − y¯) and covariance matrix equal to Σee = Σxx − ΣxyΣ− yy^1 Σyx where ¯x = Ex, y¯ = Ey, ¯y = E[x + n] = ¯x + ¯n, Σxy = Cov(x, x + n) = Σx + Σxn = Σx, and Σyy = Cov(x + n, x + n) = Σx + Σn. The proof of the equivalent formulas is left to the reader. 3.23 Steady state gains for one-dimensional Kalman filter (a) Let bk = σ^2 k. The solution to Problem 3.22 shows that the sequence bk satisfies the recursion bk+1 = F (bk), where F (b) = bf^

2 1+b + 1, with the initial condition^ b^0 =^ σ

given. The function F is positive, strictly increasing, and bounded. Thus if bk ≤ bk+ for some k, then bk+1 = F (bk) ≤ F (bk+1) = bk+2. Therefore, if b 0 ≤ b 1 , then the sequence (bk : k ≥ 0) is monotone nondecreasing and bounded. Simlarly, if b 0 ≥ b 1 then the sequence (bk : k ≥ 0) is monotone nonincreasing and bounded. Since bounded monotone sequences have finite limits, the sequence (bk : k ≥ 0) converges.

(b) Denote the limit by b∞ (so b∞ = σ^2 ∞). Since F is a continuous function, letting k → ∞ in the equation bk+1 = F (bk) yields b∞ = F (b∞), which has the unique nonnegative solution b∞ = f 2 +

f 4 +

(c) If f = 0, the states xk are uncorrelated with variance one. The observations y 0 ,... , yk− 1 are therefore orthogonal to xk, and the variance of the error, σ^2 k, is just the variance of xk, equal to one for all k. The limiting variance of error is thus also one.

3.25 The Kalman filter for xk|k By time k we have already calculated ̂xk|k− 1. In fact, it was already done at time k − 1. The problem is to update x̂ k|k− 1 by incorporating the new observation yk, or equivalently the new observation y˜k. Therefore, x̂ k|k = x̂ k|k− 1 + Ak y˜k where ˜yk = yk − HkT ̂xk|k− 1 and Ak = Cov(xk, ˜yk)Cov(˜yk, ˜yk)−^1 = Cov(xk − ̂xk|k− 1 , HkT (xk − ̂xk|k− 1 ) + vk)Cov(y˜k, y˜k)−^1 = Σk|k− 1 Hk[HkT Σk|k− 1 Hk + Rk]−^1.

1