Digital signal processing:
Solve by MATLAB the first question, solve one time for DTFT and one time for DFT.
Question 1:
Let x[n] be a discrete time sequence:
0 elsewhere
1. Compute the 8-point DFT of x[n]. Plot the magnitude and phase [Figure 1.1].
2. Compute the 16-point DFT of x[n]. Plot the magnitude and phase [Figure 1.2].
3. Compare the graphs of 1 and 2 in one figure. Use proper axis labels and titles [Figure 1.3].
Question 2:
To prove the Convolution property of the DFT, considering the following sequences: x[n] = [-358622], y[n] = [114200].
1. Perform the linear convolution of the two sequences z = xy and show a figure [Figure 2]. For all sequences xy and z aligned vertically.
2. Compute the DFT of the two sequences x and y (name the result Xk and Yk respectively).
3. Find Zk by performing a point-by-point product of Xk and Yk. Then find the inverse DFT for the result sequence (name it zz).
4. Compare the results of 1 with the result of 3 by computing the difference in sequence power using |z - zz|^2.
Question 3:
Given the system transfer function: 1 - 2 - 1.
1. Compute the gain and plot the Z-Plane graph of this system [Figure 3.1].
2. Find the roots of the Residual Partial-Fraction Z-transform.