• Tidak ada hasil yang ditemukan

EE6110 Adaptive Signal Processing Problem Set 3 Solutions

N/A
N/A
Protected

Academic year: 2025

Membagikan "EE6110 Adaptive Signal Processing Problem Set 3 Solutions"

Copied!
3
0
0

Teks penuh

(1)

EE6110 Adaptive Signal Processing Problem Set 3 Solutions

1.

Xˆ =K0Y, whereK0 is any solution to K0RY =RXY

We want to minimize E[( ˜X)HWX˜] for some W ≥0 ( ˜X =X−Xˆ, Xˆ =KY)

E[( ˜X)HWX˜] =E[(X−KY)HW(X−KY)]

=E[(X−K0Y+K0Y−KY)HW(X−K0Y+K0Y−KY)]

=E[(X−K0Y)HW(X−K0Y)] +E[(X−K0Y)HW(K0Y−KY)]

+E[(K0Y−KY)HW(X−K0Y)] +E[(K0Y−KY)HW(K0Y−KY)]→eqn

We know that K0Y is the linear MMSE estimate ofX from Y

Therefore, we know (X−K0Y) is perpendicular to any linear function ofY

=⇒ second term in the eqn

E[(X−K0Y)HW(K0Y−KY)] =E[(X−K0Y)H(W(K0−K))Y] = 0 Also,E[(K0Y−KY)HW(X−K0Y)] = 0

=⇒ E[( ˜X)HWX˜] =E[(X−K0Y)HW(X−K0Y)] +E[(K0Y−KY)HW(K0Y−KY)]

Both the terms in the right hand side of the above equation are ≥0, (since W ≥0 =⇒ aHWa≥0,∀a)

=⇒ E[( ˜X)HWX˜]≥E[(X−K0Y)HW(X−K0Y)]

This lower bound is achieved by K =K0 i.e the linear MMSE estimate K0Y also minimizes E[( ˜X)HWX˜] for anyW ≥0

2.

J(x) = (x−c)HA(x−c)

Since A is Hermitian nonnegative-definite, J(x)≥0 1

(2)

=⇒ minimum possible value of J(x) is 0.

Forx=c+d where Ad=0,

J(x) = (c+d−c)HA(c+d−c) = dHAd=dH0= 0

ThusJ(x) = 0 is acheived at x=c+d for any d satisfying Ad=0

3.

Y1 =X1+N1, X1 is zero mean, variance 1

Y2 =X2+N2 , N1, N2 i.i.d zero mean ,variance σ2, independent of X1

X2 =ρX1+p

1−ρ2Z,

Z is zero mean, variance 1, independent of X1, X2, N1, N2 E[X22] =ρ2 + 1−ρ2 = 1

(a) EstimateX1 fromY1

1 =k0Y1, k0(1 +σ2) = 1

=⇒ Xˆ1 = (1+σY12)

(b) EstimateX2 fromY1

21 =ρXˆ1 = (1+σρY12)

(c) EstimateY2 fromY1

2 =kY1, k(1 +σ2) =RY1Y2 =E[X1X2] =ρ Yˆ2 = ˆX2+ ˆN2 =ρXˆ1 = (1+σρY12)

=⇒ Yˆ2 = (1+σρY12)

(d) LetE2 =Y2−Yˆ2 =Y2ρY1

(1+σ2)

EstimateX2 fromE2

2e=keE2, keRE2 =RE2X2

2

(3)

RE2X2 =E[(Y2(1+σρY12))X2] = 1− (1+σρ22)

RE2 =E[(Y2−Yˆ2)(Y2−Yˆ2)]

=E[(Y2)(Y2−Yˆ2)] →(1)

=E[Y22]−E[Y22]

= (1 +σ2)− ρ

(1 +σ2)E[Y2Y1]

= 1 +σ2− ρ

(1 +σ2)E[X2X1]

= 1 +σ2− ρ2 (1 +σ2)

(1) comes from the fact that (Y2−Yˆ2)⊥AY1 =⇒ (Y2−Yˆ2)⊥Yˆ2

So, ke = 1−

ρ2 (1+σ2)

1+σ2 ρ

2 (1+σ2)

=⇒ Xˆ2e= 1−

ρ2 (1+σ2)

1+σ2 ρ

2 (1+σ2)

(Y2ρY1

(1+σ2)) (e)

2 = ˆX21+ ˆX2e = ρY1

(1 +σ2) + 1−(1+σρ22) 1 +σ2ρ2

(1+σ2)

(Y2− ρY1 (1 +σ2))

= σ2

1 +σ2ρ2

(1+σ2)

! ρY1

(1 +σ2)

+ 1− ρ2

(1+σ2)

1 +σ2ρ2

(1+σ2)

! Y2

=

ρσ2 (1 +σ2)2−ρ2

Y1+

1 +σ2−ρ2 (1 +σ2)2−ρ2

Y2

This can also be done directly by using ˆX2 =h k0i

"

Y1 Y2

#

h k0

i

=RX2YR−1Y

=h ρ 1i

"

(1 +σ2) ρ ρ (1 +σ2)

#−1

=h ρ 1i

"

(1 +σ2) −ρ

−ρ (1 +σ2)

#

1 (1 +σ2)2−ρ2

=⇒ Xˆ2 =

ρσ2 (1+σ2)2−ρ2

Y1+

1+σ2−ρ2 (1+σ2)2−ρ2

Y2

3

Referensi

Dokumen terkait

The linear prediction filter plays a key role in adaptive filtering because it is directly involved in the derivation and implementation of least squares (LS) algorithms, which in

Similar to the first step, in this step the minimum value of SNR is determined where the method is still suitable for obtaining a perfect probability of correct estimation Pce =100% for

From the analysis it is understood that through the optimal threshold value reliable detection of fault under varying fault location and inception time is possible.. 6.FDI generated by

Sampling method 2 • Problem is solved by choosing a sample rate of 2.5 times the largest frequency of interest • Using an antialiasing filter low-pass sharp-cutoff filter Aliasing

Model this situation as a Bayesian game and show that in any Nash equilibrium the highest prize that either individual is will- ing to exchange is the smallest possible prize.. 3

Step 3: Making assignment on zero elements because in given situation optimal assignment is not possible then we draw minimum no of horizontal or vertical lines to cover all zeros then

However from the graph, the time difference between maximum and minimum frequencies for detectors 1 and 2 is tfmin−tfmax =9s This is possible only if one detector is inside and other

2 For each data item 0, if transaction Ti executes read 0 in schedule S, and if that value was prodqced by a write 0 operation executed by transaction Tj, then the read 0 operation of