Question: X[n] is a 1024-point sequence that is nonzero only for 0 ? n ? 1023. Let X[k] be the 1024-point DFT of x[n]. Given X[k],

X[n] is a 1024-point sequence that is nonzero only for 0 ? n ? 1023. Let X[k] be the 1024-point DFT of x[n]. Given X[k], we want to compute x[n] in the ranges 0 ? n ? 3 and 1020 ? 1023 using the system in Figure. Note that the input to the system is the sequence of DFT coefficients. By selecting m1[k], m2[k], and h[k], show how the system can be used to compute the desired samples of x[n]. Note that the samples y[n] for 0 ? n ? 7 must contain the desired samples of x[n].

h{n} y[n] x[n] m[n] ma{n}

h{n} y[n] x[n] m[n] ma{n}

Step by Step Solution

3.53 Rating (163 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

This problem asks that we find eight equally spaced inverse DFT coef... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

30-E-T-E-D-S-P (422).docx

120 KBs Word File

Students Have Also Explored These Related Telecommunication Engineering Questions!