Location:
Search - N-points FFT
Search list
Description: 这是一个我自己写的FFT的c程序，可以计算n(<4096)个点（可以是虚数）的结果
-This is one I wrote it myself FFT c procedures can be calculated n (
Platform: |
Size: 2048 |
Author: 王靖杰 |
Hits:
Description: 用FFT分别计算Xa(n) (p=8, q=2)与Xb(n) (a =0.1,f =0.0625)的16点循环卷积和线性卷积。-Calculated using FFT, respectively, Xa (n) (p = 8, q = 2) and Xb (n) (a = 0.1, f = 0.0625) of the 16 points cyclic convolution and linear convolution.
Platform: |
Size: 10240 |
Author: 万宁宁 |
Hits:
Description: FFT and IFFT for 16-bits wave, you can
use this instead of convolution calculate, input samples must be 2^n.
If its not 2^n samples just stuff zero
in last array.
I already make it to C++ class you can
new a calss and do it easy,FFT and IFFT for 16-bits wave, you can use this instead of convolution calculate, input samples must be 2 ^ n.If its not 2 ^ n samples just stuff zeroin last array.I already make it to C++ Class you cannew a calss and do it easy
Platform: |
Size: 32768 |
Author: 小誠 |
Hits:
Description: fft源代码,#include "f2407_c.h"
#include "math.h"
#define N 32 // FFT变换的点数
extern void fft(void)；
extern void resave(void)；
interrupt void phantom(void)；
void sysinit(void)；
extern int input[2*N]； -fft source code,# include f2407_c.h# include math.h# define N 32// FFT transform points extern void fft (void) extern void resave (void) interrupt void phantom (void) void sysinit (void) extern int input [2* N]
Platform: |
Size: 5120 |
Author: |
Hits:
Description: 文件包含了FFT子程序及测试程序，其数据点数为2的n次方-Document contains FFT routines and testing procedures, the data points of the n-th power of 2
Platform: |
Size: 46080 |
Author: 郭建成 |
Hits:
Description: 计算离散傅里叶变换的一种快速算法,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。
-Discrete Fourier transform calculation of a fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by JW Cooley and TW map out Kormakiti. This algorithm enables calculation of discrete Fourier transform computer required a significant reduction in the number of multiplication, in particular by changing the sampling points N more, FFT algorithm for calculating the amount of savings will be significant.
Platform: |
Size: 1024 |
Author: 圈石 |
Hits:
Description: 用于计算fft的MATLAB程序，采用时间提取的基2算法，计算N点的FFT，程序中会自动将N部位2的n次方个点-Used to calculate the fft of the MATLAB program, using the time base 2 extraction algorithm, calculation of N point FFT, the program will automatically N parts of two of the n-th power points
Platform: |
Size: 225280 |
Author: Liu Jinglei |
Hits:
Description: FFT的奈奎斯特频率为 ，（ 为采样间隔）实际上的FFT变换点数要求为2的n次幂，各点所对应的频率是从 到 ，求出 后，可以用 ，这里N为FFT变换的点数。如变换点数为2048，由于对称性，实际有用的点数为1024个。
在该程序中，做完富氏变换后，已经将数据按照频率从0到 到0的顺序排好。
在运行结果中，只需存储左下角的1/4区域的数据即可。
-FFT of the Nyquist frequency, (for the sampling interval) is actually the FFT, the n number of points required for the power of 2, the frequency corresponding to each point is to, find, you can use the FFT, where N points. Such as the transformation point to 2048, due to the symmetry, the actual useful points to 1024. In the process, done after the Fourier transform has the data in accordance with the frequency range from 0 to 0 in order to line up. In the run results, only the lower left corner of the store 1/4 of regional data can be.
Platform: |
Size: 153600 |
Author: |
Hits:
Description: 2dFFT的奈奎斯特频率为 ，（ 为采样间隔）实际上的FFT变换点数要求为2的n次幂，各点所对应的频率是从 到 ，求出 后，可以用 ，这里N为FFT变换的点数。如变换点数为2048，由于对称性，实际有用的点数为1024个。
在该程序中，做完富氏变换后，已经将数据按照频率从0到 到0的顺序排好。
在运行结果中，只需存储左下角的1/4区域的数据即可。
-2dFFT of the Nyquist frequency, (for the sampling interval) is actually the FFT, the n number of points required for the power of 2, the frequency corresponding to each point is to, find, you can use the FFT, where N points. Such as the transformation point to 2048, due to the symmetry, the actual useful points to 1024. In the process, done after the Fourier transform has the data in accordance with the frequency range from 0 to 0 in order to line up. In the run results, only the lower left corner of the store 1/4 of regional data can be.
Platform: |
Size: 525312 |
Author: |
Hits:
Description: A radix-3 FFT for any N points. N is not limited to power of 3.
Platform: |
Size: 1024 |
Author: zi |
Hits:
Description: FFT和IFFT，时析型FFT是将序列逐次奇偶对分，奇数号排成一子序列，偶数号排成一子序列，各子序列的长度为N/2，-FFT and IFFT, the analysis type FFT is a sequence of successive parity pairs of points arranged in a sub-sequence, odd and even number of numbers arranged in a promoter sequence, each sub-sequence of length N/2,
Platform: |
Size: 192512 |
Author: 宋方方 |
Hits:
Description: 改进的算法导论中的fft代码，将nlogn的复杂度下降到n，编译成功，4096个数据点时常为2秒。-Fft code in the Introduction of the improved algorithm will be the nlogn of complex decreased to n successful compile 4096 data points from time to time for two seconds.
Platform: |
Size: 2048 |
Author: |
Hits:
Description: Matlab程序，GUI窗口
用FFT程序计算有限长度正弦信号y=sin(2*pi*f*t) ,0<=t<=N*T-FFT program calculate the finite length of the sinusoidal signal y = sin (2* pi* f* t), 0 < = t < = N* T respectively the DFT results obtained and analyzed and discussed in the following cases: a) the signal frequency f = 50Hz, the sampling the credited with N = 32, the sampling interval T = 0.000625sb) signal frequency f = 50Hz, the sampling points of N = 32, the sampling interval T = 0.005sc), the signal frequency f = 50 Hz, the sampling points N = 32, the sampling interval T = 0.0046875sd) signal frequency f = 50Hz, the sampling points of N = 32, the sampled interval T = 0.004se) signal frequency f = 50Hz, the sampling points of N = 64, the sampling interval the T = 0.000625sf) signal frequency f = 250Hz, the sampling points N = 32, the sampling interval T = 0.005sg) c) a signal-post 32, to do a 64-point FFT
Platform: |
Size: 12288 |
Author: moumiao |
Hits:
Description: The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a factor of 100 or more over direct evaluation of the DFT.
A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of N points in the obvious way, using the definition, takes O( N2 ) arithmetical operations, while an FFT can compute the same result in only O(N log N) operations.
Platform: |
Size: 10240 |
Author: Quoc Viet Ta |
Hits:
Description: The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a factor of 100 or more over direct evaluation of the DFT.
A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of N points in the obvious way, using the definition, takes O( N2 ) arithmetical operations, while an FFT can compute the same result in only O(N log N) operations.
Platform: |
Size: 166912 |
Author: Quoc Viet Ta |
Hits:
Description: The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a factor of 100 or more over direct evaluation of the DFT.
A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of N points in the obvious way, using the definition, takes O( N2 ) arithmetical operations, while an FFT can compute the same result in only O(N log N) operations.
Platform: |
Size: 659456 |
Author: Quoc Viet Ta |
Hits:
Description: 汇编写的256点FFT，余弦表是512点的，因此修改N值可以作2-1024点的FFT，在CCS上运行，带有CMD文件-Written in assembler 256 points FFT, cosine table is 512 points, so you can modify the value of N for 2-1024 Point FFT, run in the CCS, with a CMD file
Platform: |
Size: 54272 |
Author: 张艳林 |
Hits:
Description: 采用快速傅里叶变换能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。-Using fast Fourier transform computer can calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.
Platform: |
Size: 1024 |
Author: 莫志军 |
Hits:
Description: Real sequence of Fourier transform 实序列傅立叶变换 已验证 用N点FFT计算2N点实序列的FFT，比直接进行2N点FFT运算减少一半运算量
-Real sequence of Fourier transform verified with N points FFT calculation sequence of 2 N point FFT, than half 2 N point FFT operation to reduce computational complexity
Platform: |
Size: 1024 |
Author: 孙金涛 |
Hits:
Description: 快速傅里叶变换法（FFT）是离散傅立叶变换的一种快速计算方法，它能使N点DFT的乘法计算量由N2 次降为 次。下图是采样点数为8点FFT时间抽取算法信号流图，本程序也是以这种形式设计的。-Fast Fourier Transform (FFT) is a fast computational method for discrete Fourier transforms that can reduce the multiplication of N-point DFT by N2 times. The following figure is the sampling point of 8 points FFT time extraction algorithm signal flow diagram, the program is also designed in this form.
Platform: |
Size: 4096 |
Author: lqs |
Hits: