Chap8Chapter 8 The Discrete Fourier Transform (DFT).doc

Chap.8 The Discrete Fourier Transform (DFT) 8.0 Introduction The DFT is itself a sequence rather than a function of a continuous variable, and it corresponds to samples, equally spaced in frequency, of the Fourier transform of the signal. ( Fourier Series representation of periodic sequences The DFT of a N-point sequence 8.1 Representation of the periodic Sequences: The Discrete Fourier Series Denotation: a periodic sequence with period N, so that for any integer value of r. e k[n] = e j(2(/N)kn = e k[n + rN] (8.1) periodic complex exponentials. So the periodic sequence can be represented as the Fourier series: (8.2) for continuous-time periodic signal: , n=0,(1,(2,… infinitely many harmonically related complex exponentials; for discrete-time periodic signal: (8.3) only N harmonically related complex exponentials; (8.4) To obtain the sequence of Fourier series coefficients from the periodic sequence, exploiting the orthogonality of the set of complex exponentials sequence: (8.5) (8.6) Because: (8.7) So: (8.9) Note that the sequenceis periodic with period N: . For convenience in notation: (8.10) the DFS analysis/synthesis pair is expressed as follows: (8.11) (8.12) Notation: (8.13) Example 8.1: periodic impulse train: (8.14) The DFS coefficients are: (8.15) so: (8.16) Example 8.2: periodic sequence with period N=10 Figure 8.1 periodic sequence with period N=10 for which the Fourier series representation is to be computed (8.17) (8.18) So the magnitude and phase are sketched in Fig.8.2: Figure 8.2 Magnitude and phase of the Fourier series coefficients of the sequence The periodic sequence has a convenient interpret