Вы находитесь на странице: 1из 3

ECE 531: Detection and Estimation Theory, Spring 2011 Homework 10

Problem 1 (4.6 Luke Vercimak) The this is a known signal in WGN. Per eq 4.3, the test statistic will be: T (x) = In this case (s[n] = Ar n ): E= For 0 < r < 1: = A2
N 1 n=0 N 1 n=0

x[n]s[n] >

s2 [n] = A2

N 1 n=0

r 2n

N 1 n=0

r 2n

A2 as N 1 r2

Therefore as we gain additional samples, the detector performance will approach a constant. (obtained by plugging E into 4.14). For r = 1: = A2
N 1 n=0

r 2n = N A2 as N

Per Eq 4.14, PD will approach 1 as N For r > 1: =A


2 N 1 n=0

r 2n as N

Per Eq 4.14, PD will approach 1 as N For all cases, the detector threshold can be determined by plugging E into: = 2 EQ1 (PF A )

Problem 2 (4.10 Shu Wang)

V T CV = V T = V 1 C = V V 1 = V V T C 1 = V 1 V T C 1 = D T D D = 1 V T First, we need to calculate the eigenvalues of C. det(I C) = 0, it is easy to get = 1 . Then it is easy to nd the matrix of eigenvectors. VT =V =
1 2 1 2 1 1+ 1 2 1 2

1 =

0
1 1

D=

1 2(1+) 1 2(1)

1 2(1+) 1 2(1)

Problem 3 (4.19 Siyao Gu) Since s0 [0] = s1 [0] = 1, we can concentrate planning the decision regions around s0 [1] and s1 [1]. The test can be simplied to T The NP test becomes p(x; H1 ) H0 P (H0 ) = p(x; H0 ) H1 P (H1 p(x; H1 ) = p(x; H0 )
1 2 1 2

N (1, 2 ) N (1, 2 )

under H0 under H1

(1)

(2)

exp( (x[1]1) ) 2 exp( (x[1]+1) ) 2


2

(3) (4) (5)

(x2 [1] 2x[1] + 1) (x2 [1] + 2x[1] + 1) 2 2 H0 P (H0 ) p(x; H1 ) = exp[2x[1]] p(x; H0 ) H1 P (H1 ) = exp 2

x[1]

H0 H1

1 P (H0 ) ln 2 P (H1 )

(6)

Thus the line running through x[1] and perpendicular to the line running between s0 and s1 is the chosen decision boundary. This would be a 0-slope line. If P (H0 ) = P (H1 ), the boundary would be x[1] = 0. Problem 4 (4.24 Shu Wang) N 1 According to the text book, we have Ti (x) = n=0 x[n]si [n] 1 i . We need to choose Hi to make 2 Ti (x) to be the maximum statistic. The block diagram of the optimal receiver is on page 120, gure 4.13. When M = 2, according to eq 4.25, we have: (1 s ) ) 2 2

Pe = Q(

If we want to minimize Pe , we need to minimize s . sT s0 1 1 T (s1 s1 + sT s0 ) 0 2 N A0 A1 = 1 2 2 2 (A0 + A1 )

s =

|s | 1 So when A0 = A1 , s = 1 is minimum. Then Pe is minimum.

Вам также может понравиться