

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
A laboratory experiment focused on enhancing students' comprehension of the fast fourier transform (fft) algorithm and discrete-time convolution through the use of matlab. Students will find the discrete fourier transform (dft) of various discrete-time signals, recover original signals using the inverse discrete fourier transform (idft), and evaluate continuous-time fourier transforms using the sampling theorem. They will also learn about circular convolution.
Typology: Exercises
1 / 2
This page cannot be seen from the preview
Don't miss anything!
9.8 Laboratory Experiment on Signal Processing
Purpose : By performing this experiment, the student will receive a better understanding of the use and power of the FFT algorithm in evaluating the corresponding discrete (time) Fourier transforms, continuous-time Fourier transform, and discrete-time convolution. As the computational tool, we will use the MATLAB functions fft and ifft.
Part 1. In this part we use the FFT algorithm, as implemented in MATLAB, to find the DFT of some discrete-time signals. In addition, we demonstrate the use of the IFFT in recovering original discrete-time signals.
(a) Consider the discrete-time signal
and find analytically its DTFT.
(b) Use the MATLAB function X=fft(x,N) to find the DFT of the preceding signal for ' )(^ !* + + , ( . Use the MATLAB function x=ifft(X,N) to recover the original discrete-time signal. Plot the DFTs and IDFTs, and comment on the results obtained.
(c) Consider the signal
and repeat parts (a) and (b).
(d) Consider the signal whose nonzero values are between 45^ and 4^ *, respectively defined by /6^ (7 ( 8 + #9 ;:^ , and repeat parts (a) and (b). Comment on the results obtained.
Part 2. Formula (9.71), <>=@?A#BDCFEHG<DI+=@?KJ#B , can be used for an approximate evaluation of the continuous-time Fourier transform. In this formula, E G is the sampling interval used for sampling the continuous-time signal =MLNB^ into =E GBPO^ -^ ^ , and < I=@?KJ#B (^) is the corresponding DFT.
(a) Consider the continuous-time signals presented in Figures 3.22 and 3.23. Sample these signals with EHG ^12 and find DFTs of the obtained discrete-time signals. Calculate and plot the corresponding magnitude spectra for the approximate Fourier transforms and compare them to the results obtained analytically.
(b) Repeat part (a) with E G ^1 . Part 3. Discrete-time signal convolution can be efficiently evaluated via the DTFT and its convolution property. The relation QR6 -^ TSVUW^ ^ implies XY=M? JZB <P=8?KJ#B![P=M?]&^V_-Vab^V_-
JZB. Hence, discrete-time convolution via DFT can be evaluated as Q \ =
(^) Wc (^) B ^V_-`^ =
(^) Bd. Note that such an obtained signal Q c (^) is, in general,
Docsity.com
the wrapped signal, so that the corresponding convolution is called mod- e circular convolution [1].
Use the formula to find the convolution of the discrete-time signals defined in Problems 6.15 and 6.16. Do the results obtained represent unwrapped or wrapped signals?
SUPPLEMENT:
2 t
-1 0 2
-1 0
1
t
1
x (^) 1 (t) x 2 (t)
FIGURE 3.22: Two Fourier transformable signals
x 1 (t) x 2 (t)
t
t
-2 0 2
-1 1
2
(a) (b)
1
0
FIGURE 3.23: Time domain signals
Discrete-time signals in Problem 6.15 are defined as
fgh ijkmlno
np
q i Yk0r s q iYk^ q q iYk0t r uv&wx+y&z#{%|&x~}
f hijk.~
i Ykr s tiYkt r uv&wxy&z#{%|&x
Discrete-time signals in Problem 6.16 are defined as
f ghcijk
l n n n onn
n n n n n p
s t i k (^) s q t ikr q ik q s q ikt
ik^ r uv&wxy!z#{%|&x
f h cijk l n onn
n n n p
q i kr tik q
ikt tik ru v!wxy!z#{2|!x
Docsity.com