


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Problem set 6 for the ece 434 - random processes course offered in spring 2003. The problems cover various topics such as cross spectral density, stationary markov processes, linear estimation, approximation of white noise, and simulating baseband random processes. Students are expected to solve these problems using the concepts learned in the course.
Typology: Assignments
1 / 4
This page cannot be seen from the preview
Don't miss anything!



PROBLEM SET 6 Due Wednesday, April 23
Random Processes in Linear Systems and Spectral Analysis
Assigned Reading: Chapter 6 of the course notes.
Reminder: The second hour exam will be given Monday, April 14, 7-8:15 p.m. in Room 269 Everitt Lab. Problems to be handed in:
P =
( 1 − p p p 1 − p
) ,
where 0 < p < 1. Find the mean, correlation function and power spectral density function of X. (Hint: For nonnegative integers k:
P k^ =
( 1 2
1 1 2 2
1 2
)
( 1 2 −^
1 2 − (^1212)
) .
2 σ^2 , which is minimized with respect to z by z = z σo 2 .)
Nt = AT
∑^ ∞ −∞
pT (t − nT )Bn
where
pT (s) =
{ 1 0 ≤ s ≤ T 0 else
and AT is a constant depending on T. (a) Sketch a typical sample path of N and express E[|
∫ (^1) 0 Nsds|
(^2) ] in terms of AT , T and σ (^2). For simplicity assume that T = (^) K^1 for some large integer K. (b) What choice of AT makes the expectation found in part (a) equal to σ^2? This choice makes N a good approximation to a continuous-time white noise process with autocorrelation function σ^2 δ(τ ). (c) What happens to the expectation found in part (a) as T → 0 if AT = 1 for all T?
SX (2πf ) =
{ 1 if |f | ≤ 0. 5 0 else
is to be simulated over the time interval [− 500 , 500] through use of the sampling theorem with sampling time T = 1. (a) What is the joint distribution of the samples, Xn : n ∈ Z? (b) Of course a computer cannot generate infinitely many random variables in a finite amount of time. Therefore, consider approximating X by X(N^ )^ defined by
X( t N^ )=
∑^ N
n=−N
Xnsinc(t − n)
Find a condition on N to guarantee that E[(Xt − X( t N^ ))^2 ] ≤ 0 .01 for t ∈ [− 500 , 500]. (Hint: Use |sinc(τ )| ≤ (^) π^1 |τ | and bound series by an integral. Your choice of N should not depend on t because the same N should work for all t in the interval [− 500 , 500] ).
Extra Credit Problems 6 (Not Required) Prof. B. Hajek Same due date as Problem Set 6 Spring 2003
Xt =
∑^ ∞ −∞
g(t − nT )Bn.
Show that X is a cyclostationary random process. Find the mean function and autocorrelation function of X in terms g, T , and the mean and autocorrelation function of B. If your answer is complicated, identify special cases which make the answer nice. (d) Suppose Y is defined as in part (b) for the specific X defined in part (c). Express the mean μY , autocorrelation function RY , and power spectral density SY in terms of g, T , μB , and SB.