Assignment on Detection and Estimation Theory | ECE 561, Assignments of Electrical and Electronics Engineering

Material Type: Assignment; Class: Detection & Estimation Theory; Subject: Electrical and Computer Engr; University: University of Illinois - Urbana-Champaign; Term: Spring 2009;

Typology: Assignments

Pre 2010

Uploaded on 02/24/2010

koofers-user-c13
koofers-user-c13 🇺🇸

5

(1)

8 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 561: Detection and Estimation Theory
Spring 2009
Issued: February 28, 2009
March 15, 2009
1)
Binary frequency shift keying (FSK) on a Rayleigh fading channel can
be modeled in terms of a four-dimensional observation vector Y, where
Y=X+Z, and where Zis a zero-mean Gaussian vector, with covariance
matrix σ2I4×4. Under hypothesis H0, we have X=[X1X20 0], while
under hypothesis H1, we have X=[0 0 X3X4]. The Xiare independent,
identically-distributed, standard Gaussian random variables. Also, the
two hypotheses are equally likely.
a) Find the maximum likelihood rule for the receiver.
b) Find the probabilities of false alarm and miss for the maximum likeli-
hood decision rule.
2)
Consider the composite binary hypothesis testing problem for which
fx(y) = xexp{−xy}, y 0
and
fx(y)=0, y < 0,
where x[1,).
a) For α(0,1), show that a UMP test of level αexists for testing the
hypotheses H0:X0= [1,2), and H1:X1= [2,). Express the test ratio
as a function of α.
b) Assume that the conditional distribution described above is Laplacian
instead, with mean x[0,) and parameter λ= 1. Does there exist a
UMP test for H0:X0={0}, and H1:X1= (0,)?
3)
Consider the following two forms of generalized maximum likelihood tests
for two composite hypotheses:
a)maxx∈X1fx(y)
maxx∈X0fx(y);
1
pf2

Partial preview of the text

Download Assignment on Detection and Estimation Theory | ECE 561 and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

ECE 561: Detection and Estimation Theory

Spring 2009

Issued: February 28, 2009

March 15, 2009

Binary frequency shift keying (FSK) on a Rayleigh fading channel can be modeled in terms of a four-dimensional observation vector Y, where Y= X+ Z, and where Z is a zero-mean Gaussian vector, with covariance matrix σ^2 I 4 × 4. Under hypothesis H 0 , we have X=[X 1 X 2 0 0], while under hypothesis H 1 , we have X=[0 0 X 3 X 4 ]. The Xi are independent, identically-distributed, standard Gaussian random variables. Also, the two hypotheses are equally likely. a) Find the maximum likelihood rule for the receiver. b) Find the probabilities of false alarm and miss for the maximum likeli- hood decision rule.

    Consider the composite binary hypothesis testing problem for which

fx(y) = x exp{−xy}, y ≥ 0

and fx(y) = 0, y < 0 , where x ∈ [1, ∞). a) For α ∈ (0, 1), show that a UMP test of level α exists for testing the hypotheses H 0 : X 0 = [1, 2), and H 1 : X 1 = [2, ∞). Express the test ratio as a function of α. b) Assume that the conditional distribution described above is Laplacian instead, with mean x ∈ [0, ∞) and parameter λ = 1. Does there exist a UMP test for H 0 : X 0 = { 0 }, and H 1 : X 1 = (0, ∞)?

    Consider the following two forms of generalized maximum likelihood tests for two composite hypotheses: a) maxmaxxx∈X∈X^1 fx(y) 0 fx(y)^

b) E E[[ffxx((yy))/x/x∈X∈X^10 ]] ; Give two examples for the sets X 0 and X 1 and the conditional distribu- tions, and evaluate the probabilities of false alarm under the two tests, for adequately chosen threshold.

    Let f be a convex function. The Legendre transform is defined as L(f )(p) = maxx(p · x − f (x)). a) Find the Legedre transform of f (x) = x^2. b) Show that the Legendre transform is a convex function of p. c) Let g(p) be the Legendre transform of the function f. Then, d/dp g(p) = x(p), where x(p) is the solution of the equation p = d/dx f (x). d) Show that the Legendre transform is an involution. e) Two convex functions f and g are said to be dual in the Young sense if one is the Legendre transform of the other. Show that two Young dual functions have to satisfy p · x ≤ f (x) + g(p). f) Can you find a practical example for the use of Legendre transforms?
    Prove Cramer’s theorem, which asserts that for a sequence of random variables {Zk, k ≥ 1 },

lim N →∞

N

log P {SN ≥ z} = −L(G(x))(z)

where SN = (^) N^1

∑N

k=1 Zk, and^ G(x) = log^ E[exp{x Z}].

    Explain how you would use Cramer’s theorem in evaluating the asymp- totic performance of likelihood tests for which SN represents a sufficient statistics.