We are given a finite-length sequence x[n] of length 627 (i.e., x [n] = 0 for n 626), and we have available an FFT program that will compute the DFT of a sequence of any length N = 2^v. For the given sequence, we want to compute samples of the discrete-time Fourier transform at frequencies

Specify how to obtain a new sequence y[n] from x[n] from x[n] such that the desired frequency samples can be obtained by applying the available FFT program to y[n] with v as small as possible.

Transcribed Image Text:

2nk k = 0, 1. ..., 255. wk 627 256'