Ministry of High Education Course Name: Digital Signal

Al-Madina Higher Institute for Processing

Engineering and Technology Course Code: COMM 520

Sheet 3
1- Given a sequence x(n) for 0 ≤ n ≤ 3, where x(0) = 1, x(1) = 1, x(2) = -1, and x(3) = 0,
compute its DFT X(k).
2- Given a sequence x(n) for 0 ≤ n ≤ 3, where x(0) = 4, x(1) = 3, x(2) =2, and x(3) = 1,
compute its DFT X(k).
3- Given a sequence x(n) for 0 ≤ n ≤ 3, where x(0) = 0.8, x(1) = 0.6, x(2) =0.4, and x(3) =
0.6, compute its DFT X(k).
4- Given the DFT sequence X(k) for 0 ≤ k ≤ 3 obtained in Problem 2, evaluate its inverse
DFT x(n).
5- Given the DFT sequence X(k) for 0 ≤ k ≤ 3 obtained in Problem 3, evaluate its inverse
DFT x(n).
6- Consider a digital sequence sampled at the rate of 16,000 Hz. If we use the 4,000-point
DFT to compute the spectrum, determine the frequency resolution.
7- Given the sequence in Figure and assuming fs = 100 Hz, compute and draw the
amplitude spectrum, phase spectrum, and power spectrum.
 Ministry of High Education Course Name: Digital Signal
Al-Madina Higher Institute for Processing
Engineering and Technology Course Code: COMM 520

8- Given a sequence x(n) for 0 ≤ n ≤ 3, where x(0) = 0.8, x(1) = 0.6, x(2) = 0.4, and x(3) =
0.2, compute its DFT X(k) using the decimation-in-frequency FFT method, and
determine the number of complex multiplications.
9- Given the DFT sequence X(k) for 0 ≤ k ≤ 3 obtained in Problem 8, evaluate its inverse
DFT x(n) using the decimation-in-frequency FFT method.
10- Given a sequence x(n) for 0 ≤ n ≤ 3, where x(0) = 0.8, x(1) = 0.6, x(2) = 0.4, and x(3) =
0.2, compute its DFT X(k) using the decimation-in-Time FFT method, and determine
the number of complex multiplications.
11- Given the DFT sequence X(k) for 0 ≤ k ≤ 3 obtained in Problem 10, evaluate its
inverse DFT x(n) using the decimation-in-Time FFT method.
12- Given a sequence x(n) for 0 ≤ n ≤ 7, where x(0) = 1, x(1) = 2, x(2) = 3, x(3) = 4, x(4) =
5, x(5) = 6, x(6) = 7, and x(7) = 8, compute its DFT X(k) using the decimation-in-
Frequency FFT method, and determine the number of complex multiplications.
13- Given the DFT sequence X(k) for 0 ≤ k ≤ 7 obtained in Problem 12, evaluate its
inverse DFT x(n) using the decimation-in-Frequency FFT method.
14- Given a sequence x(n) for 0 ≤ n ≤ 7, where x(0) = 1, x(1) = 2, x(2) = 3, x(3) = 4, x(4) =
5, x(5) = 6, x(6) = 7, and x(7) = 8, compute its DFT X(k) using the decimation-in-
Time FFT method, and determine the number of complex multiplications.
15- Given the DFT sequence X(k) for 0 ≤ k ≤ 7 obtained in Problem 12, evaluate its
inverse DFT x(n) using the decimation-in-Time FFT method.