This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms . MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING 2.161 Signal Processing  Continuous and Discrete Fall Term 2008 Solution of Problem Set 5: The Discrete Fourier Transform Assigned: October 16, 2008 Due: October 23, 2008 Problem 1: Given a signal of duration T = 0 . 128 ms, sampled at a rate of F s = 8 kHz, the number of samples is L = T f s = 1024. If only 256 samples are taken, the frequency spacing in the computed DFT is f = f s /N = 31 . 25 Hz. (a) The number of multiplications required for the direct computation of the DFT is N 2 = 256 2 = 65 , 536. (b) The number of multiplications required for the computation of the DFT using the FFT is N/ 2 log 2 ( N ) = 128 8 = 1024. Note that F m = F ( j 2 m ) = F ( j 2 f s m ). Hence, the m th component of the DFT corresponds to N T N the actual frequency of m f s = m f = 31 . 25 m Hz. N 1 + j t d f ( t ) = 2 F ( j ) e N 1 f n = f ( n t ) = N 1 F m e j mn 2 N m =0 Comparing above formulas, we can realize that, if there is a ONETOONE correspondence between discrete values of F m and continuous values of F ( j ), then at = 2 f s m the F ( j ) is a delta N function with an amplitude equal to 2 N F m . This can be verified for example for either a DC signal or a sine signal without spectral leakage . Note that to find the scale factor, we cannot use the relation between F and F ( F ( j ) = n =+ n =+ 1 1 F ( j ( n 2 f s )) = F ( j ( n s )) ). Thats because in relating F m to F , we T T n = n = assumed that the rest of the sample points are zero. On the other hand, DFT assumes that the...
View Full
Document
 Fall '08
 DerekRowell

Click to edit the document details