EE384 Lab 3 Solved

Description

Problem 1: Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT) The DFT of a sequence x(n) with length N is defined:

Where 𝑊 = 𝑒−𝑗(2𝜋/𝑁)

The inverse DFT is given by:

The Fast Fourier transform (FFT) is an efficient algorithm to compute the DFT.

1. Use ‘fft’ function to calculate the Fourier Transform of a sequence, x = [1, 2, 3, 4, 5, 6, 7, 8].
2. Use ‘ifft’ function to calculate the inverse Fourier Transform of the result you get in (a).
3. Re-do (a) and (b) using your own DFT and inverse DFT functions.

Problem 2: Analyze the signal in the frequency domain

It is difficult to identify the frequency components by looking at the original signal in the time domain.

We can analyze the signal in the frequency domain using Matlab tools or FFT.

Let the sampling frequency fs be 8 kHz, and the time t varies from 0 to 1 second.

1. Create and plot the signal 𝑦(𝑡) = sin(2𝜋𝑓₁𝑡) + sin(2𝜋𝑓₂𝑡) where 𝑓₁ = 697 𝐻𝑧 and 𝑓₂ = 1209 𝐻𝑧. Properly zoom-in so that we can see the sine wave pattern in your plot.
2. Plot the frequency spectrum of 𝑦(𝑡) using Matlab’s spectral estimation tool. Put markers in the plot to show the main frequency components of the signal.
3. Re-do (b) using Matlab’s sptool.
4. Re-do (b) using FFT. Properly label your axis.