Location:
Search - arbitrary n fft
Search list
Description: 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 accordance with the different extraction methods can be divided into the DIT-FFT (time taken) and the DIF-FFT (according to the frequency of extraction) algorithm. In accordance with the composition of different butterfly operations can be divided into base 2, base 4, base 8, as well as arbitrary factor (2n, n is an integer greater than 1), radix-2, Radix-4 algorithm is more commonly used.
Platform: |
Size: 1024 |
Author: 李文 |
Hits:
Description: Performs N-D FFT interpolation any data for which fftn works. Will upsample by zero-filling, downsample by truncating high frequencies, or combine both up- and downsampling by dimension to allow arbitrary reshaping.-Performs N-D FFT interpolation on any data for which fftn works. Will upsample by zero-filling, downsample by truncating high frequencies, or combine both up- and downsampling by dimension to allow arbitrary reshaping.
Platform: |
Size: 2048 |
Author: ragada |
Hits:
Description: 用Matlab实现快速傅里叶变换，保证好用，直接用MATLAB打开工程并运行就能出现仿真图，自己可任意更改FFT中的N点个数。-Matlab fast Fourier transform, make sure to use, directly Matlab open project and run the simulation diagram, can appear oneself can be arbitrary changes in number N point FFT.
Platform: |
Size: 10240 |
Author: kingdomdon |
Hits:
Description: 基于C语言的任意n点FFT算法实现。可自动实现16位以内的位倒序。输入实数数列，输出复数数列。-The realization of arbitrary point n C language based on FFT algorithm. Bit reverse more than 16 can automatically realize. In real sequence, the output of complex numbers.
Platform: |
Size: 1024 |
Author: xumaoxin |
Hits: