Discrete-Time Fourier Transform (DTFT) 2.4 2000/07/18 2002/05/03 00:00:00.004 GMT-5 Don Johnson dhj@rice.edu CJ Ganier seejaie@rice.edu Don Johnson dhj@rice.edu discrete-time Fourier Transform Computing the Fourier Transform is made simpler by the symmetry of the signal's conjugate and the properties of real-valued signals. Now that we have the underpinnings of digital computation, we need to return to signal processing ideas. The most prominent of which is, of course, the Fourier transform. The Fourier transform of a sequence is defined to be Fourier Transform S 2 f n sn 2 f n Frequency here has no units. As should be expected, this definition is linear, with the transform of a sum of signals equaling the sum of their transforms. Real-valued signals have conjugate-symmetric spectra: S 2 f S 2 f . A special property of the discrete-time Fourier transform is that it is periodic with period one: S 2 f 1 S 2 f . Derive this property from the definition of the DTFT. S 2 f 1 n s n 2 f 1 n n 2 n s n 2 f n n s n 2 f n S 2 f Because of this periodicity, we need only plot the spectrum over one period to understand completely the spectrum's structure; typically, we plot the spectrum over the frequency range 12 12 . When the signal is real-valued, we can further simplify our plotting chores by showing the spectrum only over 0 12 ; the spectrum at negative frequencies can be derived from positive-frequency spectral values.