南京理工大学数字信号处理英文课件 Lecture18.ppt

250 * Discrete Fourier Series Discrete Fourier Series (DFS) and DTFT of periodic sequences Relationship between DTFT of finite-length sequences and DFS of periodic sequences Properties of DFS Sampling of DTFT Lecture 18 Discrete Fourier Transform ( I ) ? x(n) －∞n +∞, non-period ? Fourier Transform ? Z-transform ? If 0≤n ≤N－1 ? Discrete Fourier Transform (DFT) Importance: (1) Theoretical, a kind of Fourier transform of a signal; (2) Role in the implementation of a variety of digital signal processing Introduction A. Discrete Fourier Series For periodic sequences: Discrete Fourier Series representation: ? Only N terms: there are only N different frequencies of period N ? definition: WN = e－j 2π/N, then: A.1 Discrete Fourier Series Coefficients ? Periodic sequence with period N ? Examples: The upper is time sequences, the left down is the weight of calculating each coef. A.2 Discrete Fourier Series: illustration A.3 Discrete Fourier Series: Properties linearity: with the same period shift: duality: periodic convolution: ? symmetry properties For a real period sequence: A.3 Discrete Fourier Series: Properties ( II ) B. DTFT of Periodic Sequences For periodic sequences: not square-summable or absolutely summable; while: ? Discrete-Time Fourier Transform: if Then Spectrum made of impulses with weights given by the DFS DFS ? Let a length-N sequence x[n] be periodized with period N : Where ? In the DTFT domain: So that C. Relation between DTFT and DFS Example: periodize Sampling DTFT and DFS: illustration * * *