Discrete Fourier Transform (DFT) and Its Properties: By hand (analytically), determine the DFT of the vector: x[n] = [−1 5 4].
Consider the periodic, infinite-duration sequence: x[n] cos(1n). This sequence has a period of N-20 samples. In MATLAB, construct the vector xl, which comprises the first 20 samples of this sequence (i.e., for sample indexes 0 ≤ n ≤ 20). Use the "fft" function to numerically compute the DFT of this sequence. Stem plot your results. (In general, the DFT is complex-valued and will require a separate magnitude and phase plot versus frequency index k, unless all DFT values happen to be real-valued.) In MATLAB, next construct the vector x2 using the first 25 samples of the analytic sequence (i.e., for sample indexes 0 ≤ n ≤ 25). Use the MATLAB "fft" function to numerically compute the DFT and again stem plot the results versus k. These two plot sets should look significantly different. Hand in the two sets of plots (you need not hand in the MATLAB code) and explain why the DFT representation of this signal is so different between the two DFTs.
The first five points of the eight-point DFT of a real-valued sequence are: [36 47j 10 3-j4 572 5]. Write the complete eight-point DFT sequence.