X[n] is a 1024-point sequence that is nonzero only for 0 ? n ? 1023. Let X[k]

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], 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].

image

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Discrete Time Signal Processing

ISBN: 978-0137549207

2nd Edition

Authors: Alan V. Oppenheim, Rolan W. Schafer

Question Posted: