EE 547 Project #4 Fall 1999
This project will emphasize the practical aspects of the use of the DFT and the FFT in digital signal processing.
Exercises
function
that implements a DFT using the direct summation formula.
Note that you can eliminate one loop by using an inner product of a vector
to implement the summation.
cputime
to time this operation. Compare this to the time required for a 503-point
FFT using
fft
.
The FFT defaults to a DFT implementation because 503 points is a prime
number and incapable of being decomposed into smaller FFT's. The difference
between the FFT time and the DFT time then is simply the difference in the
efficiency of the implementation rather than a difference in the algorithm.
(In Matlab, fft
is a built-in function.)
function
that implements a linear convolution using power-of-two FFT's.
Generate two sequences of length 100 and 40. (It doesn't matter what
they are.) Convolve the two sequences with your function and with
conv
.
Compare the result to make sure they're the same, and compare the
time required to run them.
Write a short report describing your findings. The report should contain a concise description of your results. Include listings of your function. Be sure to answer all questions. You are not expected to include in the report all plots which you were required to do; instead, you should summarize in your report the salient features of the unincluded plots.
For further help: