# 数字信号处理--Chapter 5（第三版教材）.ppt

## 数字信号处理--Chapter 5（第三版教材）.ppt

1. 1、本文档共139页，可阅读全部内容。
2. 2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3. 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载
4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：19108035856(电话支持时间：9:00-19:00)。
Chapter 5 Finite-Length discrete Transforms Discrete Fourier Transform (DFT) DTFT is the Fourier Transform of discrete-time sequence. It is discrete in time domain and its spectrum is periodical, but continue which cannot be processed by computer which could only process digital signals in both sides, that means the signals in both sides must be both discrete and periodical. Discrete Fourier Transform (DFT) Time domain Frequency domain Continue aperiodical ? FT ? Continue aperiodical Periodical ? FST ? discrete spectrum Discrete ? DTFT ? periodical spectrum Discrete periodical ? DFT ? periodical discrete Typical DFT Pair δT(t) ?? ω0δω0(ω) Make a signal discrete and periodical The engineering signals are often continue and aperiodical. If we want to process the signals with DFT, we have to make the signals discrete and periodical. Make a signal discrete and periodical Discrete Fourier Transform (DFT) Definition - The simplest relation between a length-N sequence x[n], defined for 0≤n ≤N-1, and its DTFT X(ej?) is obtained by uniformly sampling X(ej?) on the w-axis between 0≤? ≤2? at ?k=2?k/N , 0≤k≤N-1 From the definition of the DTFT have Discrete Fourier Transform (DFT) Note: X[k] is also a length-N sequence in the frequency domain The sequence X[k] is called the Discrete Fourier Transform (DFT) of the sequence x[n] Using the notation WN=e-j2?/N the DFT is usually expressed as: Discrete Fourier Transform (DFT) The Inverse Discrete Fourier Transform (IDFT) is given by Discrete Fourier Transform (DFT) resulting in Discrete Fourier Transform (DFT) Making use of the identity Discrete Fourier Transform (DFT) Example - Consider the length-N sequence Discrete Fourier Transform (DFT) Example - Consider the length-N sequence Discrete Fourier Transform (DFT) Example - Consider the length-N sequence defined for 0 ≤n ≤N-1 Discrete Fourier Transform (DFT) The N-point DFT of g[n] is

### 文档评论（0）

sunyi8246 + 关注
实名认证
内容提供者

该用户很懒，什么也没介绍

认证主体孙**