Assignment 6: E1 244 - Detection and Estimation Theory (Jan 2023) Due Date: April 15, 2023 Total Marks: 40

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

E1 244 - Detection and Estimation Theory (Jan 2023)

Assignment 6 Due Date: April 15, 2023


Total Marks: 40

General Assignment Guidelines:


• Submission via Teams: Assignments will be allocated to you via the Teams “Assignments” feature. You
will have to upload your answer sheet via the same feature in Teams. Answer sheets sent to me or
the TAs by e-mail will not be considered. Please familiarize yourself with this feature.
• Late Submission Policy: Assignment submission beyond the deadline is allowed as per the below policy:

– Delay of 24 hours will attract 20% penalty


– Delay of 48 hours will attract 40% penalty
– Delay of 72 hours days will attract 60% penalty
– Assignments submitted beyond 72 hours will not be considered

The upload time reflected in the Teams will be considered as final. You are highly encouraged
to upload your answer sheets well before the deadline so that any potential connection/technical issues
can be resolved in time (recommended time is at least 1 hour before the deadline).
• File Logistics: You can scan your handwritten answers, or use a tablet, or typeset your answers in Latex.
Following logistics should be followed while uploading the answer sheet:

– Make sure your scans are properly visible. You can try using some scan apps (Ex. AdobeScan) to
get better results.
– The total file size should not be too large (ideally, less than 5 Mb). You can use available
apps/softwares to reduce the file size. Make sure that the answers are clearly visible while re-
ducing the size.
– Only a single pdf file is allowed to be uploaded (other formats will not be accepted).
– The order of answers in your file should be in the same as the order of questions. Check that you
have included all the pages in your file before uploading it.
– Name you file as: DET Assignmentx FirstName, where x is the assignment number (x=1,2,...)
– Mention your name, course name and submission date on the first page.
• Collaboration Policy: You are allowed to discuss the concepts/questions with your classmates. However,
the final answer should be as per your own understanding. Merely copying solutions from class-
mates/online sources will attract significant penalty and strict disciplinary action (refer to Section 13.2
and 13.3 of the IISc student information handbook - link). If you have collaborated/discussed with other
classmates or referred some online resource for a particular question, clearly mention the names of
the classmates/online resource at the beginning of your answer.

All questions carry equal marks but are not equally difficult, so you may want to strategize accordingly.

Problem 1 Let yk ∼ Poisson(θ) for k = 1, 2, · · · , N be i.i.d. random variables with θ > 0 being an unknown
parameter. We wish to estimate the parameter λ, where λ = e−θ .
PN
(a) Show that T (y) = k=1 yk is a sufficient statistics for estimating λ.
PN
(b) Show that λ̂1 (y) = N1 k=1 1{yk =0} is an unbiased estimator of λ.
T (y)
(c) Assuming T (y) is complete, show that λ̂2 (y) = NN−1 is an MVU estimator of λ.

Problem 2
(a) Let f1 and f2 be two pdfs with disjoint supports Ȳ1 and Ȳ2 . Consider the mixture distribution f (y; θ) =
θf1 (y) + (1 − θ)f2 (y), where θ ∈ [0, 1]. Use the Neyman-Fisher factorization theorem to show that T (y) =
1{y∈Ȳ1 } is a sufficient statistics for θ.
(b) Let yk be i.i.d. random variables for k = 1, 2 · · · , N , each with density f (yk ; x) = (x − 1)yk−x 1{yk ≥1} . Find
a sufficient statistics for x that is complete and justify your answer.

1
Problem 3 A coin is tossed independently N times and the observation yk is 1 if heads is observed, and 0
otherwise for k = 1, 2, · · · , N . Let p = Pr(yk = 1).
(a) Find the MVU estimate of p.
(b) Find the ML estimate of p and find its bias and covariance.
(c) Find the CRB and compare it with parts (a) and (b).

Problem 4 Let y1 , y2 , · · · , yN be i.i.d. observations with the log-normal pdf given by


1 2
e[− 2 (ln(yk )−θ) ] 1{yk ≥0} .
1
f (yk ; θ) = √
2πyk
We wish to compute the BLUE of θ.
(a) Show that the mean is e(θ+0.5) , and therefore, the unbiasedness constraint for BLUE cannot be satisfied.
(b) Use transformation of random variables zk = ln yk to find the BLUE of θ.

You might also like