Prof. Rich Kozick
ELEC 320, Fall 1997

## Laboratory 6 Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT)

The development of the FFT algorithm for computing the DFT is one of the primary reasons that digital signal processing (DSP) is so common today. This lab provides a brief introduction to the DFT and FFT. The DFT and FFT are discussed in Chapter 6 of the Kamen/Heck text.

What are the DFT and FFT? The DFT provides the Fourier transform of sampled data. Just like the continuous-time Fourier transform that we have discussed in class, the DFT describes the frequency content of discrete-time signals. The FFT is a fast way to compute the DFT. Further details about the DFT and FFT will be provided during lab.

Exercises:

1. Please download the sound file hw1data.au to your directory from the Web page for this lab assignment. Read the file into Matlab, listen to it, and take the FFT with the commands:

sound(x)
X = fft(x);

The sampling rate for this signal is 8192 samples per second. You can plot the FFT magnitude versus Hertz with the MATLAB commands given below. Try to understand why these commands work.

Fs = 8192;
N = length(X);
f = (0:N-1)'/N*Fs;
plot(f, abs(X))

Which frequency (in hertz) appears to be dominant? (The imzoom command is useful to zoom-in on a figure.) Do harmonics appear to be present? Can you guess what produced this sound?

2. Some signals change their frequency content over time. An example is shown in this item, along with a tool for signal analysis called the spectrogram that is generated using the FFT.