数字信号处的理第十一章.pptVIP

下载本文档

0
0
约6.39千字
约 39页
2017-01-19 发布于福建
举报
版权申诉

数字信号处的理第十一章.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

§11.1.2 Cooley-Tukey FFT Algorithms Alternative form of radix-2 DIT and DIF follow the feature of the flow graph, we can obtain some alternative form DIT-FFT N=8 for example §11.1.2 Cooley-Tukey FFT Algorithms §11.1.2 Cooley-Tukey FFT Algorithms §11.1.3 Inverse DFT Computation differences are: §11.1.3 Inverse DFT Computation for example N=4, DIF-FFT WNr→WN-r , x→X, ×1/2 each level §11.1.3 Inverse DFT Computation In practice FFT that is: homework 11.6,11.7 Chapter 11DFT Algorithm Implementation 11.1 Computation of the Discrete Fourier Transform Chapter 11 DFT Algorithm Implementation §11.1 Computation of the Discrete Fourier Transform In order to compute the DFT or IDFT of a length-N sequence, one needs N2 complex multiplications N(N-1) complex additions §11.1 Computation of the Discrete Fourier Transform The complexity of the DFT grows with the square of the signal length. It requests a fast algorithm urgently. This severely limits its practical use for lengthy signals. for example: N=8 needs 64 complex multiplications. N=1024 needs 1,048,576 complex multiplications. In 1965, Cooley and Tukey proposed an efficient algorithm to compute the DFT, that is DIT-FFT. §11.1.2 Cooley-Tukey FFT Algorithms Ways to decrease the complexity: Using the properties of the Decompose the long sequence into shorten sequence to compute DFT Combine the some item of DFT computation. Decimation in time Decimation in frequency §11.1.2 Cooley-Tukey FFT Algorithms Radix-2 algorithm with decimation in time-DIT FFT 1. Principle of algorithm Soppose: x(n) length N=2L split x(n) into two parts even-index odd-index 2n 2n+1 §11.1.2 Cooley-Tukey FFT Algorithms N/2 points DFT N/2 points DFT Decompose length-N DFT into two length-N/2 DFT However, we only compute the N/2 points of length-N DFT at beginning, and remind other N/2 points. §11.1.2 Cooley-Tukey FFT Algorithms Now, we obtain the remind N/2 points of length-N DFT. §11.1.2 Cooley-Tukey FFT Algorithm