Search - N-points FFT

Search - N-points FFT - List

[Algorithm] fft-by_skyline DL : 0: 这是一个我自己写的FFT的c程序，可以计算n(<4096)个点（可以是虚数）的结果 -This is one I wrote it myself FFT c procedures can be calculated n (
Date : 2026-01-03 Size : 2kb User : 王靖杰
[Algorithm] FFT_PIC DL : 0: 文件包含了FFT子程序及测试程序，其数据点数为2的n次方-Document contains FFT routines and testing procedures, the data points of the n-th power of 2
Date : 2026-01-03 Size : 45kb User : 郭建成
[Algorithm] FFT_algorithm DL : 0: FFT算法的c语言实现 c语言实现的时间抽取的FFT算法程序，输入两个参数，一个是输入序列xin，采用复数形式，数组从下标1开始存数，另一个是FFT的点数N.下面是 FFT子程序求s的256点的FFT的方法-FFT algorithm c language c language of the time taken for FFT algorithm program, enter the two parameters, one input sequence xin, using the plural form, the array subscript 1 from the start, retained, and the other is the FFT points N. The following FFT subroutine is seeking a 256 point FFT s way
Date : 2026-01-03 Size : 1kb User : caoxiaodong
[Algorithm] FFT_fp_demo DL : 0: 非常简单的浮点 FFT 运算。没有加窗。没有任何多余的东西。点数任意设。这个程序已经直接在BC下调试通过。 12.txt是GOLDWAVE将1KHz的保存为文本文件。左右声到各一个，所以在文件中有N多个两个一样的值。所以C在打开文件后要取两次，丢掉其中一个。 FFTRESU.TXT是FFT后的结果。-Float point FFT C program Very easy. No window.Any points.
Date : 2026-01-03 Size : 9kb User : chengong
[Algorithm] FFT1D DL : 0: 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.
Date : 2026-01-03 Size : 150kb User :
[Algorithm] FFT2D DL : 0: 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.
Date : 2026-01-03 Size : 513kb User :
[Algorithm] fft DL : 0: 改进的算法导论中的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.
Date : 2026-01-03 Size : 2kb User :
[Algorithm] fft DL : 0: 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
Date : 2026-01-03 Size : 12kb User : moumiao