快速傅里叶变换01.pptVIP

下载本文档

3
0
约4.66千字
约 26页
2018-04-12 发布于天津
举报
版权申诉

快速傅里叶变换01.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文档。上传文档

快速傅里叶变换01

* Chapter 3 Fast Fourier Transform Fast DFT * Basic Contents 3.1 DFT computation cost 3.2 DIT-FFT: Decimation-In-Time FFT 3.3 DIF-FFT: Decimation-In-Frequency FFT 3.4 Inverse FFT – IFFT 3.5 FFT for Real Sequence 3.6 Linear Convolution for FFT (cont’) Review * 3.1 DFT computation cost Its computational cost o(N2) Suppose x(n) is a N complex sequence, its DFT needs: N2 complex multiplications, N (N –1) complex additions * Basic Procedures decomposing large DFT into several stages of smaller DFTs Property: WNkn _ symmetric and periodic periodic: symmetry: Method to reduce DFT computational complexity DIT-FFT: Decimation-In-Time FFT DIF-FFT: Decimation-In-Frequency FFT * 3.2 radix-2 Decimation-In-Time FFT 2. Basic Concepts Radix-2: N=2M Decimation：decompose long sequence into short sequence Decimation in time： decompose long sequence x(n) into short sequence according to odd and even index. N point DFT N/2 point DFT N/4 point DFT 2 point DFT One two four N/2 Basic Ideas * Derivation: Assume N=2M ,decompose x(n) into ： 3.2 radix-2 DIT-FFT * 3.2 radix-2 DIT-FFT * “butterfly” element + - * One-Stage DIT flowchart 8-point FFT DFT N/2 DFT N/2 Even points from x[n] Odd points from x[n] “twiddle factors” * 8-point FFT DFT N/2 DFT N/2 Even points from x[n] Odd points from x[n] Continue decomposing to four N/4 DFT * Two-Stage DIT flowchart 8-point FFT DFT N/4 Even points from x1[n] DFT N/4 Odd points from x1[n] * Three-Stage DIT flowchart m=0 m=1 m=2 l=2 l =1 l =0 * -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 8-point FFT DIT-FFT Flowchart * -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 8-point FFT Level 1 Level 2 Level 3 DIT-FFT Flowchart This can be done at most v=log2N times, so after carrying out this decomposition as many times as possible, the number of complex multiplications (Nlog2N)/2 and additions is Nv = Nlog2N. * FFT computation cost N N2 (DFT) N