x[n] is a real-valued finite length sequence of length 1024, i.e.,
x[n] = 0 n < 0, n ≥ 1023.
Only the following samples of the 1024-point DFT of x[n] are known
X[k] k = 0, 16, 16 × 2, 16 × 3, ..., 16 × (64 − 1)
Also, we observe s[n] which is a corrupted version of x[n], with first 64 points corrupted, i.e., s[n] = x[n] for n ≥ 64, and s[n] ≠ x[n], for 0 ≤ n ≤ 63. Describe a procedure to recover the first 64 samples of x[n] using only 1024-point DFT and IDFT blocks, multipliers, and adders.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.