Chapter5-Finite-lengthDiscreteTransformA资料.ppt

Chapter 5 Finite-LengthDiscrete Transforms Part A: Discrete Fourier Transform (DFT) Definition Matrix Relations DFT Computation Using MATLAB Relation between DTFT and DFT and their inverses twiddle factor (旋转因子) 长度为L的序列x[n]的N点DFT L和N可以相等，也可以不等；若LN, 可以对输入序列补零，使补零后序列长度等于N Homework Problems: 5.2，5.9，5.10, 5.20, 5.25，5.28, 5.43，5.45, 5.55 4.2 Sampling the DTFT 4.2 Sampling the DTFT 1 2 M-1 n 0 0 1 2 N n the length of x(n) M-1 1 2 M-1 n 0 0 1 2 N n the length of x(n) 4.2 Sampling the DTFT 1 2 M-1 n 0 0 1 2 N n the length of x(n) 4.2 Sampling the DTFT 0 1 2 3 4 5 0 1 2 3 4 5 0 1 2 3 4 5 x(n+4) x(n) x(n-4) y(n) 4 6 2 3 4.3 Numerical Computation of theDTFT using DFT 4.3 Numerical Computation of theDTFT using DFT 通过末尾补零增加序列长度 4.3 Numerical Computation of theDTFT using DFT Example * * Review of Transforms Ch.5 Finite-Length Discrete Transforms Part A: Discrete Fourier Transform (DFT) Part B: Operations on Finite-Length Sequences and Discrete Fourier Transform Properties 5.2 The Discrete Fourier Transform 5.3 Relation Between the FT and the DFT 5.4 Circular Convolution 5.5 Classification of Finite-Length Sequences 5.6 DFT Symmetry Relations 5.7 Discrete Fourier Transform Theorems 5.8 Fourier-Domain Filtering 5.9 Computation of the DFT of Real Sequences 5.10 Linear Convolution using the DFT Chapter 5 Finite-Length Discrete Transforms 1. Definition 1. Definition 1. Definition 1)周期性 2)共轭性 3)对称性 4) 5) 1. Definition 1. Definition 1. Definition L反映序列长度 N反映DFT点数 1. Definition 1. Definition 1. Definition 2. Matrix Relations 2. Matrix Relations 2. Matrix Relations 2. Matrix Relations The functions to compute the DFT and the IDFT are fft and ifft These functions make use of FFT al