搜索资源列表
fft.rar
- FFT算法的基本原理是把长序列的DFT逐次分解为较短序列的DFT。按照抽取方式的不同可分为DIT-FFT（按时间抽取）和DIF-FFT（按频率抽取）算法。按照蝶形运算的构成不同可分为基2、基4、基8以及任意因子（2n,n为大于1的整数），基2、基4算法较为常用。,FFT algorithm is the basic principle of DFT successive long sequence is broken down into shorter sequences of DFT. In
fft
- 设计一个按照时间抽取的基2快速傅里叶变换（基2FFT-DIT）。输入倒位序，输出自然顺序。-Design is taken in accordance with the time radix-2 fast Fourier transform the (base 2FFT-DIT). Enter the inversion sequence, the output of the natural order.
fft_my
- 本程序对输入序列din实现DIT——FFT基2算法，点数取大于等于din长度的2的幂次-The program realization of the input sequence din DIT- FFT radix-2 algorithm, din length greater than or equal points to take a power of 2
FFT
- An Elementary Introduction to the Discrete Fourier Transform 1.1 ComplexNumbers 1.3 Analyzing the Series 1.5 Filtering a Signal 1.6 How Often Does One Sample? 1.7 Notes and References 1.2 Trigonometric Interpolation 1.4 Fourier Frequenc
fft2
- fft算法的C++程序，主要是基于Radix-2的DIT算法，有助于深入理解快速傅立叶变换-fft algorithm C++ program is mainly based on DIT Radix-2 algorithm, and help us to understand the fast Fourier transform! !
DIT_FFT
- 该程序实现的是数字信号处理教程中的DIT的基2快速傅里叶变换的功能，对初学者深入理解数字信号处理中的快速傅里叶变换算法有一定的帮助-The program is the realization of the DIT Radix-2 fast Fourier transform function, help beginners to understand the fast Fourier transform algorithm！！！