Scribd
Upload
26 views2 pages

Dtftproblems

The document discusses computing the discrete-time Fourier transform (DTFT) and discrete Fourier transform (DFT) of several signals. It also discusses using the Fourier transform and fast Fourier transform (FFT) to analyze signals and systems in both the continuous and discrete time domains. Several examples are provided to compare the exact DTFT, DFT, and Fourier transform to approximations obtained using MATLAB.

Uploaded by

Jeremiash Foronda
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views2 pages

Dtftproblems

The document discusses computing the discrete-time Fourier transform (DTFT) and discrete Fourier transform (DFT) of several signals. It also discusses using the Fourier transform and fast Fourier transform (FFT) to analyze signals and systems in both the continuous and discrete time domains. Several examples are provided to compare the exact DTFT, DFT, and Fourier transform to approximations obtained using MATLAB.

Uploaded by

Jeremiash Foronda
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DTFT and DFT: 1. Compute the DTFT of the following signals and sketch X().

a) x[n] = [1/4 1/4 1/4 1/4] b) x[n] = [1 -2 1]

3 c) x[ n] = 2 u[ n] 4
2. Compute by hand calculations the DFT of the signals given in Problem 1 a) and b) and compare your answers to those found in Problem 1. 3. Use MATLAB to compute the DFT of the signals in Problem 2. In order to increase your accuracy, pad the signals with zeros (for example. if you want to plot an additional 10 points, then add 10 zeros). For the signal in part c), compute the DFT for three cases: truncating the signal at N = 5, N = 10 and at N = 20. In each case, compare your answers to those found in Problem 1 by plotting the magnitude of both versus frequency. 4. Find the response of the following systems to the input below. Sketch the magnitude of each frequency response for -<< and determine the type of filter.
x[ n] = 2 + 2 cos( n / 4) + cos( n2 / 3 + / 2)

a) H () = e j cos( / 2) b) H () = e j / 2 (1 cos( / 2)) 5. Find the DTFT and the DFT of x[n] = [1 -1]. Sketch X() for - < < . 6. The DTFT for an 6 point signal, x[n], is shown below. Indicate on the plot the values of the DFT.
1 0.8 0.6 |X| 0.4 0.2 0 0 1 2 3 4 3 angle X 2 1 0 4 5 6 7 0

7. Use the FFT to approximate the Fourier Transform of x(t) = 4e-tu(t). Consider the following cases: i) Sampling period T = 1, N = 10. ii) Sampling period T = 1, N = 20. iii) Sampling period T = 0.5, N = 20. iv) Sampling period T = 0.1, N = 100. Use MATLAB to compute and plot the approximations of |X()| for each of these cases (use the symbol o to denote the approximation) along with the actual |X()| for comparison. 8. Consider the continuous-time signal x(t) = 2e-2tu(t). You wish to use the FFT to approximate X(). a) Determine the frequency B such that | X()|< 0.02|X(0)|. The frequency content of x(t) is negligible above this value. b) Determine an appropriate minimum value for the sampling period T from the information determined in part a). c) Using the value of T determined in part b), determine the number of points N of x(t) to be sampled so that the resolution of the approximation from the FFT is = 0.2 rad/sec. d) Sketch | X()| and your approximation of it obtained using the FFT. (You do not need to actually compute the approximation, just estimate how it might look.) e) Use MATLAB to compute and plot the approximation along with the actual plot of |X()|.

You might also like